J.P. Queille and J. Sifakis. Speci cation and Veri cation of Concurrent Systems in CESAR. In International Symposium on Programming, volume 137 of LNCS. Springer-Verlag, 1982.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....The programmer could trust too much in his program making the veri cation less severe. 6.3 Model Checking The third formal veri cation technique that we consider is the model checking technique. Model checking was rst introduced by Clarke and Emerson [CE81, EC80] and by Quielle and Sifakis [QS82] independently. This technique has been studied deeply in the last two decades and has become a very important research line. The reader can nd a wide overview of model checking in [CGP99, BBF 01] Model checking was de ned as an automatic veri cation technique (see [CES86] The method is ....

J. P. Quielle and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In Proceedings of the 5th International Symposium on Programming, volume 137 of Lecture Notes in Computer Science, pages 337-350, Berlin, 1982. Springer-Verlag.

....such as predicate abstraction. We also show how one may generate easily checkable lifted proofs, which nd use in applications such as proof carrying code, and in the use of model checkers as decision procedures in theorem proving. 1 Introduction Model Checking, introduced in [CE81,QS82] has enabled routine automatic veri cation of programs, especially in hardware and, more recently, in software. A key component of the application of model checking is the use of abstraction methods, which reduce the problem of checking programs with large (possibly in nite) state spaces to ....

J.P. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In Proc. of the 5th International Symposium on Programming, volume 137 of LNCS, 1982.

....whose correctness is quite direct to establish, but whose behavior is always equal to the worst case upper bound. It then turns to the techniques that can be used to improve this algorithm in order to obtain the quite e ective algorithms that are now in use. 1 Introduction Model checking [CES86,QS81,VW86] is a widespread technique for verifying temporal properties of reactive programs. There are several ways to develop the theory of model checking, a particularly attractive one being through the construction of automata from temporal logic formulas [VW86,BVW94] As a result, there has been a fair ....

J.P. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in Cesar. In Proc. 5th Int'l Symp. on Programming, volume 137, pages 337-351. Springer-Verlag, Lecture Notes in Computer Science, 1981.

....realm of testing because testing itself doesn t require the prior knowledge of implementation. Moreover, it works directly on the implementation level rather than on its mathematical abstraction (formalization) which is inevitably demanded by automatic veri cation techniques like model checking [CE81,QS82,CES86] and equivalence preordering checking (cf. Mil89] Nevertheless, our approach of generating tests is derived from state of art model checking technique in the following senses: First, we will use temporal logic to encode the properties being tested; Second, a modi ed model checker will be ....

J. P. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.

.... of diagnostic information for explaining negative model checking results; and certifying the results of model checking (is the evidence internally consistent ) Keywords: model checking; diagnostic information; mu calculus; temporal logic 1 Introduction Temporal logic model checking [CE81,QS82,CES86] refers to an array of techniques for automatically determining whether or not a system satises a property expressed in some temporal logic. Traditionally, model checkers have been viewed as decision procedures that return yes no answers reecting the correctness of the system being analyzed. ....

J. P. Queille and J. Sifakis. Specication and verication of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.

....a transition relation. Although the method is incomplete, we present sucient conditions to ensure termination. We have implemented a prototype for our algorithm and show the result of its application on a number of examples. Appendix A Proofs of Lemmas 1 Introduction Model Checking [CES86, QS82] has become one of the most prominent techniques for algorithmic veri cation of reactive systems. An important challenge has recently been to extend the applicability of model checking to in nite state systems. One source of in niteness of state spaces is parameterization. In a parameterized ....

J.P. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in cesar. In 5th International Symposium on Programming, Turin, volume 137 of Lecture Notes in Computer Science, pages 337-352. Springer Verlag, 1982.

....case, i.e. deciding if the intersection of k nite automata accept any string or a given string, the best known algorithms decide the problem in exponential and linear time respectively. One of the ways introduced to aid designers in designing correct concurrent systems is model checking [8, 51]. Introduced roughly 20 years ago, model checking has already revolutionised the way hardware systems are designed, and can be considered industry practice today [23] The basic idea of model checking is simple. Both the system and the properties the system should have, are expressed as ....

J.P. Quielle and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In Proceedings of the 5th International Symposium on Programming, pages 337-350, 1981.

....aborts. The checker is written in the subset of applicative Common Lisp supported by the Boyer Moore theorem prover ACL2 [24] More details on the checker and on the correctness proof can be found in [3, 2] The crucial part (step 4) can be seen as a problem speci c tautology or model checking [7, 23]: Successful hardwarein the loop test according to the generated set T of measurements will guarantee a circuit dependent set of logical formulas expressing conduction or isolation of paths between terminal contacts to be true, and our checker program basically checks the particular formula p ....

J.P. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In Proceedings of the Fifth International Symposium in Programming, 1981.

....Jerusalem 91904, Israel. Email: orna cs.huji.ac.il z Address: Department of Computer Science, Houston, TX 77251 1892, U.S.A. Email: vardi cs.rice.edu. Supported in part by NSF grant CCR 9700061, NSF grant CCR 9988322, and by a grant from the Intel Corporation. 1 Introduction In model checking [CE81, QS81, LP85], we verify the correctness of a nite state system with respect to a desired behavior by checking whether a labeled state transition graph that models the system satis es a speci cation of this behavior, expressed in terms of a temporal logic formula or a nite automaton. Beyond being ....

J.P. Queille and J. Sifakis. Specication and verication of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, volume 137 of Lecture Notes in Computer Science, pages 337-351. Springer-Verlag, 1981.

....proposed as a computational basis for symbolic model checking, and proved to be an e ective alternative to BDD based techniques. In this paper we show how BDD based and SAT based techniques have been e ectively integrated within the NuSMV symbolic model checker. 1 Introduction Model checking [11, 20] is a formal technique for the veri cation of nite state systems. The system being analyzed is represented as a Finite State Machine (FSM) while the requirements to be satis ed are expressed in temporal logics, e.g. Computation Tree Logic (CTL) or Linear Temporal Logic (LTL) Model checking ....

J.P. Quielle and J. Sifakis. Specication and verication of concurrent systems in CESAR. In Proceedings of the Fifth International Symposium in Programming, 1981.

....Preliminary experiments indicate that the local model checker is at least as ecient as existing model checkers for push down systems. 1 Introduction Model checking is a widely used technique for verifying whether a system speci cation possesses a property expressed as a temporal logic formula [7, 8, 14]. Most early works on model checking have restricted system speci cations to be nite state. A number of recent works have addressed the problem of model checking push down processes with nite alphabets, which are natural models for recursive programs operating on nite data structures (e.g. 12, ....

J. P. Queille and J. Sifakis. Specication and verication of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.

....checked. The results indicate that the procedure can cope well with many fairness constraints, which could not have been handled by specifying the constraints as a part of the property to be veried. Keywords: Model checking, fairness, LTL, high level Petri Nets. 1 Introduction Model checking [2, 23] has established itself as one of the most useful methods for reasoning about the temporal behavior of Petri Nets. Currently there are several Petri Net tools which ooeer model checking of either linear or branching time properties of Petri Nets (see e.g. 29, 37] Model checking liveness ....

J.P. Quielle and J. Sifakis. Specication and verication of concurrent systems in CESAR. In Proceedings of the 5th International Symposium on Programming, pages 337350, 1981.

....enables the checking of much larger designs. We formally prove the correctness of the parallel algorithm. We complement the distribution of the state sets by showing how to distribute the transition relation. 1 Introduction In the early 1980 s, model checking procedures have been suggested [5, 15, 12], which could handle systems with few thousands states. In the early 1990 s, symbolic model checking methods have been introduced. These methods, based on Binary Decision Diagrams (BDDs) 2] could verify systems with 10 20 states and more [4] This progress has made model checking applicable to ....

J.P. Quielle and J. Sifakis. Specication and verication of concurrent systems in CESAR. In Proceedings of the Fifth International Symposium in Programming, 1981.

....Nina Amla 1 , E. Allen Emerson 1 , Robert P. Kurshan 2 , and Kedar Namjoshi 2 1 Department of Computer Sciences, University of Texas at Austin fnamla,emersong cs.utexas.edu 2 Bell Laboratories, Lucent Technologies fk,kedarg research.bell labs.com 1 Introduction Model checking [6, 13] is an automated procedure for determining whether a nite state program satis es a temporal property. Model checking tools, due to the complex nature of the speci cation methods, are used most e ectively by veri cation experts. In order to make these tools more accessible to nonexpert users, who ....

J.P. Queille and J. Sifakis. Specication and Verication of Concurrent Systems in CESAR. In Proc. of the 5th International Symposium on Programming, volume 137 of LNCS, 1982.

....nonetheless amenable to a number of general purpose abstraction techniques whose application can signi cantly reduce the size of the protocol s state space. Key words: explicit state model checking livelock protocol veri cation sliding window protocol 1 Introduction Model checking [EC81,QS82,VW86,CES86] is a veri cation technique based on exhaustive state space analysis, aimed at determining whether a system speci cation possesses a property expressed as a temporal logic formula. Model checking has enjoyed considerable success in verifying, or nding design errors in, real life ....

J. P. Queille and J. Sifakis. Specication and veri cation of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.

No context found.

J.P. Queille and J. Sifakis. Speci cation and Veri cation of Concurrent Systems in CESAR. In International Symposium on Programming, volume 137 of LNCS. Springer-Verlag, 1982.

No context found.

J. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In Proc. International symposium in Programming, LNCS 137, pages 337-351. Springer-Verlag, 1982.

No context found.

J.-P. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In Proc. Int. Symp. on Programming, volume 137 of Lect. Notes in Comp. Sci., pages 337-351. Springer, 1982.

No context found.

J. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In M. Dezani-Ciancaglini and U. Montanari, editors, Proc. 5th International Symposium on Programming, volume 137 of LNCS, pages 337{ 351. Springer, 1982.

No context found.

J.P. Quielle and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In proceedings of Fifth Intern. Symposium on Programming, pages 337-350, 1981.

No context found.

J.P. Queille and J. Sifakis. Specication and veri cation of concurrent systems in CESAR. In 5th International Symposium on Programming, volume 137 of LNCS, pages 337--351. SpringerVerlag, 1982.

No context found.

J. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In Proc. International symposium in Programming, LNCS 137, pages 337-351. Springer-Verlag, 1982.

No context found.

J-P. Queille and J. Sifakis. Speci cation and veri cation of concurrent systems is cesar. In International Symposium on Programming, LNCS 137, pages 337 - 351. Springer Verlag, 1982.

No context found.

J. P. Quielle and J. Sifakis. Speci cation and veri cation of concurrent systems in CESAR. In Proceedings of the Fifth Annual Symposium on Programming, 1981.

No context found.

J.P. Quielle and J. Sifakis. Specication and verication of concurrent systems in CESAR. In 5th International Symposium on Programming, volume 137 of LNCS. Springer-Verlag, April 1982.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC