DOCSLIB.ORG

Real-Time Model Checking Is Really Simple

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Real-Time Model Checking Is Really Simple Real-Time Model Checking is Really Simple Leslie Lamport Microsoft Research 13 June 2005 To be presented at Charme 2005, to be held 3-6 October 2005, in SaarbrÄucken, Germany. This version is formatted di®erently, with di®erent line and page breaks, from the version to appear in the Charme proceedings. Contents 1 Introduction 1 Introduction 1 2 Writing Explicit-Time Speci¯cations 2 3 Model Checking Explicit-Time Speci¯cations 4 3.1 Speci¯cations and Temporal Properties . 4 3.2 Symmetry . 5 3.3 Model Checking . 5 3.4 View Symmetry . 7 3.5 Symmetry Under Time Translation . 7 3.6 Periodicity and Zeno Behaviors . 8 4 Comparison with Uppaal 10 4.1 The Leader Algorithm . 10 4.2 Fischer's Algorithm . 14 5 Conclusion 15 References 16 Real-Time Model Checking is Really Simple Leslie Lamport Microsoft Research 13 June 2005 Abstract It is easy to write and verify real-time speci¯cations with existing languages and methods; one just represents time as an ordinary vari- able and expresses timing requirements with special timer variables. The resulting speci¯cations can be veri¯ed with an ordinary model checker. This basic idea and some less obvious details are explained, and results are presented for two examples. 1 Introduction Numerous special languages and logics have been proposed for specifying and verifying real-time algorithms. There is an alternative that I call the explicit-time approach, in which the current time is represented as the value of a variable now and the passage of time is modeled by a Tick action that increments now. Timing constraints are expressed with timer variables. Hardly anything has been written about the explicit-time approach, per- haps because it is so simple and obvious. As a result, most people seem to believe that they must use special real-time languages and logics. It has already been shown that an explicit-time approach works ¯ne for specifying and proving properties of real-time algorithms [1]. Here, I consider model checking explicit-time speci¯cations. The major advantage of the explicit-time approach is that it can be used with any language and logic for describing concurrent algorithms. This is especially important for complex algorithms that can be quite di±cult to represent in the lower-level, inexpressive languages typical of real-time model checkers. For example, distributed message-passing algorithms have queues or sets of messages in transit, each with a bound on its delivery time. Such algorithms are di±cult or impossible to handle with most real-time model checkers. Section 2 briefly explains the explicit-time approach with a simple distributed algorithm. A complete speci¯cation of the algorithm in TLA+ [8], a high-level mathematics-based language, appears in [9]. Explicit-time descriptions can use either continuous or discrete time. Section 3 shows that when discrete time is used, these descriptions can be checked with ordinary model checkers. This simple fact has been known for quite a while and is implicit in several published results [5]. However, a direct statement of it does not seem to have appeared before in print. Moreover, there are some aspects of model checking explicit-time speci¯cations that may not be obvious, including the use of view symmetry and a method for checking that a speci¯cation is nonZeno [1]. Section 4 describes the result of checking the algorithm described in Section 2 with TLC, a model checker for TLA+ speci¯cations, and with Uppaal [10], the only real-time model checker I know of that can handle this example. It also compares TLC, Spin [6], and SMV [11] with Uppaal on the Fischer mutual exclusion algorithm [13]. More details appear in [9]. 2 Writing Explicit-Time Speci¯cations In an explicit-time speci¯cation, time is represented with a variable now that is incremented by a Tick action. For a continuous-time speci¯cation, Tick might increment now by any real number; for a discrete-time speci¯cation, it increments now by 1. Timing bounds on actions are speci¯ed with one of three kinds of timer variables: a countdown timer is decremented by the Tick action, a count-up timer is incremented by Tick, and an expiration timer is left unchanged by Tick.1 A countdown or count-up timer expires when its value reaches some value; an expiration timer expires when its value minus now reaches some value. An upper-bound timing constraint on when an action A must occur is expressed by an enabling condition on the Tick action that prevents an increase in time from violating the constraint; a lower-bound constraint on when A may occur is expressed by an enabling condition on A that prevents it from being executed earlier than it should be. I illustrate how one writes explicit-time speci¯cations using the example of a simple version of a classic distributed algorithm of Radia Perlman [12]. The original algorithm constructs a spanning tree rooted at the lowest- numbered node, called the leader. The tree is maintained by having the 1Dutertre and Sorea [3] use a di®erent kind of timer variable that predicts the time at which an action will occur. 2 Tick =¢ 9 d 2 fr 2 Real : r > 0g : ^ 8 n 2 Node : timer[n] + TODelay ¸ d ^ 8 ms 2 BagToSet(msgs): ms:rcvTimer ¸ d ^ now 0 = now + d ^ timer 0 = [n 2 Node 7! timer[n] ¡ d] ^ msgs0 = let Updated(ms) =¢ [ms except !:rcvTimer = ms:rcvTimer ¡ d] in BagOfAll(Updated; msgs) ^ unchanged hldr; disti Figure 1: The Tick action's de¯nition for the leader algorithm. leader periodically propagate an I'm Leader message down it that informs each node of its distance to the leader. A new tree is constructed if a failure causes some node to time out before receiving the I'm Leader message. I have simpli¯ed it by eliminating failures, so correctness means simply that every node learns the leader within some ¯xed length of time. A complete TLA+ speci¯cation of the algorithm appears in [9]. Here, I describe only the TLA+ speci¯cation of the Tick action. The algorithm has three timing parameters, Period, MsgDelay, and TODelay. Each node n has a countdown timer timer[n]. Setting timer[n] to ¿ causes a timeout to occur between ¿ and ¿ +TODelay seconds later. By letting ¿ be the minimum timeout interval, this models both delay in react- ing to a timeout and variation in the running rate of physical timers. When its timeout occurs, node n sends an I'm Leader message and sets timer[n] to Period. If n receives an I'm Leader message from a lower-numbered node, it resets timer[n] to a suitable value. A message is assumed to be re- ceived at most MsgDelay seconds after it is sent, a constraint enforced with a rcvTimer countdown timer ¯eld in the message. The algorithm achieves stability if, upon receiving a message from its leader, a node n sets timer[n] to a value no smaller than Period + TODelay + dist[n] ¤ MsgDelay, where dist[n] is the distance from n to the leader. Figure 1 contains the de¯nition of the Tick action from the TLA+ spec- i¯cation. It can't be completely understood without seeing the rest of the speci¯cation and having some knowledge of TLA+ (including the de¯nitions of the operators BagToSet and BagOfAll from the standard Bags module). However, it will indicate how timing constraints are speci¯ed and also give an idea of the high-level nature of TLA+. This version is for a continuous-time speci¯cation, in which now is incremented by some real value d. We obtain 3 a discrete-time speci¯cation by replacing \ 9d 2 fr 2 Real : r > 0g :" with \ let d =¢ 1 in ". The action's ¯rst two conjuncts enforce the upper-bound constraints. The ¯rst prevents timer[n] from becoming less than ¡TODelay, for each node n. The second prevents the timer ms:rcvTimer from becoming nega- tive, for all messages ms in the bag (multiset) msg of messages in transit. The action's remaining conjuncts assert how the variables are changed. The third conjunct asserts that now is incremented by d. The fourth and ¯fth conjuncts assert that all the timers are decremented by d, the fourth for each timer[n] and the ¯fth for the timer component ms:rcvTimer of each message ms. The ¯nal conjunct asserts that the speci¯cation's other variables are unchanged. The complete speci¯cation asserts the additional timing constraint that a timeout action of node n cannot occur before timer[n] has counted down past 0. This constraint is expressed by the conjunct timer[n] < 0 in that action's de¯nition. 3 Model Checking Explicit-Time Speci¯cations Most real-time system speci¯cations are symmetric under time translation, meaning that system actions depend only on the passage of time, not on ab- solute time values. This section explains what symmetry and model check- ing under symmetry mean and describes a simple method of model checking explicit-time speci¯cations that are symmetric under time translation. 3.1 Speci¯cations and Temporal Properties Let a state of a speci¯cation be an assignment of values to all the speci¯- cation's variables, and let its state space be the set of all such states. A state predicate is a predicate (Boolean function) on states, and an action is a predicate on pairs of states. The formula s ¡!A t asserts that action A is true on the pair s, t of states.
Load more

