L. Fribourg. Constraint logic programming applied to model checking. In Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817, Venice, 1999. Springer Verlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....then be used to verify the original property on the resulting Petri Net like model [10, 14, 15, 19] New results have also been obtained for the veri cation of another class of in nite state systems, i.e. concurrent systems with a xed number of components but unbounded data. As an example, in [8, 12, 18], constraints are used to symbolically represent and manipulate in nite collections of states for these systems. In this paper we address the de nition of techniques for the automatic veri cation of systems and protocols parametric in several dimensions. As an example, we mention mutual ....

....automatically verify a restricted version of the parameterized bakery algorithm in which a special reducing process is needed to force the value of the tickets to stay within a given range. Our ideas are related to previous works connecting Constraint Logic Programming and veri cation, see e.g. [12, 18]. In this setting transition systems are encoded via CLP programs used to encode the global state of a system and its updates. We re ne this idea by using multiset rewriting and constraints to locally specify updates to the global state. The notion of constrained multiset extends that of ....

L. Fribourg. Constraint Logic Programming Applied to Model Checking. In Proc. LOPSTR'99, LNCS 1817, pp. 30-41, 1999.

....where the number of processes is a parameter which does not change over time. Our method is also related to a number of other methods which use logic programming and, more generally, constraint logic programming for the veri cation of reactive systems (see, for instance, 7,10,17,21] and [9] for a survey) The main novelty of our approach w.r.t. these methods is that it combines logic programming and monadic second order logic, thereby modelling in a very direct way systems with an unbounded (and variable) number of processes. Our unfold fold synthesis method and our unfold fold ....

L. Fribourg. Constraint logic programming applied to model checking. In A. Bossi, editor, Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), Venezia, Italy, Sept. 1999, Lecture Notes in Computer Science 1817, pages 3142. Springer, 2000.

....resemble a denotational program semantics, it turns out that (Constraint) Logic Programming (CLP) 13] is a natural approach to model checking both reactive and transformational embedded system models expressed in DTPN. Therefore, the combination of model checking techniques with CLP programs [14, 15] is a promising idea to extend model checking capabilities into infinite state systems [16] Abstraction is a key issue in infinite model checking. When reasoning about finite labelled transition systems (LTS) which have an infinite number of states, some abstraction techniques, such as program ....

Laurent Fribourg. Constraint logic programming applied to model checking. In Proceedings of the 9 International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), volume 1817, pages 31--42, Venezia, Italy, September 1999. Springer-Verlag.

....infinite state applications. Following [KMM 97] this goal can be achieved by employing rich assertional languages to reason about potentially infinite collections of system states. This idea finds a natural counterpart in the paradigm of constraint based model checking, see e.g. BGP99,DP99,Fri00] In this setting, the solutions of existentially quantified constraint formulas are used as denotations of an infinite collection of system states. Algorithmic verification procedures for temporal formulas are then defined on top of existing constraint solvers such as a Presburger arithmetic ....

L. Fribourg. Constraint Logic Programming Applied to Model Checking. In Proc. LOPSTR '99, LNCS 1817, pp. 30--41, 1999.

....nite state to the in nite state world. Following [KMM 97] this goal can be achieved by employing rich assertional languages to reason about potentially in nite collections of system states. This idea nds a natural counterpart in the paradigm of constraint based model checking [ACJT96,BGP97,Fri00,HHW97,DP99] In this setting, the solutions of existentially quanti ed constraint formulas are used as denotations of in nite collection of system states. Then, algorithmic veri cation procedures for temporal formulas are de ned on top of existing constraint solvers such as the Presburger ....

L. Fribourg. Constraint Logic Programming Applied to Model Checking. In Proc. LOPSTR '99, LNCS 1817, pp. 30-41, 1999.

....then be used to verify the original property on the resulting Petri Net like model [21, 17, 18, 12, 7] New results have also been obtained for the veri cation of another class of in nite state systems, i.e. concurrent systems with a xed number of components but unbounded data. As an example, in [10, 12, 14, 20], constraints are used to symbolically represent and manipulate in nite collections of states for these systems. In this paper we address the following question. Which are the techniques one can apply to automatically verify systems and protocols parametric in several dimensions As a practical ....

....[10] real arithmetic constraint solvers [14] We are not aware of methods that can automatically handle however the parameterized models of the ticket al..gorithm presented in Section 4. Our ideas are related to previous works connecting Constraint Logic Programming and veri cation, see e.g. [14, 20]. In this setting transition systems are encoded via CLP programs used to encode the global state of a system and its updates. In our approach, we re ne this idea by using multiset rewriting and constraints to locally specify updates to the global state. The notion of constrained multiset extends ....

L. Fribourg. Constraint Logic Programming Applied to Model Checking. In Proc. LOPSTR '99, LNCS 1817, pages 30-41, 1999.

....the generation of test cases as well as a restriction to boolean data types. Code generation on the grounds of CLP is, for various non modular [25] automata considered in [17, 13] The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in [9, 12, 8]. Our approach as a mixture between enumerative (explicit) and symbolic approaches to (bounded) model checking. Its symbolic nature is characterized by the fact that constraints allow for storing possibly in nite sets of states or inputs. Its explicit nature stems from the search algorithms ....

