DOCSLIB.ORG

Interval Temporal Logic

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Interval Temporal Logic Interval Temporal Logic Antonio Cau and Ben Moszkowski 2021-04-09 HTML version of the ITL home page Abstract Interval Temporal Logic (ITL) is a flexible notation for both propositional and first-order reasoning about periods of time found in descriptions of hardware and software systems. Unlike most temporal logics, ITL can handle both sequential and parallel composition and offers powerful and extensible specification and proof techniques for reasoning about properties involving safety, liveness and pro- jected time [134]. Timing constraints are expressible and furthermore most imperative programming constructs can be viewed as formulas in a slightly modified version of ITL [125]. Tempura provides an executable framework for developing and experimenting with suitable ITL specifications. In addi- tion, ITL and its mature executable subset Tempura [157] have been extensively used to specify the properties of real-time systems where the primitive circuits can directly be represented by a set of simple temporal formulae. In addition, Tempura has been applied to hardware simulation and other areas where timing is important. 1 Contents 1 Finite Interval Temporal Logic3 1.1 Syntax............................................3 1.2 Semantics..........................................3 1.3 Derived Constructs......................................5 1.4 Propositional proof system..................................7 1.5 First order proof system...................................7 2 Finite and Infinite Interval Temporal Logic8 2.1 Syntax............................................8 2.2 Semantics..........................................8 2.3 Derived Constructs...................................... 11 2.4 Propositional proof system.................................. 13 2.5 First order proof system................................... 13 3 Tools 14 3.1 (Ana)Tempura........................................ 14 3.2 FLCheck: Fusion Logic decision Procedure......................... 21 3.3 ITL library for Isabelle/HOL................................. 23 3.3.1 Shallow embedding................................. 23 3.3.2 Deep embedding................................... 25 3.4 ITL Theorem Prover based on Prover9........................... 25 3.5 ITL Proof Checker based on PVS.............................. 26 3.6 Automatic Verification of Interval Temporal Logic..................... 26 4 ITL Related Publications 27 4.1 Articles............................................ 27 4.2 In Collections......................................... 31 4.3 Conference Papers...................................... 34 4.4 Books............................................ 42 4.5 Theses............................................ 42 4.6 Technical Reports...................................... 44 2 Table 1: Syntax of finite ITL Integer Expressions ie ::= z j A j ig(ie1; : : : ; ien) j A j fin A Boolean Expressions be ::= b j Q j bg(be1; : : : ; ben) j Q j fin Q Formulae ∗ f ::= true j h(e1; : : : ; en) j :f j f1 ^ f2 j 8V • f j skip j f1 ; f2 j f 1 Finite Interval Temporal Logic The key notion of ITL is an interval. An interval ff is considered to be a finite sequence of states ff0 : : : ffk . 1.1 Syntax The syntax of finite ITL is defined in Table1 where z denotes an integer value, A denotes a state integer variable, b denotes a Boolean value, Q denotes a state propositional variable, ig denotes a integer function symbol, bg denotes a Boolean function symbol, V denotes state (integer or Boolean) variable, ei denotes a Boolean or integer expression, h denotes a predicate symbol. 1.2 Semantics Each state ffi is the union of the mapping from the set of integer variables IntVar to the set of integer values Z and the mapping from propositional variables PropVar to set of Boolean values ftt; ffg. Each interval has at least one state. The length jffj of an interval ff0 : : : ffn is equal to n, one less than the number of states in the interval (this has always been a convention in ITL), i.e., a one state interval has length 0. Let ff = ff0ff1ff2 ::: be an interval then • ff0 : : : ffk (where 0 ≤ k ≤ jffj) denotes a prefix interval of ff • ffk : : : ffjffj (where 0 ≤ k ≤ jffj) denotes a suffix interval of ff • ffk : : : ffl (where 0 ≤ k ≤ l ≤ jffj) denotes a sub interval of ff The informal semantics of the most interesting constructs are as follows: • A: if the interval is non-empty then the value of A in the next state of that interval else an arbitrary value. • fin A: the value of A in the last state of the interval. • skip unit interval (length 1). • f1 ; f2 holds if the interval can be decomposed (“chopped”) into a prefix and suffix interval, such that f1 holds over the prefix interval and f2 over the suffix interval. 3 Table 2: Semantics of finite ITL E z (ff) = z EJAK (ff) = ff0(A) EJigK(ie1; : : : ; ien) (ff) = ig(E ie1 (ff);:::; E ien (ff)) EJ A (ff)K = ff1(AJ) K J Kif jffj > 0 J K choose-any-from(Z) otherwise E fin A (ff) = ffjffj(A) EJb (ff)K = b EJQK (ff) = ff0(Q) EJbgK(be1; : : : ; ben) (ff) = bg(E be1 (ff);:::; E ben (ff)) EJ Q (ff)K = ff1(QJ) K J K if jffj > 0 J K choose-any-from(Bool) otherwise E fin Q (ff) = ffjffj(Q) MJ true K(ff) = tt MJh(e1K; : : : ; en) (ff) = tt iff h(E e1 (ff);:::; E en (ff)) MJ:f (ff) = ttK iff not J(MK f (ff) = ttJ) K MJf1 ^K f2 (ff) = tt iff (M f1 (Jff)K = tt) and (M f2 (ff) = tt) MJskip (ffK) = tt iff jffjJ=K 1 J K 0 0 0 MJ8V •K f (ff) = tt iff (for all ff s.t. ff ∼V ff ; M f (ff ) = tt) MJf1 ; f2 (Kff) = tt iff J K J(existsKk; s.t. M f1 (ff0 : : : ffk ) = tt and M f2 (ffk : : : ffjffj) = tt) M f ∗ (ff) = ttJ K iff J K J(existK l0; : : : ; ln s.t. l0 = 0 and ln = jffj and for all 0 ≤ i < n; li < li+1 and M f (ffli : : : ffli+1 ) = tt) J K • f ∗ holds if the interval is decomposable into a finite number of intervals such that for each of them f holds. Let Σ+ denote the set of all finite intervals. Let Expressions denote the set of (integer or Boolean) expressions. Let Val denote the set of integer or Boolean values (Z [ Bool). Let E ::: () denote the meaning function from Expressions × Σ+ to Val. Let FormulaeJ K denote the set of ITL formulae. Let M ::: () denote the meaning function from Formulae × Σ+ to Bool (set of Boolean values, ftt; ffg). Let ff J= ffK0ff1 ::: denote an interval. 0 0 We write ff ∼V ff if the intervals ff and ff are identical with the possible exception of their mappings for the variable V . Let choose-any-from(Val) denote the choice function that selects an arbitrary value from Val. The formal semantics is listed in Table2: 4 1.3 Derived Constructs Frequently used derived constructs are listed in Table3–6. Table 3: Frequently used non-temporal derived constructs false , :true false value f1 _ f2 , :(:f1 ^ :f2) or f1 ⊃ f2 , :f1 _ f2 implies f1 ≡ f2 , (f1 ⊃ f2) ^ (f2 ⊃ f1) equivalent 9V • f , :8V • :f exists Table 4: Frequently used temporal derived constructs f , skip ; f next more , true non-empty interval empty , :more empty interval 3 f , true ; f sometimes 2 f , : 3 :f always w f , : :f weak next 3i f , f ; true some initial subinterval 2i f , :(3i :f ) all initial subintervals 3a f , true ; f ; true some subinterval 2a f , :(3a :f ) all subintervals 2s (f ) , empty _ (2i (f ); skip) all strict initial intervals 3s (f ) , :(2s (:f )) some strict initial interval £(f ) , f ^ 2s (:f ) first occurrence 5 Table 5: Frequently used concrete derived constructs if f0 then f1 else f2 , (f0 ^ f1) _ (:f0 ^ f2) if then else if f0 then f1 , if f0 then f1 else true if then fin f , 2(empty ⊃ f ) final state halt f , 2(empty ≡ f ) terminate interval when keep f , 2a (skip ⊃ f ) all unit subintervals keepnow f , 3i (skip ^ f ) initial unit subinterval ∗ while f0 do f1 , (f0 ^ f1) ^ fin :f0 while loop repeat f0 until f1 , f0 ;(while :f1 do f0) repeat loop f1 7! f0 , 2i (f1 ⊃ fin f0) always followed by f1 $ f0 , 2i (f1 ≡ fin f0) strong followed by Table 6: Frequently used derived constructs related to expressions Y := e , ( Y ) = e assignment Y ≈ e , 2(Y = e) equal in interval Y e , (fin Y ) = e temporal assignment Y gets e , keep (Y e) gets stable Y , Y gets Y stability padded Y , (stable (Y ); skip) _ empty padded expression Y <∼ e , (Y e) ^ padded Y padded temporal assignment intlen (e) , 9I • (I = 0) ^ (I gets I + 1) ^ (I e) interval length 6 1.4 Propositional proof system In Table7 we list the propositional axioms and rules for finite ITL. Table 7: Propositional Axioms and Rules for finite ITL. ChopAssoc ` (f0 ; f1); f2 ≡ f0 ;(f1 ; f2) OrChopImp ` (f0 _ f1); f2 ⊃ (f0 ; f2) _ (f1 ; f2) ChopOrImp ` f0 ;(f1 _ f2) ⊃ (f0 ; f1) _ (f0 ; f2) EmptyChop ` empty ; f ≡ f ChopEmpty ` f ; empty ≡ f BiBoxChopImpChop ` 2i (f0 ⊃ f1) ^ 2(f2 ⊃ f3) ⊃ (f0 ; f2) ⊃ (f1 ; f3) StateImpBi ` w ⊃ 2i w NextImpNotNextNot ` f ⊃ : :f BoxInduct ` f ^ 2(f ⊃ w f ) ⊃ 2 f ChopStarEqv ` f ∗ ≡ (empty _ ((f ^ more); f ∗)) MP ` f0 ⊃ f1; ` f0 ) ` f1 BoxGen ` f0 ) ` 2 f0 BiGen ` f0 ) ` 2i f0 1.5 First order proof system Some axioms for the first order case are shown in Table8. Let V denote a state variable. We denote by f [e = V ] that in formula f expression e is substituted for variable V . Table 8: Some First Order Axioms and Rules for finite ITL. ForallSub ` 8V • f ⊃ f [e = V ]; where the expression e has the same data and temporal type as the variable V and is free for V in f . ForallImplies ` 8V • (f1 ⊃ f2) ⊃ (f1 ⊃ 8V • f2); where V doesn’t occur freely in f1. SubstAxiom ` 2(V1 = V2) ⊃ f ≡ f [V2 = V1]: ExistsChopRight ` 9V • (f1 ; f2) ⊃ (9V • f1); f2; where V doesn’t occur freely in f2.
Load more

Recommended publications
  • A Specification-Oriented Semantics for the Refinement of Real-Time Systems
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 131 (1994) 219-241 219 Elsevier A specification-oriented semantics for the refinement of real-time systems David Scholefield and Hussein Zedan Formal Systems Research Group, Department of ComputerScience, University of York, Heslington, York, UK He Jifeng Programming Research Group. Oxford University, Keble Road, Oxford, UK Communicated by I. Mitrani Received November 1992 Revised February 1993 Abslract Scholefield, D., H. Zedan and H. Jifeng, A specification-oriented semantics for the refinement of real-time systems, Theoretical Computer Science 131 (1994) 2199241. A refinement calculus for the development of real-time systems is presented. The calculus is based upon a wide-spectrum language called the temporal agent model (TAM), within which both functional and timing properties can be expressed in either abstract or concrete terms. A specifica- tion-oriented semantics for the language is given. Program development is considered as a refine- ment process, i.e. the calculation of a structured program from an unstructured specification. A calculus of decomposition is defined. An example program is developed. 1. Introduction The formal development of a computer system is traditionally separated into four tasks: the formulation of a specification, the formulation of a design, verification between specification and design, and the translation of the design into an implemen- tation. In real-time systems, verification must take into account both functional correctness and the timeliness of results - a consideration which adds further com- plexity to an already difficult task. Correspondence to: D.
    [Show full text]
  • August 2018 FACS a C T S
    Issue 2018-1 August 2018 FACS A C T S The Newsletter of the Formal Aspects of Computing Science (FACS) Specialist Group ISSN 0950-1231 FACS FACTS Issue 2018-1 August 2018 About FACS FACTS FACS FACTS (ISSN: 0950-1231) is the newsletter of the BCS Specialist Group on Formal Aspects of Computing Science (FACS). FACS FACTS is distributed in electronic form to all FACS members. Submissions to FACS FACTS are always welcome. Please visit the newsletter area of the BCS FACS website for further details at: http://www.bcs.org/category/12461 Back issues of FACS FACTS are available for download from: http://www.bcs.org/content/conWebDoc/33135 The FACS FACTS Team Newsletter Editors Tim Denvir [email protected] Brian Monahan [email protected] Editorial Team Jonathan Bowen, John Cooke, Tim Denvir, Brian Monahan, Margaret West. Contributors to this issue Jonathan Bowen, John Cooke, Tim Denvir, Sofia Meacham. Brian Monahan, Bill Stoddart, Botond Virginas, Margaret West BCS-FACS websites BCS: http://www.bcs-facs.org LinkedIn: http://www.linkedin.com/groups?gid=2427579 Facebook: http://www.facebook.com/pages/BCS-FACS/120243984688255 Wikipedia: http://en.wikipedia.org/wiki/BCS-FACS If you have any questions about BCS-FACS, please send these to Paul Boca [email protected] 2 FACS FACTS Issue 2018-1 August 2018 Editorial Dear readers, welcome to our first issue of FACS FACTS for 2018. This year, 2018, marks the 40th anniversary of FACS. At least one editor recalls an article by Dan Simpson, member of the editorial team at the time, FACS at 10 in 1988.
    [Show full text]
  • Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics
    Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics Maciej Gazda Robert M. Hierons Department of Computer Science Department of Computer Science University of Sheffield, UK University of Sheffield, UK Abstract—We explore the problem of finding a minimal com- in which no action in X is enabled. Most work uses ioco [21] plete test suite for a refusal trace (or failure trace) semantics. or one of its variants; see [22] for an overview. In ioco, an Since complete test suites are typically infinite, we consider the observation is a trace that can contain instances of quiescence: setting with a bound ` on the length of refusal traces of interest. A test suite T is thus complete if it is failed by all processes that the situation in which the system under test (SUT) cannot contain a disallowed refusal trace of length at most `. produce output or change state without first receiving input. The proposed approach is based on generating a minimal com- The ioco test theory assumes that the SUT cannot refuse inputs plete set of forbidden refusal traces. Our solution utilises several (is input-enabled) and the environment cannot block outputs, interesting insights into refusal trace semantics. In particular, which is why quiescence is the only type of refusal. we identify a key class of refusals called fundamental refusals which essentially determine the refusal trace semantics, and the A refusal of a set X is observed through the tester offering associated fundamental equivalence relation. We then propose a the actions in X and subsequent deadlock (detected through small but not necessarily minimal test suite based on our theory, a timeout).
    [Show full text]
  • Online Communities: Visualization and Formalization
    Online Communities: Visualization and Formalization Jonathan P. Bowen Museophile Limited, Oxford, UK [email protected] www.jpbowen.com Abstract. Online communities have increased in size and importance dramat- ically over the last decade. The fact that many communities are online means that it is possible to extract information about these communities and the con- nections between their members much more easily using software tools, despite their potentially very large size. The links between members of the community can be presented visually and often this can make patterns in the structure of sub-communities immediately obvious. The links and structures of layered com- munities can also be formalized to gain a better understanding of their modelling. This paper explores these links with some specific examples, including visualiza- tion of these relationships and a formalized model of communities using the Z notation. It also considers the development of such communities within the Com- munity of Practice social science framework. Such approaches may be applicable for communities associated with cybersecurity and could be combined for a better understanding of their development. 1 Introduction The development of collective human knowledge has always depended on communities. As communities have become more computer-based, it has become easier to monitor the activity of such interactions [7]. Recently the increasing use of online communities by the wider population (e.g., for social networking) has augmented the ways that com- munities can form and interact since geographical co-location is now much less critical than before the development of the Internet and the web [1,2].
    [Show full text]
  • Facing the Challenge of Automated Negotiation with Humans
    Facing the Challenge of Automated Negotiation with Humans A dissertation submitted by Angela Fabregues Vinent at Universitat Aut`onomade Barcelona to fulfill the degree of PhD in Computer Science. Bellaterra, September 18th, 2012 Director: Prof. Carles Sierra Tutor: Dr. Josep Puyol Elaborated at: Institut d’ Investigaci´o en Intel·lig`encia Artificial Consejo Superior de Investigaciones Cient´ıficas (IIIA-CSIC) Acknowledgements Voldria agrair a molta gent el temps que ha compartit amb mi aquests darrers anys corresponents a la realitzaciod'aquesta tesi doctoral. Especialment, voldria donar les graciesa en Juan Carlos. Sempre m'has acompanyat. Sempre m'has ajudat. Sempre has estat allaquan t'he necessitat, ja fossis al meu costat o a milles enfora. Ara que nos veim cada dia, esper no te cansis de jo. T'estim! Molts coneixements previs he hagut de menester. Molts altres els he adquirit pel cam.L'escola, l'institut, la carrera i el mastera l'IIIA m'han aportat molts d'ells. Tambeel meu pas per l'empresa privada, per tot arreu s'apren. Els valors, en canvi, s'aprenen a casa. Els vaig aprendre a Menorca graciesals meus pares i tambeals meus germans. Papa! Mama! Me vau donar una infanciaimpressionant, envoltada d'un entorn ple de coses per experimentar sentint-me segura i protegida. Me vau deixar creixer,que formessa meva propia personalitat, que anesagafant responsabilitats, i que fos lliure de decidir per jo mateixa lo que ningumespodia decidir. Vau conar en jo i me vau nancar els estudis a Barcelona. Casi res! Moltes graciesper tot. Bep, amb tu vaig aprendre a enraonar, a donar mil voltes a ses coses i a poder veure-les des de diferents punts de vista.
    [Show full text]
  • Engineering Trustcom/Bigdatase 2018
    2018 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications/ 12th IEEE International Conference on Big Data Science and Engineering (TrustCom/BigDataSE 2018) New York, New York, USA 31 July - 3 August 2018 Pages 1-650 IEEE Catalog Number: CFP18TRU-POD ISBN: 978-1-5386-4389-1 1/3 Copyright © 2018 by the Institute of Electrical and Electronics Engineers, Inc. All Rights Reserved Copyright and Reprint Permissions: Abstracting is permitted with credit to the source. Libraries are permitted to photocopy beyond the limit of U.S. copyright law for private use of patrons those articles in this volume that carry a code at the bottom of the first page, provided the per-copy fee indicated in the code is paid through Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA 01923. For other copying, reprint or republication permission, write to IEEE Copyrights Manager, IEEE Service Center, 445 Hoes Lane, Piscataway, NJ 08854. All rights reserved. *** This is a print representation of what appears in the IEEE Digital Library. Some format issues inherent in the e-media version may also appear in this print version. IEEE Catalog Number: CFP18TRU-POD ISBN (Print-On-Demand): 978-1-5386-4389-1 ISBN (Online): 978-1-5386-4388-4 ISSN: 2324-898X Additional Copies of This Publication Are Available From: Curran Associates, Inc 57 Morehouse Lane Red Hook, NY 12571 USA Phone: (845) 758-0400 Fax: (845) 758-2633 E-mail: [email protected] Web: www.proceedings.com 2018 17th IEEE International Conference On Trust, Security
    [Show full text]
  • Towards Verified Systems
    TOWARDS VERIFIED SYSTEMS edited by Jonathan Bowen TOWARDS VERIFIED SYSTEMS edited by Jonathan Bow en safemos i This page delib erately left blank for publisher's use ii This page delib erately left blank for publisher's use iii This page delib erately left blank for publisher's use iv This page delib erately left blank for publisher's use Contents Foreword xvii Preface xix Contact Addresses xxiii I Intro duction 1 1 Safety-Critical Systems and Formal Metho ds 3 1.1 A Brief Historical Persp ective ::::::::::::::::::::::::: 3 1.2 Safety-critical Computer Systems ::::::::::::::::::::::: 5 1.2.1 Dep endable computer systems :: :: :: :: :: ::: :: :: :: :: 6 1.2.2 Formal metho ds ::::::::::::::::::::::::::::: 7 1.2.3 The cost of software safety ::::::::::::::::::::::: 9 1.3 Industrial-scale Examples of Use :: ::: :: :: :: :: ::: :: :: :: :: 11 1.3.1 Aviation ::::::::::::::::::::::::::::::::: 12 1.3.2 Railway systems :: :: :: ::: :: :: :: :: ::: :: :: :: :: 13 1.3.3 Nuclear p ower plants :: :: ::: :: :: :: :: ::: :: :: :: :: 13 1.3.4 Medical systems ::::::::::::::::::::::::::::: 14 1.3.5 Ammunition control :: :: ::: :: :: :: :: ::: :: :: :: :: 16 1.3.6 Emb edded micropro cessors ::::::::::::::::::::::: 17 1.4 Areas of Application of Formal Metho ds :: :: :: :: ::: :: :: :: :: 18 1.4.1 Requirements capture ::::::::::::::::::::::::: 19 1.4.2 Design : ::: :: :: :: :: ::: :: :: :: :: ::: :: :: :: :: 19 1.4.3 Compilation ::::::::::::::::::::::::::::::: 20 1.4.4 Programmable hardware :: ::: :: :: :: :: ::: :: :: :: :: 21 1.4.5 Do cumentation :::::::::::::::::::::::::::::
    [Show full text]
  • A Comprehensive Survey of Trends in Oracles for Software Testing
    1 A Comprehensive Survey of Trends in Oracles for Software Testing Mark Harman, Phil McMinn, Muzammil Shahbaz and Shin Yoo Abstract—Testing involves examining the behaviour of a system in order to discover potential faults. Determining the desired correct behaviour for a given input is called the “oracle problem”. Oracle automation is important to remove a current bottleneck which inhibits greater overall test automation; without oracle automation, the human has to determine whether observed behaviour is correct. The literature on oracles has introduced techniques for oracle automation, including modelling, specifications, contract-driven development and metamorphic testing. When none of these is completely adequate, the final source of oracle information remains the human, who may be aware of informal specifications, expectations, norms and domain specific information that provide informal oracle guidance. All forms of oracle, even the humble human, involve challenges of reducing cost and increasing benefit. This paper provides a comprehensive survey of current approaches to the oracle problem and an analysis of trends in this important area of software testing research and practice. Index Terms—Test oracle; Automatic testing; Testing formalism. F 1 INTRODUCTION undecidable problem. For example, attempting to cover all branches [6], [10], [16], [64], [77], Much work on testing seeks to automate as [159], [177] in a system under test can never be much of the test process as practical and de- complete because branch reachability is known sirable, in order to make testing faster, cheaper to be undecidable in general [192]. and more reliable. In order to automate testing, The problem of generating test inputs to we need an oracle, a procedure that determines achieve coverage of test adequacy criterion what the correct behaviour of a system should has been the subject of research interest for be for all input stimuli with which we wish nearly four decades [48], [106] and has been to subject the system under test.
    [Show full text]
  • Current Issue of FACS FACTS
    Issue 2021-2 July 2021 FACS A C T S The Newsletter of the Formal Aspects of Computing Science (FACS) Specialist Group ISSN 0950-1231 FACS FACTS Issue 2021-2 July 2021 About FACS FACTS FACS FACTS (ISSN: 0950-1231) is the newsletter of the BCS Specialist Group on Formal Aspects of Computing Science (FACS). FACS FACTS is distributed in electronic form to all FACS members. Submissions to FACS FACTS are always welcome. Please visit the newsletter area of the BCS FACS website for further details at: https://www.bcs.org/membership/member-communities/facs-formal-aspects- of-computing-science-group/newsletters/ Back issues of FACS FACTS are available for download from: https://www.bcs.org/membership/member-communities/facs-formal-aspects- of-computing-science-group/newsletters/back-issues-of-facs-facts/ The FACS FACTS Team Newsletter Editors Tim Denvir [email protected] Brian Monahan [email protected] Editorial Team: Jonathan Bowen, John Cooke, Tim Denvir, Brian Monahan, Margaret West. Contributors to this issue: Jonathan Bowen, Andrew Johnstone, Keith Lines, Brian Monahan, John Tucker, Glynn Winskel BCS-FACS websites BCS: http://www.bcs-facs.org LinkedIn: https://www.linkedin.com/groups/2427579/ Facebook: http://www.facebook.com/pages/BCS-FACS/120243984688255 Wikipedia: http://en.wikipedia.org/wiki/BCS-FACS If you have any questions about BCS-FACS, please send these to Jonathan Bowen at [email protected]. 2 FACS FACTS Issue 2021-2 July 2021 Editorial Dear readers, Welcome to the 2021-2 issue of the FACS FACTS Newsletter. A theme for this issue is suggested by the thought that it is just over 50 years since the birth of Domain Theory1.
    [Show full text]
  • Formal Specification and Runtime Verification of Parallel
    Formal Specification and Runtime Verification of Parallel Systems using Interval Temporal Logic (ITL) PhD Thesis Nayef Hmoud Alshammari This thesis is submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Software Technology Research Laboratory De Montfort University Leicester - United Kingdom 2018 Declaration of Authorship I declare that the work described in this thesis is original work undertaken by me for the degree of Doctor of Philosophy at the Software Technology Research Laboratory (STRL), at De Montfort University, United Kingdom. No part of the material described in this thesis has been submitted for any award of any other degree or qualification in this or any other university or college of advanced education. This thesis is written by me and produced using LATEX. I To my mother’s soul, Helalah bint Hujailan Alshammari (April 21st, 2016). May she rest in peace ... II Acknowledgement Firstly, I would like to express my sincere gratitude to my first supervisor Dr. Francois Seiwe and second supervisor Dr. Antonio Cau for their continuous support of my PhD study and related research, and for their patience, motivation, and immense knowledge. Their guidance helped me during the time of my research and writing of this thesis. I could not have had more qualified supervisors for my PhD study. Also, I would like to express my great appreciation to Dr. Antonio Cau for the remarkable theoretical and practical support which he offered during the study of my PhD. I would also like to thank my former supervisors Dr. Ben Moszkowski and Dr. Jordan Dimitrov for their roles during my PhD.
    [Show full text]
  • 1 Publications
    1 Publications Chronological list [1] Martin Fränzle. Verification of compilers for recursive occam-like languages. ProCoS Technical Report Kiel MF 8/1, Christian-Albrechts-Universität Kiel, Germany, 1990. [2] Martin Fränzle. Operational failure approximation. In Dines Bjørner, Hans Langmaack, and C. A. R. Hoare, editors, Monograph of the ESPRIT BRA 3104 ProCoS (Provably Correct Systems), pages 165–206. Technical Report, Dept. of Computer Science, Technical University of Denmark, 1992. [3] B. Buth, K.-H. Buth, M. Fränzle, B. von Karger, Y. Lakhneche, H. Langmaack, and M. Müller- Olm. Provably correct compiler development and implementation. In U. Kastens and P. Pfahler, editors, Compiler Construction, volume 641 of Lecture Notes in Computer Science, pages 141–155. Springer-Verlag, 1992. [4] Jonathan P. Bowen, Martin Fränzle, Ernst-Rüdiger Olderog, and Anders P. Ravn. Developing correct systems. In Proc. 5th Euromicro Workshop on Real-Time Systems, Oulu, Finland, pages 176–189. IEEE Computer Society Press, June 1993. [5] Martin Fränzle and Markus Müller-Olm. Drift and granularity of time in real-time system implementation. ProCoS Technical Report Kiel MF 10/2, Christian-Albrechts-Universität Kiel, Germany, August 1993. [6] Martin Fränzle and Burghard von Karger. Proposal for a programming language core for ProCoS II. ProCoS Technical Report Kiel MF 11/3, Christian-Albrechts-Universität Kiel, Ger- many, August 1993. [7] M. R. Hansen, E.-R. Olderog, M. Schenke, M. Fränzle, B. von Karger, M. Müller-Olm, and H. Rischel. A Duration Calculus semantics for real-time reactive systems. ProCoS II document [OLD MRH 1/1], Oldenburg Universität, Germany, September 1993. [8] Martin Fränzle and Markus Müller-Olm.
    [Show full text]
  • Issue 2005 2 June 2005
    , . Issue 2005-2 FACS June 2005 A FM E C A A C ~v1 L F (~ T ~J1 ETHODS C 1 BCS R S(:S(: M S Z A UM L I FM SI G E E E E E BCS The Newsletter of the Formal Aspects of 6 FACS Computing Science (FACS) Specialist Group ISSN 0950-1231 , " -40 , . FACS FACTS Iss ue 2005-2 June 2005 :~::;'::i(t::·::!:\,,: h\boJi EACS.FACTS .. '::':--'}U},;"";",::,:::: '}::::-::/:W::::::'" :,:':':t\i{\, '::;:=/';tt::-:· . , . EAG,sFACi,s[ I S$N:Q950~12311 U S ! h ~ Q~W~letter . of ·ihe BQ$ Specialist · (Sfoup 8h .·· FpribaIAsp~ Cts ·otCornputihg ·S§ience(FACS}; 'FACSFAGTS.• is· dfstributed in electronic form !ball FACS members. · .... A~from ';605 : FACS ?A hs ~ lii ' b~ ~clbl: g~~a foJ~\iinesayea 6 Mar c ti : • June; September and December. Submissions are always welcome .. p l g<!s~seetQe <3d¥~rt.. .or1 page2~fo r fU~herde! <! i ls of·yisil thenew§lg!ter .•.• areaOfthe FACS websile [ http: //www .bcs ~facs . org/newsletterr .. .. ............ .- ... -..... -,'- . Back issU~s . of FAGSFA GTS~re avai l ~ bl e t6 .downlda d frorTE The FACS FACTS Tea m . ..,., . Newsletted ::ditor . Paul B6ca [editor@fac;sfacts ci nfol Editori.al Team J61lathanBowerl,J udith Ca rlton, John Cooke; . Kevin Lano., Mike Siannett Colu rn nist~.i •. ' Din es Bj0rn er (The •~ ai l waY.oClm a i r1) ...•. Judith Carlton(Puzzles) " ....... ... Contribqtors .to t h.isJsSU€) ; Dines Bj0mer, Eerke Boiten, Jonathan . Bowen , Judith Ca ri ton, Roger Carsley, J o hn . D E! r ri 9~• . George E lef~er<;lki§ ; J ose ; Fiade i ro , Joh n F i tzg~ta l d, Carroll Morgan, Fiona Polack, F.X.
    [Show full text]