Recommended publications
  • Model Checking
    Lecture 1: Model Checking Edmund Clarke School of Computer Science Carnegie Mellon University 1 Cost of Software Errors June 2002 “Software bugs, or errors, are so prevalent and so detrimental that they cost the U.S. economy an estimated $59.5 billion annually, or about 0.6 percent of the gross domestic product … At the national level, over half of the costs are borne by software users and the remainder by software developers/vendors.” NIST Planning Report 02-3 The Economic Impacts of Inadequate Infrastructure for Software Testing 2 Cost of Software Errors “The study also found that, although all errors cannot be removed, more than a third of these costs, or an estimated $22.2 billion, could be eliminated by an improved testing infrastructure that enables earlier and more effective identification and removal of software defects.” 3 Model Checking • Developed independently by Clarke and Emerson and by Queille and Sifakis in early 1980’s. • Properties are written in propositional temporal logic. • Systems are modeled by finite state machines. • Verification procedure is an exhaustive search of the state space of the design. • Model checking complements testing/simulation. 4 Advantages of Model Checking • No proofs!!! • Fast (compared to other rigorous methods) • Diagnostic counterexamples • No problem with partial specifications / properties • Logics can easily express many concurrency properties 5 Model of computation Microwave Oven Example State-transition graph describes system evolving ~ Start ~ Close over time. ~ Heat st ~ Error Start ~ Start ~ Start ~ Close Close Close ~ Heat Heat ~ Heat Error ~ Error ~ Error Start Start Start Close Close Close ~ Heat ~ Heat Heat Error ~ Error ~ Error 6 Temporal Logic l The oven doesn’t heat up until the door is closed.
    [Show full text]
  • Model Checking TLA Specifications
    Model Checking TLA+ Specifications Yuan Yu1, Panagiotis Manolios2, and Leslie Lamport1 1 Compaq Systems Research Center {yuanyu,lamport}@pa.dec.com 2 Department of Computer Sciences, University of Texas at Austin [email protected] Abstract. TLA+ is a specification language for concurrent and reac- tive systems that combines the temporal logic TLA with full first-order logic and ZF set theory. TLC is a new model checker for debugging a TLA+ specification by checking invariance properties of a finite-state model of the specification. It accepts a subclass of TLA+ specifications that should include most descriptions of real system designs. It has been used by engineers to find errors in the cache coherence protocol for a new Compaq multiprocessor. We describe TLA+ specifications and their TLC models, how TLC works, and our experience using it. 1 Introduction Model checkers are usually judged by the size of system they can handle and the class of properties they can check [3,16,4]. The system is generally described in either a hardware-description language or a language tailored to the needs of the model checker. The criteria that inspired the model checker TLC are completely different. TLC checks specifications written in TLA+, a rich language with a well-defined semantics that was designed for expressiveness and ease of formal reasoning, not model checking. Two main goals led us to this approach: – The systems that interest us are too large and complicated to be completely verified by model checking; they may contain errors that can be found only by formal reasoning. We want to apply a model checker to finite-state models of the high-level design, both to catch simple design errors and to help us write a proof.
    [Show full text]
  • Introduction to Model Checking and Temporal Logic¹
    Formal Verification Lecture 1: Introduction to Model Checking and Temporal Logic¹ Jacques Fleuriot [email protected] ¹Acknowledgement: Adapted from original material by Paul Jackson, including some additions by Bob Atkey. I Describe formally a specification that we desire the model to satisfy I Check the model satisfies the specification I theorem proving (usually interactive but not necessarily) I Model checking Formal Verification (in a nutshell) I Create a formal model of some system of interest I Hardware I Communication protocol I Software, esp. concurrent software I Check the model satisfies the specification I theorem proving (usually interactive but not necessarily) I Model checking Formal Verification (in a nutshell) I Create a formal model of some system of interest I Hardware I Communication protocol I Software, esp. concurrent software I Describe formally a specification that we desire the model to satisfy Formal Verification (in a nutshell) I Create a formal model of some system of interest I Hardware I Communication protocol I Software, esp. concurrent software I Describe formally a specification that we desire the model to satisfy I Check the model satisfies the specification I theorem proving (usually interactive but not necessarily) I Model checking Introduction to Model Checking I Specifications as Formulas, Programs as Models I Programs are abstracted as Finite State Machines I Formulas are in Temporal Logic 1. For a fixed ϕ, is M j= ϕ true for all M? I Validity of ϕ I This can be done via proof in a theorem prover e.g. Isabelle. 2. For a fixed ϕ, is M j= ϕ true for some M? I Satisfiability 3.
    [Show full text]
  • Model Checking and the Curse of Dimensionality
    Model Checking and the Curse of Dimensionality Edmund M. Clarke School of Computer Science Carnegie Mellon University Turing's Quote on Program Verification . “How can one check a routine in the sense of making sure that it is right?” . “The programmer should make a number of definite assertions which can be checked individually, and from which the correctness of the whole program easily follows.” Quote by A. M. Turing on 24 June 1949 at the inaugural conference of the EDSAC computer at the Mathematical Laboratory, Cambridge. 3 Temporal Logic Model Checking . Model checking is an automatic verification technique for finite state concurrent systems. Developed independently by Clarke and Emerson and by Queille and Sifakis in early 1980’s. The assertions written as formulas in propositional temporal logic. (Pnueli 77) . Verification procedure is algorithmic rather than deductive in nature. 4 Main Disadvantage Curse of Dimensionality: “In view of all that we have said in the foregoing sections, the many obstacles we appear to have surmounted, what casts the pall over our victory celebration? It is the curse of dimensionality, a malediction that has plagued the scientist from the earliest days.” Richard E. Bellman. Adaptive Control Processes: A Guided Tour. Princeton University Press, 1961. Image courtesy Time Inc. 6 Photographer Alfred Eisenstaedt. Main Disadvantage (Cont.) Curse of Dimensionality: 0,0 0,1 1,0 1,1 2-bit counter n-bit counter has 2n states 7 Main Disadvantage (Cont.) 1 a 2 | b n states, m processes | 3 c 1,a nm states 2,a 1,b 3,a 2,b 1,c 3,b 2,c 3,c 8 Main Disadvantage (Cont.) Curse of Dimensionality: The number of states in a system grows exponentially with its dimensionality (i.e.
    [Show full text]
  • Formal Verification, Model Checking
    Introduction Modeling Specification Algorithms Conclusions Formal Verification, Model Checking Radek Pel´anek Introduction Modeling Specification Algorithms Conclusions Motivation Formal Methods: Motivation examples of what can go wrong { first lecture non-intuitiveness of concurrency (particularly with shared resources) mutual exclusion adding puzzle Introduction Modeling Specification Algorithms Conclusions Motivation Formal Methods Formal Methods `Formal Methods' refers to mathematically rigorous techniques and tools for specification design verification of software and hardware systems. Introduction Modeling Specification Algorithms Conclusions Motivation Formal Verification Formal Verification Formal verification is the act of proving or disproving the correctness of a system with respect to a certain formal specification or property. Introduction Modeling Specification Algorithms Conclusions Motivation Formal Verification vs Testing formal verification testing finding bugs medium good proving correctness good - cost high small Introduction Modeling Specification Algorithms Conclusions Motivation Types of Bugs likely rare harmless testing not important catastrophic testing, FVFV Introduction Modeling Specification Algorithms Conclusions Motivation Formal Verification Techniques manual human tries to produce a proof of correctness semi-automatic theorem proving automatic algorithm takes a model (program) and a property; decides whether the model satisfies the property We focus on automatic techniques. Introduction Modeling Specification Algorithms Conclusions
    [Show full text]
  • Formal Verification of Diagnosability Via Symbolic Model Checking
    Formal Verification of Diagnosability via Symbolic Model Checking Alessandro Cimatti Charles Pecheur Roberto Cavada ITC-irst RIACS/NASA Ames Research Center ITC-irst Povo, Trento, Italy Moffett Field, CA, U.S.A. Povo, Trento, Italy mailto:[email protected] [email protected] [email protected] Abstract observed system. We propose a new, practical approach to the verification of diagnosability, making the following contribu• This paper addresses the formal verification of di• tions. First, we provide a formal characterization of diagnos• agnosis systems. We tackle the problem of diagnos• ability problem, using the idea of context, that explicitly takes ability: given a partially observable dynamic sys• into account the run-time conditions under which it should be tem, and a diagnosis system observing its evolution possible to acquire certain information. over time, we discuss how to verify (at design time) Second, we show that a diagnosability condition for a given if the diagnosis system will be able to infer (at run• plant is violated if and only if a critical pair can be found. A time) the required information on the hidden part of critical pair is a pair of executions that are indistinguishable the dynamic state. We tackle the problem by look• (i.e. share the same inputs and outputs), but hide conditions ing for pairs of scenarios that are observationally that should be distinguished (for instance, to prevent simple indistinguishable, but lead to situations that are re• failures to stay undetected and degenerate into catastrophic quired to be distinguished. We reduce the problem events). We define the coupled twin model of the plant, and to a model checking problem.
    [Show full text]
  • ACM 2007 Turing Award Edmund Clarke, Allen Emerson, and Joseph Sifakis Model Checking: Algorithmic Verification and Debugging
    ACM 2007 Turing Award Edmund Clarke, Allen Emerson, and Joseph Sifakis Model Checking: Algorithmic Verification and Debugging ACM Turing Award Citation precisely describe what constitutes correct behavior. This In 1981, Edmund M. Clarke and E. Allen Emerson, work- makes it possible to contemplate mathematically establish- ing in the USA, and Joseph Sifakis working independently ing that the program behavior conforms to the correctness in France, authored seminal papers that founded what has specification. In most early work, this entailed constructing become the highly successful field of Model Checking. This a formal proof of correctness. In contradistinction, Model verification technology provides an algorithmic means of de- Checking avoids proofs. termining whether an abstract model|representing, for ex- ample, a hardware or software design|satisfies a formal Hoare-style verification was the prevailing mode of formal specification expressed as a temporal logic formula. More- verification going back from the late-1960s until the 1980s. over, if the property does not hold, the method identifies This classic and elegant approach entailed manual proof con- a counterexample execution that shows the source of the struction, using axioms and inference rules in a formal de- problem. ductive system, oriented toward sequential programs. Such proof construction was tedious, difficult, and required hu- The progression of Model Checking to the point where it man ingenuity. This field was a great academic success, can be successfully used for complex systems has required spawning work on compositional or modular proof systems, the development of sophisticated means of coping with what soundness of program proof systems, and their completeness; is known as the state explosion problem.
    [Show full text]
  • Introduction to Model-Checking Theory and Practice
    Introduction to Model-Checking Theory and Practice Beihang International Summer School 2018 Model Checking Linear Temporal Properties Model Checking “Model checking is the method by which a desired behavioral property of a reactive system is verified over a given system (the model) through exhaustive enumeration (explicit or implicit ) of all the states reachable by the system and the behaviors that traverse through them” Amir Pnueli (2000) Basic Properties • reachability (something is possible) • invariant (something is always true) the gate is closed when the train cross the road • safety (something bad never happen: ≡ ¬ 푅푒푎푐ℎ) • liveness (something good may eventually happen) every process will (eventually) gain access to the printer • Fairness (if it may happen ∞ often then it will happen) if messages cannot be lost ∞ often then I will received an ack Model-Checking • We have seen how to use a formal specification language to model the system (⇒ as a graph, but also as a language ℒ) • We have seen how to check basic properties on the reachability graph (and that SCC can be useful) • What if we want to check more general properties? User-Defined Properties • present before (we should see an 푎 before the first 푏) the latch must be locked before take-off • infinitely often (something will always happen, ≠ 퐴푙푤푎푦푠) the timer should always be triggered • leadsto (after every occurrence of 푎 there should be a 푏) there is an audible signal after the alarm is activated • … see example of specification patterns here [Dwyer] Model-Checking System + Requirements informal Description Description M of the of the 휙 behavior property operational denotational formalization verification Does 푀 ⊨ 휙 Does 푀 ≡ 퐺휙 yes / no / c.
    [Show full text]
  • Model Checking Software in Cyberphysical Systems
    Model Checking Software in Cyberphysical Systems Marjan Sirjani Ehsan Khamespanah Edward A. Lee School of IDT ECE Department Department of EECS Mälardalen University University of Tehran UC Berkeley Västerås, Sweden Tehran, Iran Berkeley, USA [email protected] [email protected] [email protected] Abstract—Model checking a software system is about verifying where software reads sensor data and issues commands to that the state trajectory of every execution of the software satisfies physical actuators, ignoring this relationship is more dangerous. formally specified properties. The set of possible executions is For CPS, verification is ultimately about assuring properties modeled as a transition system. Each “state” in the transition system represents an assignment of values to variables, and a state of the physical world not the software abstraction. This means trajectory (a path through the transition system) is a sequence that it is not sufficient to study the software alone. We need of such assignments. For cyberphysical systems (CPSs), however, to also study its interactions with its environment. we are more interested in the state of the physical system than Of course, there is nothing new about formally studying the values of the software variables. The value of model checking the interactions of software with its environment. In 1977, for the software therefore depends on the relationship between the state of the software and the state of the physical system. This example, Pnueli was developing temporal logics for reactive relationship can be complex because of the real-time nature of systems [1]. In 1985, Harel and Pnueli singled out reactive the physical plant, the sensors and actuators, and the software systems as being “particularly problematic when it comes to that is almost always concurrent and distributed.
    [Show full text]
  • Model Checking TLA+ Specifications
    Model Checking TLA+ Specifications Yuan Yu, Panagiotis Manolios, and Leslie Lamport 25 June 1999 Appeared in Correct Hardware Design and Verifica- tion Methods (CHARME ’99), Laurence Pierre and Thomas Kropf editors. Lecture Notes in Computer Sci- ence, number 1703, Springer-Verlag, (September 1999) 54–66. Table of Contents 1 Introduction 54 2TLA+ 57 3CheckingModelsofaTLA+ Specification 58 4 How TLC Works 60 5 Representing States 62 6 Using Disk 63 7 Experimental Results 64 8 Status and Future Work 64 Model Checking TLA+ Specifications Yuan Yu1, Panagiotis Manolios2, and Leslie Lamport1 1 Compaq Systems Research Center [email protected], [email protected] 2 Department of Computer Sciences, University of Texas at Austin [email protected] Abstract. TLA+ is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full first-order logic and ZF set theory. TLC is a new model checker for debugging a TLA+ specification by checking invariance properties of a finite-state model of the specification. It accepts a subclass of TLA+ specifications that should include most descriptions of real system designs. It has been used by engineers to find errors in the cache coherence protocol for a new Compaq multiprocessor. We describe TLA+ specifications and their TLC models, how TLC works, and our experience using it. 1 Introduction Model checkers are usually judged by the size of system they can handle and the class of properties they can check [3, 16, 4]. The system is generally described in either a hardware-description language or a language tailored to the needs of the model checker.
    [Show full text]
  • Model Checking with Mbeddr
    Model Checking for State Machines with mbeddr and NuSMV 1 Abstract State machines are a powerful tool for modelling software. Particularly in the field of embedded software development where parts of a system can be abstracted as state machine. Temporal logic languages can be used to formulate desired behaviour of a state machine. NuSMV allows to automatically proof whether a state machine complies with properties given as temporal logic formulas. mbedder is an integrated development environment for the C programming language. It enhances C with a special syntax for state machines. Furthermore, it can automatically translate the code into the input language for NuSMV. Thus, it is possible to make use of state-of-the-art mathematical proofing technologies without the need of error prone and time consuming manual translation. This paper gives an introduction to the subject of model checking state machines and how it can be done with mbeddr. It starts with an explanation of temporal logic languages. Afterwards, some features of mbeddr regarding state machines and their verification are discussed, followed by a short description of how NuSMV works. Author: Christoph Rosenberger Supervising Tutor: Peter Sommerlad Lecture: Seminar Program Analysis and Transformation Term: Spring 2013 School: HSR, Hochschule für Technik Rapperswil Model Checking with mbeddr 2 Introduction Model checking In the words of Cavada et al.: „The main purpose of a model checker is to verify that a model satisfies a set of desired properties specified by the user.” [1] mbeddr As Ratiu et al. state in their paper “Language Engineering as an Enabler for Incrementally Defined Formal Analyses” [2], the semantic gap between general purpose programming languages and input languages for formal verification tools is too big.
    [Show full text]
  • Model Checking Accomplishments and Opportunities
    Model Checking Accomplishments and Opportunities Rajeev Alur Systems Design Research Lab University of Pennsylvania www.cis.upenn.edu/~alur/ Debugging Tools q Program Analysis Type systems, pointer analysis, data-flow analysis q Simulation Effective in discovering bugs in early stages q Testing Expensive! q Formal Verification Mathematical proofs, Not yet practical Quest for Better Debugging q Bugs are expensive! Pentium floating point bug, Arian-V disaster q Testing is expensive! More time than design and implementation q Safety critical applications Certification mandated model yes temporal Model Checker property error-trace Advantages Automated formal verification, Effective debugging tool Moderate industrial success In-house groups: Intel, Microsoft, Lucent, Motorola… Commercial model checkers: FormalCheck by Cadence Obstacles Scalability is still a problem (about 100 state vars) Effective use requires great expertise Cache consistency: Gigamax Real design of a distributed multiprocessor Global bus UIC UIC UIC Cluster bus M P M P Read-shared/read-owned/write-invalid/write-shared/… Deadlock found using SMV Similar successes: IEEE Futurebus+ standard, network RFCs Talk Outline ü Introduction Ü Foundations q MOCHA q Current Trends and Future Components of a Model Checker q Modeling language Concurrency, non-determinism, simple data types q Requirements language Invariants, deadlocks, temporal logics q Search algorithms Enumerative vs symbolic + many optimizations q Debugging feedback Reachability Problem Model variables X ={x1, … xn} Each var is of finite type, say, boolean Initialization: I(X) condition over X Update: T(X,X’) How new vars X’ are related to old vars X as a result of executing one step of the program Target set: F(X) Computational problem: Can F be satisfied starting with I by repeatedly applying T ? Graph Search problem Symbolic Solution Data type: region to represent state-sets R:=I(X) Repeat If R intersects T report “yes” Else if R contains Post(R) report “no” Else R := R union Post(R) Post(R(X))= (Exists X.
    [Show full text]