....The di erence between the presented approach to test case generation and (possibly bounded, non symbolic, on the y) model checking becomes apparent in the handling of in nite systems. The relationship between (C)LP and model checking of (in nite) systems has been the subject of recent work [9, 12, 8, 6]. While the intention between testing and model checking is di erent in terms of intended completeness of the result, we see one major advantage of our approach in the higher exibility in generating counter examples. The use of constraint languages is also crucial in the intended interactivity ....

L. Fribourg. Constraint logic programming applied to model checking. In Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817, Venice, 1999. Springer Verlag.

....the generation of test cases as well as a restriction to boolean data types. Code generation on the grounds of CLP is, for various non modular [25] automata considered in [17, 14] The relationship of Model Checking and (C)LP with possibly tabled resolution procedures is discussed (and used) in [10, 13, 9]. Bounded Model Checking with propositional solvers for test case generation is considered in [33] Test case generation on the grounds of mutation analysis is, among others, treated in [2] In the context of mutation testing, constraints for the generation of test cases for transformational ....

....constructing and then computing xed points on it as done in symbolic checkers. Constraints in a sense, a generalization of boolean formulae encoding transition relations and encoded by BDDs are useful in at least two ways. Firstly, they allow for storing possibly in nite sets of states (see also [10, 13], the latter of which notes that the boundary between traditional model checkers and CLP systems has become blurry, as in the case of HyTech) Secondly, powerful self de ned constraint handlers like CHRs can be used for interactively slicing the model [26] Again, we consider this a key to ....

L. Fribourg. Constraint logic programming applied to model checking. In Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817, Venice, 1999. Springer Verlag.

....Petri nets. 1. INTRODUCTION AND SUMMARY Recently there has been interest in applying logic programming techniques to model checking. Table based logic programming, set based analysis, and constraint logic programming can be used as an ecient means of performing model checking [33] 4] [6, 13]. Despite the success of model checking, most systems must still be substantially simpli ed and considerable human ingenuity is required to arrive at the stage where the push button automation can be applied [35] Furthermore, most software systems cannot be modelled directly by a nite state ....

....Another future direction is to move from pure logic programming to constraint logic programming. The latter allows for a more natural encoding of time (and arguably of Petri net markings) and has already proven to be useful on its own (i.e. without specialisation or analysis) for model checking [6, 13]. Acknowledgements We would like to thank Javier Esparza, Neil Jones, Thierry Massart, and Ulrich Ultes Nitsche for interesting discussions and comments. We also thank the referees for their detailed feedback. 7. ....

L. Fribourg. Constraint logic programming applied to model checking. In A. Bossi, editor, Proceedings of LOPSTR'99, LNCS 1817, pages 31-42, Venice, Italy, September 1999.

....approach to the generation of CLP code from concurrent automata similar to Labeled Transition Systems with explicit constraints. All approaches share the commonality of synchronizing components via variables rather than explicit channels (modularity) and of not being supported by tools. Fribourg [9] reviews previous work on the relationship between CLP and 2 Model Checking. 30] present a di erent approach to generating test sequences on the basis of propositional logics. Systems and properties (test cases) are translated into propositional logics and checked for satis ability; the results ....

L. Fribourg. Constraint logic programming applied to model checking. In Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817, Venice, 1999. Springer Verlag.

....to the generation of CLP code from 2 concurrent automata similar to Labeled Transition Systems with explicit constraints. All approaches share the commonality of synchronizing components via variables rather than explicit channels (modularity) and of not being supported by tools. Fribourg [5] reviews previous work on the relationship between CLP and Model Checking. Finally, there is a wealth of literature on test case generation; 24, 18] contain some relevant references. 2 Modeling with AutoFocus AutoFocus [12, 13, 22] is a tool for graphically specifying embedded systems. It ....

L. Fribourg. Constraint logic programming applied to model checking. In Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817, Venice, 1999. Springer Verlag.

No context found.

L. Fribourg. Constraint logic programming applied to model checking. In Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817, Venice, 1999. Springer Verlag.

No context found.

L. Fribourg. Constraint logic programming applied to model checking. In Proc. 9th Int. Workshop on Logicbased Program Synthesis and Transformation (LOPSTR '99), LNCS 1817, Venice, 1999. Springer Verlag.

No context found.

L. Fribourg. Constraint logic programming applied to model checking. In A. Bossi, editor, Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), Venezia, Italy, Sept. 1999, Lecture Notes in Computer Science 1817, pages 3142. Springer, 2000.

No context found.

L. Fribourg. Constraint logic programming applied to model checking. In Proc. 9th Int. Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817, Venice, 1999. Springer Verlag.

No context found.

L. Fribourg. Constraint Logic Programming Applied to Model Checking. In A. Bossi, editor, Proceedings 9th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'99), volume 1817 of LNCS, pages 30-41, Venezia, Italy, 1999. Springer-Verlag.

No context found.

L. Fribourg. Constraint logic programming applied to model checking. In Proc. LOPSTR'99, pages 31-42, 2000.

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