Computer-Aided Program Design
|
|
- Janice Barton
- 5 years ago
- Views:
Transcription
1 Computer-Aided Program Design Spring 2015, Rice University Unit 3 Swarat Chaudhuri February 5, 2015
2 Temporal logic Propositional logic is a good language for describing properties of program states. However, programs have dynamics: a program s state evolves during its execution. Temporal logics are useful for reasoning about this dynamics. Long history: goes back to Greek philosophers Introduced to computer science by Pnueli and Manna.
3 (Propositional) Linear Temporal Logic: Syntax Let Prop be a set of propositional variables. A formula ϕ in (propositional) Linear Temporal Logic (LTL) has the form ϕ ::= p ϕ 1 ϕ 1 ϕ 2 ϕ 1 ϕ 2 X ϕ 1 ϕ 1 U ϕ 2 where p Prop. In the above, ϕ 1 and ϕ 2 are subformulas of ϕ. A state formula is a formula of the form p or p, where p Prop. [ madhavan/papers/pdf/isical97.pdf.]
4 LTL: Semantics Interpretations are infinite words over 2 Prop : w = {P, Q}.{Q}.{Q, R}. w, m = ϕ if ϕ evaluates to true on w at time point m w, m = ϕ false
5 LTL: Semantics Interpretations are infinite words over 2 Prop : w = {P, Q}.{Q}.{Q, R}. w, m = ϕ if ϕ evaluates to true on w at time point m w, m = ϕ false Inductive definition of semantics: w, m = w, m = w, m = P iff P w m w, m = ϕ iff w, m = ϕ w, m = ϕ 1 ϕ 2 iff w, m = ϕ 1 and w, m = ϕ 2 w, m = ϕ 1 ϕ 2 iff w, m = ϕ 1 or w, m = ϕ 2 w, m = X ϕ 1 iff w, m + 1 = ϕ 1 w, m = (ϕ 1 U ϕ 2 ) iff m m : w, m = ϕ 2 and m n < m : w, n = ϕ 1.
6 Exercises Write the following properties in LTL: Eventually, P will hold. This is abbreviated as F P or P. P always holds. This is abbreviated as G P or P.
7 Exercises Write the following properties in LTL: Eventually, P will hold. This is abbreviated as F P or P. P always holds. This is abbreviated as G P or P. After a certain stable point, P holds forever.
8 Exercises Write the following properties in LTL: Eventually, P will hold. This is abbreviated as F P or P. P always holds. This is abbreviated as G P or P. After a certain stable point, P holds forever. P holds infinitely often in the trace.
9 Exercises Write the following properties in LTL: Eventually, P will hold. This is abbreviated as F P or P. P always holds. This is abbreviated as G P or P. After a certain stable point, P holds forever. P holds infinitely often in the trace. Consider a system that schedules access to a shared resource among k competing processes named 1,..., k. Express: Mutual exclusion Processes are scheduled fairly When a process requests the resource, it stays in a requesting state until the request is granted.
10 Exercises Write in LTL: If A occurs at least twice, then A occurs infinitely often. A holds at all states s 3k and does not hold at all states s 3k+1, s 3k+2, where k = 0, 1,....
11 Exercises What do the following properties mean? F G A
12 Exercises What do the following properties mean? F G A F G (A X A)
13 Exercises What do the following properties mean? F G A F G (A X A) A U A
14 LTL verification Given: Symbolic transition system M, LTL property ϕ. Question: Do all paths in M starting from an initial state satisfy ϕ? To start with, let us assume with a transition system that is represented explicitly: (States, InitStates,, λ) States is a finite set of states InitStates States is a finite set of initial states States States is a transition relation λ : States 2 Prop is a labeling of states with atomic propositions.
15 Key: relationship between LTL and automata A Büchi automaton A is a finite automaton that runs on infinite words Definition: A = (S, Σ, S in,, G) S is a set of states Σ is an input alphabet Sin S is a set of initial states S Σ S is a transition relation G is a set of accepting states.
16 Semantics of Büchi automata Let w = w 0 w 1 w 2... be an infinite word over Σ. Run of A on w: infinite word ρ = s 0 s 1 s 2... over S such that s 0 S in for all i 0, (s i, w i, s i+1 ). The run ρ is accepting iff an accepting state appears infinitely often in ρ A accepts w iff A has an accepting run on w.
17 Büchi automata Construct an automaton with input alphabet {a, b} that accepts: All words where a occurs infinitely often
18 Büchi automata Construct an automaton with input alphabet {a, b} that accepts: All words where a occurs infinitely often All words where a occurs only finitely often
19 Büchi automata Construct an automaton with input alphabet {a, b} that accepts: All words where a occurs infinitely often All words where a occurs only finitely often All words with an infinite suffix consisting only of b s.
20 Büchi automata Construct an automaton with input alphabet {a, b} that accepts: All words where a occurs infinitely often All words where a occurs only finitely often All words with an infinite suffix consisting only of b s. Compute a Buchi automaton that accepts the intersection of the languages of two given Buchi automata.
21 LTL to Büchi automata Every LTL formula ϕ can be converted to a Büchi automaton A ϕ over the input alphabet 2 Prop such that for any word w over 2 Prop, w = ϕ iff A ϕ accepts w. See construction in chapter madhavan/papers/pdf/isical97.pdf.
22 Before we go there: algorithms for Büchi automata Let L(A), the language of A, be the set of words accepted by A. Given two Buchi automata A 1 and A 2, construct an automaton that accepts L(A1 ) L(A 2 )
23 Before we go there: algorithms for Büchi automata Let L(A), the language of A, be the set of words accepted by A. Given two Buchi automata A 1 and A 2, construct an automaton that accepts L(A1 ) L(A 2 ) L(A1 ) L(A 2 ).
24 Before we go there: algorithms for Büchi automata Let L(A), the language of A, be the set of words accepted by A. Given two Buchi automata A 1 and A 2, construct an automaton that accepts L(A1 ) L(A 2 ) L(A1 ) L(A 2 ). Give an algorithm to check, for given A, if L(A) is empty.
25 Generalized Büchi automata Büchi automata with k sets of accepting states. A # = (S, Σ, S in,, G 1,..., G k ) A run is accepting iff it visits every set G 1,..., G k infinitely often.
26 Generalized Büchi automata Büchi automata with k sets of accepting states. A # = (S, Σ, S in,, G 1,..., G k ) A run is accepting iff it visits every set G 1,..., G k infinitely often. Let A i be (S, Σ, S in,, G i ). It is easy to see that L(A # ) = i L(A i ).
27 Generalized Büchi automata Büchi automata with k sets of accepting states. A # = (S, Σ, S in,, G 1,..., G k ) A run is accepting iff it visits every set G 1,..., G k infinitely often. Let A i be (S, Σ, S in,, G i ). It is easy to see that L(A # ) = i L(A i ). Question: what s the complexity of converting a Generalized Buchi automaton to a regular Buchi automaton? (Hint: use a variant of the round-robin argument used for intersection.)
28 LTL to Büchi: steps Fischer-Ladner closure Atoms: construction of automaton states Construction of generalized Büchi automaton Conversion into standard Büchi automaton (optional).
29 LTL to Büchi: Fischer-Ladner closure Suppose ϕ is the formula that we want to convert to a Buchi automaton. The (Fischer-Ladner) closure FL ϕ of ϕ is defined as the least set of formulas such that: If ϕ FL ϕ If ψ FL ϕ then ψ FL ϕ (we identify ψ with ψ) If ψ 1 ψ 2 FL ϕ then ψ 1, ψ 2 FL ϕ If ψ 1 ψ 2 FL ϕ then ψ 1, ψ 2 FL ϕ If X ψ 1 FL ϕ then ψ 1 FL ϕ ψ 1 U ψ 2 FL ϕ then ψ 1, ψ 2, X (ψ 1 U ψ 2 ) FL ϕ.
30 Atoms A atom is a set S FL ϕ such that: ψ S iff ψ / S ψ 1 ψ 2 S iff ψ 1 S and ψ 2 S ψ 1 ψ 2 S iff ψ 1 S or ψ 2 S ψ 1 U ψ 2 S iff either ψ 2 S or ψ 1, X (ψ 1 U ψ 2 ) S Let the set of all atoms constructed this way be called Atom ϕ.
31 Compilation to generalized Buchi automaton Set of states: Atom ϕ
32 Compilation to generalized Buchi automaton Set of states: Atom ϕ Initial states: any state that contains ϕ
33 Compilation to generalized Buchi automaton Set of states: Atom ϕ Initial states: any state that contains ϕ Transitions: triples (S 1, P, S 2 ) where: X ψ S1 and ψ S 2 for some ψ X ψ S1 and ψ S 2 for some ψ P is the set of atomic propositions in S 1.
34 Compilation to generalized Buchi automaton Set of states: Atom ϕ Initial states: any state that contains ϕ Transitions: triples (S 1, P, S 2 ) where: X ψ S1 and ψ S 2 for some ψ X ψ S1 and ψ S 2 for some ψ P is the set of atomic propositions in S 1. Accepting states: For each formula ψ 1 U ψ 2 FL ϕ, define a set of accepting states G i, consisting of all states S such that: either ψ2 S or ψ 1 U ψ 2 / S.
35 Compilation to generalized Buchi automaton Set of states: Atom ϕ Initial states: any state that contains ϕ Transitions: triples (S 1, P, S 2 ) where: X ψ S1 and ψ S 2 for some ψ X ψ S1 and ψ S 2 for some ψ P is the set of atomic propositions in S 1. Accepting states: For each formula ψ 1 U ψ 2 FL ϕ, define a set of accepting states G i, consisting of all states S such that: either ψ2 S or ψ 1 U ψ 2 / S. You can go from generalized Buchi automaton to Buchi automaton by a variant of the intersection construction. For verification, you can work on generalized Buchi automaton directly.
36 Automata-theoretic verification for LTL Given: 1. (Explicit) transition system M = (States, InitStates,, λ) 2. LTL formula ϕ. Each execution of M is an interpretation for ϕ. Let the set of all such interpretations be L(M). Question: Verify that all executions of M satisfy ϕ.
37 Automata-theoretic verification for LTL Given: 1. (Explicit) transition system M = (States, InitStates,, λ) 2. LTL formula ϕ. Each execution of M is an interpretation for ϕ. Let the set of all such interpretations be L(M). Question: Verify that all executions of M satisfy ϕ. Solution: 1. Convert ϕ into a (generalized) Buchi automaton A. 2. Question: L(M) L(A) =?
38 Verification using SPIN SPIN: system for LTL verification of finite-state systems:
39 Verification using SPIN SPIN: system for LTL verification of finite-state systems: Formula to Buchi automaton: spin -f []p Verification: $ spin -a zune.pml $ cc pan.c $ a.out -a Try out the examples in the Tests folder, in particular Peterson s protocol and the Zune bug.
40 SPIN internals Essence of algorithm for Buchi emptiness: search for a cycle that is: (a) reachable from an initial state; and (b) contains an accepting state. Algorithm: Nested DFS, implemented in SPIN system. Question: What is the naive DFS algorithm for LTL verification?
41 Avoiding the quadratic complexity Suppose you have nodes u and v, and you know: u is an ancestor of v in a DFS tree You know that v is not in a cycle Theorem: No cycle containing u contains nodes reachable from v. In other words, you can ignore states reached from v while doing the nested search from u.
42 Nested DFS DFS(s): if error then report error add <s,0> to Visited for t Next(s): if <t,0> / Visited: DFS(t) if accepting(s): seed = s; NDFS(s) NDFS(s): add <s,1> to Visited for all t in Next(s): if <t,1> / Visited: NDFS(t) else if t == seed: report cycle
43 Question for discussion Do we really require a finite state system to apply nested DFS?
44 Question for discussion Do we really require a finite state system to apply nested DFS? What happens when we go from explicit transition systems to symbolic transition systems?
45 SAT-based bounded model checking for LTL Earlier, we studied bounded verification for assertions. In the language of LTL, they are safety properties of the form G p. What about general LTL properties?
46 SAT-based bounded model checking for LTL Earlier, we studied bounded verification for assertions. In the language of LTL, they are safety properties of the form G p. What about general LTL properties? Idea: search for lassos in a bounded way: For example, to find if the property F p is violated in k steps or less, check satisfiability of k 1 B(k) = In(X 0 ) T (X i, X i+1 ) i=0 k k P(X i ) (X i = X k ) i=0 i=0
T Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationTimo Latvala. February 4, 2004
Reactive Systems: Temporal Logic LT L Timo Latvala February 4, 2004 Reactive Systems: Temporal Logic LT L 8-1 Temporal Logics Temporal logics are currently the most widely used specification formalism
More informationTemporal Logic Model Checking
18 Feb, 2009 Thomas Wahl, Oxford University Temporal Logic Model Checking 1 Temporal Logic Model Checking Thomas Wahl Computing Laboratory, Oxford University 18 Feb, 2009 Thomas Wahl, Oxford University
More informationBüchi Automata and Linear Temporal Logic
Büchi Automata and Linear Temporal Logic Joshua D. Guttman Worcester Polytechnic Institute 18 February 2010 Guttman ( WPI ) Büchi & LTL 18 Feb 10 1 / 10 Büchi Automata Definition A Büchi automaton is a
More informationLinear Temporal Logic and Büchi Automata
Linear Temporal Logic and Büchi Automata Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 Yih-Kuen Tsay (SVVRL @ IM.NTU) Linear Temporal Logic and Büchi Automata
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationLTL Model Checking. Wishnu Prasetya.
LTL Model Checking Wishnu Prasetya wishnu@cs.uu.nl www.cs.uu.nl/docs/vakken/pv Overview This pack : Abstract model of programs Temporal properties Verification (via model checking) algorithm Concurrency
More informationSanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Explicit-State Model Checking: Additional Material Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: G. Holzmann Checking if M satisfies : Steps 1. Compute Buchi
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationChapter 3: Linear temporal logic
INFOF412 Formal verification of computer systems Chapter 3: Linear temporal logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 LTL: a specification
More informationAutomata on Infinite words and LTL Model Checking
Automata on Infinite words and LTL Model Checking Rodica Condurache Lecture 4 Lecture 4 Automata on Infinite words and LTL Model Checking 1 / 35 Labeled Transition Systems Let AP be the (finite) set of
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationTemporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
More informationFrom Liveness to Promptness
From Liveness to Promptness Orna Kupferman Hebrew University Nir Piterman EPFL Moshe Y. Vardi Rice University Abstract Liveness temporal properties state that something good eventually happens, e.g., every
More informationAutomata-Theoretic Model Checking of Reactive Systems
Automata-Theoretic Model Checking of Reactive Systems Radu Iosif Verimag/CNRS (Grenoble, France) Thanks to Tom Henzinger (IST, Austria), Barbara Jobstmann (CNRS, Grenoble) and Doron Peled (Bar-Ilan University,
More informationAutomata-based Verification - III
CS3172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20/22: email: howard.barringer@manchester.ac.uk March 2005 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationLecture Notes on Emptiness Checking, LTL Büchi Automata
15-414: Bug Catching: Automated Program Verification Lecture Notes on Emptiness Checking, LTL Büchi Automata Matt Fredrikson André Platzer Carnegie Mellon University Lecture 18 1 Introduction We ve seen
More informationLogic Model Checking
Logic Model Checking Lecture Notes 10:18 Caltech 101b.2 January-March 2004 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. the assignment
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
More informationFormal Verification Techniques. Riccardo Sisto, Politecnico di Torino
Formal Verification Techniques Riccardo Sisto, Politecnico di Torino State exploration State Exploration and Theorem Proving Exhaustive exploration => result is certain (correctness or noncorrectness proof)
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationHelsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 66
Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 66 Teknillisen korkeakoulun tietojenkäsittelyteorian laboratorion tutkimusraportti 66 Espoo 2000 HUT-TCS-A66
More informationLinear-time Temporal Logic
Linear-time Temporal Logic Pedro Cabalar Department of Computer Science University of Corunna, SPAIN cabalar@udc.es 2015/2016 P. Cabalar ( Department Linear oftemporal Computer Logic Science University
More informationLinear-Time Logic. Hao Zheng
Linear-Time Logic Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757 Fax: (813)974-5456 Hao Zheng (CSE, USF)
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationAn On-the-fly Tableau Construction for a Real-Time Temporal Logic
#! & F $ F ' F " F % An On-the-fly Tableau Construction for a Real-Time Temporal Logic Marc Geilen and Dennis Dams Faculty of Electrical Engineering, Eindhoven University of Technology P.O.Box 513, 5600
More informationCS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics
CS256/Spring 2008 Lecture #11 Zohar Manna Beyond Temporal Logics Temporal logic expresses properties of infinite sequences of states, but there are interesting properties that cannot be expressed, e.g.,
More informationAutomata-Theoretic LTL Model-Checking
Automata-Theoretic LTL Model-Checking Arie Gurfinkel arie@cmu.edu SEI/CMU Automata-Theoretic LTL Model-Checking p.1 LTL - Linear Time Logic (Pn 77) Determines Patterns on Infinite Traces Atomic Propositions
More informationTemporal Logic. M φ. Outline. Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness. Ralf Huuck. Kripke Structure
Outline Temporal Logic Ralf Huuck Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness Model Checking Problem model, program? M φ satisfies, Implements, refines property, specification
More informationPSPACE-completeness of LTL/CTL model checking
PSPACE-completeness of LTL/CTL model checking Peter Lohmann April 10, 2007 Abstract This paper will give a proof for the PSPACE-completeness of LTLsatisfiability and for the PSPACE-completeness of the
More informationChapter 5: Linear Temporal Logic
Chapter 5: Linear Temporal Logic Prof. Ali Movaghar Verification of Reactive Systems Spring 94 Outline We introduce linear temporal logic (LTL), a logical formalism that is suited for specifying LT properties.
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationFinite-State Model Checking
EECS 219C: Computer-Aided Verification Intro. to Model Checking: Models and Properties Sanjit A. Seshia EECS, UC Berkeley Finite-State Model Checking G(p X q) Temporal logic q p FSM Model Checker Yes,
More informationIntroduction to Model Checking. Debdeep Mukhopadhyay IIT Madras
Introduction to Model Checking Debdeep Mukhopadhyay IIT Madras How good can you fight bugs? Comprising of three parts Formal Verification techniques consist of three parts: 1. A framework for modeling
More informationCourse Runtime Verification
Course Martin Leucker (ISP) Volker Stolz (Høgskolen i Bergen, NO) INF5140 / V17 Chapters of the Course Chapter 1 Recall in More Depth Chapter 2 Specification Languages on Words Chapter 3 LTL on Finite
More informationCS477 Formal Software Dev Methods
CS477 Formal Software Dev Methods Elsa L Gunter 2112 SC, UIUC egunter@illinois.edu http://courses.engr.illinois.edu/cs477 Slides based in part on previous lectures by Mahesh Vishwanathan, and by Gul Agha
More informationModal and Temporal Logics
Modal and Temporal Logics Colin Stirling School of Informatics University of Edinburgh July 23, 2003 Why modal and temporal logics? 1 Computational System Modal and temporal logics Operational semantics
More informationComputation Tree Logic (CTL)
Computation Tree Logic (CTL) Fazle Rabbi University of Oslo, Oslo, Norway Bergen University College, Bergen, Norway fazlr@student.matnat.uio.no, Fazle.Rabbi@hib.no May 30, 2015 Fazle Rabbi et al. (UiO,
More informationPSL Model Checking and Run-time Verification via Testers
PSL Model Checking and Run-time Verification via Testers Formal Methods 2006 Aleksandr Zaks and Amir Pnueli New York University Introduction Motivation (Why PSL?) A new property specification language,
More informationOverview. overview / 357
Overview overview6.1 Introduction Modelling parallel systems Linear Time Properties Regular Properties Linear Temporal Logic (LTL) Computation Tree Logic syntax and semantics of CTL expressiveness of CTL
More informationTHEORY OF SYSTEMS MODELING AND ANALYSIS. Henny Sipma Stanford University. Master class Washington University at St Louis November 16, 2006
THEORY OF SYSTEMS MODELING AND ANALYSIS Henny Sipma Stanford University Master class Washington University at St Louis November 16, 2006 1 1 COURSE OUTLINE 8:37-10:00 Introduction -- Computational model
More informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
More informationComputation Tree Logic
Computation Tree Logic Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757 Fax: (813)974-5456 Hao Zheng (CSE,
More informationESE601: Hybrid Systems. Introduction to verification
ESE601: Hybrid Systems Introduction to verification Spring 2006 Suggested reading material Papers (R14) - (R16) on the website. The book Model checking by Clarke, Grumberg and Peled. What is verification?
More informationLTL is Closed Under Topological Closure
LTL is Closed Under Topological Closure Grgur Petric Maretić, Mohammad Torabi Dashti, David Basin Department of Computer Science, ETH Universitätstrasse 6 Zürich, Switzerland Abstract We constructively
More informationModel Checking of Safety Properties
Model Checking of Safety Properties Orna Kupferman Hebrew University Moshe Y. Vardi Rice University October 15, 2010 Abstract Of special interest in formal verification are safety properties, which assert
More informationModel Checking Algorithms
Model Checking Algorithms Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan November 14, 2018 Bow-Yaw Wang (Academia Sinica) Model Checking Algorithms November 14, 2018 1 / 56 Outline
More informationGuest lecturer: Prof. Mark Reynolds, The University of Western Australia
Università degli studi di Udine Corso per il dottorato di ricerca: Temporal Logics: Satisfiability Checking, Model Checking, and Synthesis January 2017 Lecture 01, Part 02: Temporal Logics Guest lecturer:
More informationIntroduction. Büchi Automata and Model Checking. Outline. Büchi Automata. The simplest computation model for infinite behaviors is the
Introduction Büchi Automata and Model Checking Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 The simplest computation model for finite behaviors is the finite
More informationVisibly Linear Dynamic Logic
Visibly Linear Dynamic Logic Joint work with Alexander Weinert (Saarland University) Martin Zimmermann Saarland University September 8th, 2016 Highlights Conference, Brussels, Belgium Martin Zimmermann
More informationTecniche di Specifica e di Verifica. Automata-based LTL Model-Checking
Tecniche di Specifica e di Verifica Automata-based LTL Model-Checking Finite state automata A finite state automaton is a tuple A = (Σ,S,S 0,R,F) Σ: set of input symbols S: set of states -- S 0 : set of
More informationAbstractions and Decision Procedures for Effective Software Model Checking
Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture
More informationA Hierarchy for Accellera s Property Specification Language
A Hierarchy for Accellera s Property Specification Language Thomas Türk May 1st, 2005 Diploma Thesis University of Kaiserslautern Supervisor: Prof. Dr. Klaus Schneider Vorliegende Diplomarbeit wurde von
More informationSymmetry Reductions. A. Prasad Sistla University Of Illinois at Chicago
Symmetry Reductions. A. Prasad Sistla University Of Illinois at Chicago Model-Checking Concurrent PGM Temporal SPEC Model Checker Yes/No Counter Example Approach Build the global state graph Algorithm
More informationTecniche di Specifica e di Verifica. Automata-based LTL Model-Checking
Tecniche di Specifica e di Verifica Automata-based LTL Model-Checking Finite state automata A finite state automaton is a tuple A = (S,S,S 0,R,F) S: set of input symbols S: set of states -- S 0 : set of
More informationVerifying Temporal Properties of Reactive Systems: A STeP Tutorial *
Formal Methods in System Design, 16, 1 45 (2000) c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Verifying Temporal Properties of Reactive Systems: A STeP Tutorial * NIKOLAJ
More informationGuest lecturer: Mark Reynolds, The University of Western Australia. May 7, 2014
Università degli studi di Udine Laurea Magistrale: Informatica Lectures for April/May 2014 La verifica del software: temporal logic Lecture 03 LTL tableau continued Guest lecturer: Mark Reynolds, The University
More informationSymbolic Model Checking Property Specification Language*
Symbolic Model Checking Property Specification Language* Ji Wang National Laboratory for Parallel and Distributed Processing National University of Defense Technology *Joint Work with Wanwei Liu, Huowang
More informationComparing LTL Semantics for Runtime Verification
Comparing LTL Semantics for Runtime Verification Andreas Bauer 1, Martin Leucker 2, and Christian Schallhart 2 1 National ICT Australia (NICTA) 2 Institut für Informatik, Technische Universität München
More informationAn Introduction to Temporal Logics
An Introduction to Temporal Logics c 2001,2004 M. Lawford Outline Motivation: Dining Philosophers Safety, Liveness, Fairness & Justice Kripke structures, LTS, SELTS, and Paths Linear Temporal Logic Branching
More informationIC3 and Beyond: Incremental, Inductive Verification
IC3 and Beyond: Incremental, Inductive Verification Aaron R. Bradley ECEE, CU Boulder & Summit Middle School IC3 and Beyond: Incremental, Inductive Verification 1/62 Induction Foundation of verification
More informationLTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
This space is reserved for the EPiC Series header, do not use it LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems Rachel Faran and Orna Kupferman The Hebrew University,
More informationModel Checking: An Introduction
Model Checking: An Introduction Meeting 3, CSCI 5535, Spring 2013 Announcements Homework 0 ( Preliminaries ) out, due Friday Saturday This Week Dive into research motivating CSCI 5535 Next Week Begin foundations
More informationModel Checking. Temporal Logic. Fifth International Symposium in Programming, volume. of concurrent systems in CESAR. In Proceedings of the
Sérgio Campos, Edmund Why? Advantages: No proofs Fast Counter-examples No problem with partial specifications can easily express many concurrency properties Main Disadvantage: State Explosion Problem Too
More informationThe algorithmic analysis of hybrid system
The algorithmic analysis of hybrid system Authors: R.Alur, C. Courcoubetis etc. Course teacher: Prof. Ugo Buy Xin Li, Huiyong Xiao Nov. 13, 2002 Summary What s a hybrid system? Definition of Hybrid Automaton
More informationFrom Löwenheim to Pnueli, from Pnueli to PSL and SVA
From Löwenheim to Pnueli, from Pnueli to PSL and SVA Moshe Y. Vardi Rice University Thread I: Monadic Logic Monadic Class: First-order logic with = and monadic predicates captures syllogisms. ( x)p(x),
More informationModel for reactive systems/software
Temporal Logics CS 5219 Abhik Roychoudhury National University of Singapore The big picture Software/ Sys. to be built (Dream) Properties to Satisfy (caution) Today s lecture System Model (Rough Idea)
More informationScenario Graphs and Attack Graphs
Scenario Graphs and Attack Graphs Oleg Mikhail Sheyner CMU-CS-04-122 April 14, 2004 School of Computer Science Computer Science Department Carnegie Mellon University Pittsburgh, PA Thesis Committee: Jeannette
More informationCS 267: Automated Verification. Lecture 1: Brief Introduction. Transition Systems. Temporal Logic LTL. Instructor: Tevfik Bultan
CS 267: Automated Verification Lecture 1: Brief Introduction. Transition Systems. Temporal Logic LTL. Instructor: Tevfik Bultan What do these people have in common? 2013 Leslie Lamport 2007 Clarke, Edmund
More informationSAT-Based Explicit LTL Reasoning
SAT-Based Explicit LTL Reasoning Jianwen Li 1,2 Shufang Zhu 2 Geguang Pu 2 Moshe Y. Vardi 1 1. Rice University 2. East China Normal University August 22, 2016 Temporal Reasoning Church, 1957: Given a model
More informationAlternating Time Temporal Logics*
Alternating Time Temporal Logics* Sophie Pinchinat Visiting Research Fellow at RSISE Marie Curie Outgoing International Fellowship * @article{alur2002, title={alternating-time Temporal Logic}, author={alur,
More informationMODEL CHECKING. Arie Gurfinkel
1 MODEL CHECKING Arie Gurfinkel 2 Overview Kripke structures as models of computation CTL, LTL and property patterns CTL model-checking and counterexample generation State of the Art Model-Checkers 3 SW/HW
More information3 Propositional Logic
3 Propositional Logic 3.1 Syntax 3.2 Semantics 3.3 Equivalence and Normal Forms 3.4 Proof Procedures 3.5 Properties Propositional Logic (25th October 2007) 1 3.1 Syntax Definition 3.0 An alphabet Σ consists
More informationModel Checking with CTL. Presented by Jason Simas
Model Checking with CTL Presented by Jason Simas Model Checking with CTL Based Upon: Logic in Computer Science. Huth and Ryan. 2000. (148-215) Model Checking. Clarke, Grumberg and Peled. 1999. (1-26) Content
More informationTrace Diagnostics using Temporal Implicants
Trace Diagnostics using Temporal Implicants ATVA 15 Thomas Ferrère 1 Dejan Nickovic 2 Oded Maler 1 1 VERIMAG, University of Grenoble / CNRS 2 Austrian Institute of Technology October 14, 2015 Motivation
More informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probabilistic Model Checking Michaelmas Term 2011 Dr. Dave Parker Department of Computer Science University of Oxford Overview Temporal logic Non-probabilistic temporal logic CTL Probabilistic temporal
More informationAutomata-Theoretic Verification
Automata-Theoretic Verification Javier Esparza TU München Orna Kupferman The Hebrew University Moshe Y. Vardi Rice University 1 Introduction This chapter describes the automata-theoretic approach to the
More informationAn Introduction to Modal Logic III
An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami
More informationChapter 5: Linear Temporal Logic
Chapter 5: Linear Temporal Logic Prof. Ali Movaghar Verification of Reactive Systems Spring 91 Outline We introduce linear temporal logic (LTL), a logical formalism that is suited for specifying LT properties.
More informationCTL Model checking. 1. finite number of processes, each having a finite number of finite-valued variables. Model-Checking
CTL Model checking Assumptions:. finite number of processes, each having a finite number of finite-valued variables.. finite length of CTL formula Problem:Determine whether formula f 0 is true in a finite
More informationAlternating nonzero automata
Alternating nonzero automata Application to the satisfiability of CTL [,, P >0, P =1 ] Hugo Gimbert, joint work with Paulin Fournier LaBRI, Université de Bordeaux ANR Stoch-MC 06/07/2017 Control and verification
More informationAlternating-Time Temporal Logic
Alternating-Time Temporal Logic R.Alur, T.Henzinger, O.Kupferman Rafael H. Bordini School of Informatics PUCRS R.Bordini@pucrs.br Logic Club 5th of September, 2013 ATL All the material in this presentation
More informationVerification Using Temporal Logic
CMSC 630 February 25, 2015 1 Verification Using Temporal Logic Sources: E.M. Clarke, O. Grumberg and D. Peled. Model Checking. MIT Press, Cambridge, 2000. E.A. Emerson. Temporal and Modal Logic. Chapter
More informationFailure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications
Failure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications Shengbing Jiang and Ratnesh Kumar Abstract The paper studies failure diagnosis of discrete event systems with
More informationLecture 2 Automata Theory
Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray Outline: Transition systems Linear-time properties Regular propereties EECI, 14 May 2012 This short-course is on this picture applied
More informationDouble Header. Model Checking. Model Checking. Overarching Plan. Take-Home Message. Spoiler Space. Topic: (Generic) Model Checking
Double Header Model Checking #1 Two Lectures Model Checking SoftwareModel Checking SLAM and BLAST Flying Boxes It is traditional to describe this stuff (especially SLAM and BLAST) with high-gloss animation
More informationSyntax and Semantics of Propositional Linear Temporal Logic
Syntax and Semantics of Propositional Linear Temporal Logic 1 Defining Logics L, M, = L - the language of the logic M - a class of models = - satisfaction relation M M, ϕ L: M = ϕ is read as M satisfies
More informationLecture Notes on Model Checking
Lecture Notes on Model Checking 15-816: Modal Logic André Platzer Lecture 18 March 30, 2010 1 Introduction to This Lecture In this course, we have seen several modal logics and proof calculi to justify
More informationLecture 16: Computation Tree Logic (CTL)
Lecture 16: Computation Tree Logic (CTL) 1 Programme for the upcoming lectures Introducing CTL Basic Algorithms for CTL CTL and Fairness; computing strongly connected components Basic Decision Diagrams
More informationAutomata and Reactive Systems
Automata and Reactive Systems Lecture WS 2002/2003 Prof. Dr. W. Thomas RWTH Aachen Preliminary version (Last change March 20, 2003) Translated and revised by S. N. Cho and S. Wöhrle German version by M.
More informationModel Checking LTL with Regular Valuations for Pushdown Systems 1
Model Checking LTL with Regular Valuations for Pushdown Systems 1 Javier Esparza Division of Informatics University of Edinburgh Edinburgh EH9 3JZ United Kingdom E-mail: jav@dcs.ed.ac.uk and Antonín Kučera
More informationSynthesis of Designs from Property Specifications
Synthesis of Designs from Property Specifications Amir Pnueli New York University and Weizmann Institute of Sciences FMCAD 06 San Jose, November, 2006 Joint work with Nir Piterman, Yaniv Sa ar, Research
More informationChapter 6: Computation Tree Logic
Chapter 6: Computation Tree Logic Prof. Ali Movaghar Verification of Reactive Systems Outline We introduce Computation Tree Logic (CTL), a branching temporal logic for specifying system properties. A comparison
More informationModel Checking & Program Analysis
Model Checking & Program Analysis Markus Müller-Olm Dortmund University Overview Introduction Model Checking Flow Analysis Some Links between MC and FA Conclusion Apology for not giving proper credit to
More informationLecture 2 Automata Theory
Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray EECI, 18 March 2013 Outline Modeling (discrete) concurrent systems: transition systems, concurrency and interleaving Linear-time
More informationCDS 270 (Fall 09) - Lecture Notes for Assignment 8.
CDS 270 (Fall 09) - Lecture Notes for Assignment 8. ecause this part of the course has no slides or textbook, we will provide lecture supplements that include, hopefully, enough discussion to complete
More informationComputation Tree Logic
Chapter 6 Computation Tree Logic Pnueli [88] has introduced linear temporal logic to the computer science community for the specification and verification of reactive systems. In Chapter 3 we have treated
More informationLogic in Automatic Verification
Logic in Automatic Verification Javier Esparza Sofware Reliability and Security Group Institute for Formal Methods in Computer Science University of Stuttgart Many thanks to Abdelwaheb Ayari, David Basin,
More information