G. Delzanno and A. Podelski. Model checking in CLP. LNCS, 1579:223--239, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Modeling and Querying Biomolecular Interaction Networks - Chabrier-Rivier.. (2003) (Correct)
....handled by the symbolic model checking algorithm. On the other hand, constraint based model checking applies to infinite state systems. In this approach, a constrained state is a finite representation using constraints, of a finite or infinite set of states. In the scheme of Delzanno and Podelski [DP99] infinite state Kripke structures are represented by constraint logic programs, and the CTL formulas, that are based on a fragment of firstorder logic, are identified to the least fixed point and greatest fixed point of constraint logic programs. Constraint based model checking over integers ....
G. Delzanno and A. Podelski. Model checking in CLP. In Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems TACAS'99, volume 1579 of LNCS, pages 223--239. Springer-Verlag, January 1999.
Model Checking for the Concurrent Constraint Paradigm - Garcia (Correct)
....are several veri cation methods which combine these two notions. These approaches de ne methodologies or algorithms that allow us to apply the model checking technique to concurrent, reactive or even hybrid systems. It is also possible to verify some subclasses of in nite state systems. In [DP99, DP01] Delzanno and Podelski presented a method that allows us to verify a communication protocol with an in nite number of states. In particular, they proved that a client server protocol is correct for an arbitrary number of processes (clients) Classical approaches could prove the same ....
....safety and liveness properties over such CLP programs. Another interesting approach which combines veri cation and constraints can be found in [EM97] Here a semidecision algorithm that uses constraint programming in order to verify 1 safe Petri nets is introduced. Actually, while in [DP01, DP99] constraints are used as an abstract representation of the set of system states, in [EM97] constraint programming is used to solve linear constraints in the implementation of the algorithm. In [FPV00a, FPV00b] the authors presented a framework that allowed us to apply the model checking ....
[Article contains additional citation context not shown here]
G. Delzanno and A. Podelski. Model Checking in CLP. In R. Cleaveland, editor, Proceedings 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1579 of Lecture Notes in Computer Science, pages 223-239, Berlin, 1999. Springer-Verlag.
Efficient Algorithms for pre* and post* on Interprocedural.. - Esparza, Podelski (2000) Self-citation (Podelski) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Proceedings of TACAS'99: Tools and Algorithms for the Construction and Analysis of Systems, volume 1579 of LNCS, pages 223-239. Springer-Verlag, 1999.
On the Automated Verification of Parameterized Concurrent.. - Delzanno Self-citation (Delzanno) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Proceedings 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'99), volume 1579 of LNCS, pages 223-239, Amsterdam, The Netherlands, 1999. Springer-Verlag.
Relative Completeness of Abstraction Refinement for.. - Ball, Podelski, Rajamani (2002) (12 citations) Self-citation (Podelski) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In TACAS 99: Tools and Algorithms for Construction and Analysis of Systems, LNCS 1579, pages 223-239. Springer-Verlag, 1999.
On Model Checking for a Nominal Process Calculus - Delzanno Self-citation (Delzanno) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In Proc. TACAS'99, LNCS 1579, pp. 223-239, 1999.
Beyond Parameterized Verification - Bozzano, Delzanno (2002) (1 citation) Self-citation (Delzanno) (Correct)
....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 ....
[Article contains additional citation context not shown here]
G. Delzanno and A. Podelski. Model checking in CLP. In Proc. TACAS'99, LNCS 1579, pp. 223-239, 1999.
Learning to Verify Safety Properties - Vardhan, Sen, Viswanathan, Agha (2004) (1 citation) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. LNCS, 1579:223--239, 1999.
Modeling and Querying Biomolecular Interaction Networks - Chabrier-Rivier.. (2003) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems TACAS'99, volume 1579 of LNCS, pages 223--239. Springer-Verlag, January 1999.
Model Based Testing for Real: The Inhouse Card Case Study - Pretschner, Slotosch.. (2001) (1 citation) (Correct)
No context found.
G. Delzanno and A. Podelski. Model Checking in CLP. In Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS'99), pages 223--239, 1999.
Widening Operators for Powerset Domains - Bagnara, Hill, Zaffanella (2004) (3 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, volume 1579 of Lecture Notes in Computer Science, pages 223--239, Amsterdam, The Netherlands, 1999. Springer-Verlag, Berlin.
Widening Operators for Powerset Domains - Roberto Bagnara Patricia (2004) (3 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, volume 1579 of Lecture Notes in Computer Science, pages 223--239, Amsterdam, The Netherlands, 1999. Springer-Verlag, Berlin.
Compositional Analysis for Verification of Parameterized.. - Basu, Ramakrishnan (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In TACAS, 1999.
Combining Logic Programs and Monadic Second Order.. - Fioravanti.. (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), Lecture Notes in Computer Science 1579, pages 223239. Springer-Verlag, 1999.
Widening Operators for Powerset Domains - Bagnara, Hill, Zaffanella (2004) (3 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, volume 1579 of Lecture Notes in Computer Science, pages 223--239, Amsterdam, The Netherlands, 1999. Springer-Verlag, Berlin.
On the Decidability of Timed CCP - Valencia (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in clp. In Int'l Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1579, pages 223--239. LNCS, 1999.
Lazy Abstraction - Thomas Henzinger Ranjit (2002) (70 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In TACAS 99: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1579, pp. 223--239. Springer, 1999.
Widening Operators for Powerset Domains - Bagnara, Hill, Zaffanella (2004) (3 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, volume 1579 of Lecture Notes in Computer Science, pages 223--239, Amsterdam, The Netherlands, 1999. Springer-Verlag, Berlin.
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
G. Delzanno, A. Podelski, Model checking in CLP, in: R. Cleaveland (Ed.), Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, Vol. 1579 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Amsterdam, The Netherlands, 1999, pp. 223-- 239.
Classical Search Strategies for Test Case Generation with.. - Pretschner (2001) (6 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model Checking in CLP. In Proc. Tools and Algorithms for Construction and Analysis of Systems (TACAS'99), pages 223--239, 1999.
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, volume 1579 of Lecture Notes in Computer Science, pages 223--239, Amsterdam, The Netherlands, 1999. Springer-Verlag, Berlin.
Solving Alternating Boolean Equation Systems in Answer Set.. - Keinänen, Niemelä (2004) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In Proceedings of the Int. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 1579, pages 223--239, 1999.
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
G. Delzanno, A. Podelski, Model checking in CLP, in: R. Cleaveland (Ed.), Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, Vol. 1579 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Amsterdam, The Netherlands, 1999, pp. 223-- 239.
Precise Widening Operators for Convex Polyhedra - Bagnara, Hill, Ricci, Zaffanella (2003) (2 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, volume 1579 of Lecture Notes in Computer Science, pages 223--239, Amsterdam, The Netherlands, 1999. Springer-Verlag, Berlin.
Symbolic Model Checking of Biochemical Networks - Chabrier, Fages (2003) (4 citations) (Correct)
No context found.
G. Delzanno and A. Podelski. Model checking in clp. In Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems TACAS'99, volume 1579 of LNCS, pages 223-239. Springer-Verlag, January 1999.
First 50 documents Next 50
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