by Ulf Nilsson, Johan Lubcke
CL 2000: Computational Logic, number 1861 in Lecture Notes in Articial Intelligence
ftp://ftp.ida.liu.se/pub/labs/logpro/Papers/cl2000.pdf
Add To MetaCart
Abstract:
Abstract. We propose a model checking scheme for a semantically complete fragment of CTL by combining techniques from constraint logic programming, a restricted form of constructive negation and tabled resolution. Our approach is symbolic in that it encodes and manipulates sets of states using constraints; it supports local model checking using goal-directed computation enhanced by tabulation. The framework is parameterized by the constraint domain and supports any finite constraint domain closed under disjunction, projection and complementation. We show how to encode our fragment of CTL in constraint logic programming; we outline an abstract execution model for the resulting type of programs and provide a preliminary evaluation of the approach. 1
Citations
|
1442
|
Model Checking
– Grumberg, Peled
|
|
1128
|
Symbolic Model Checking
– McMillan
- 1993
|
|
910
|
Temporal and modal logic
– Emerson
- 1990
|
|
755
|
Constraint logic programming
– Jaffar, Lassez
- 1987
|
|
714
|
Design and Validation of Computer Protocols
– Holzmann
- 1991
|
|
655
|
Constraint Logic Programming: A Survey
– Jaffar, Maher
- 1994
|
|
218
|
Logic programming and negation: A survey
– Apt, Bol
- 1994
|
|
207
|
Symbolic model checking for sequential circuit verification
– Burch, Clarke, et al.
- 1994
|
|
179
|
Tabled evaluation with delaying for general logic programs
– Chen, Warren
- 1996
|
|
123
|
Negation and Constraint Logic Programming
– Stuckey
|
|
106
|
Memoing for logic programs
– Warren
- 1992
|
|
95
|
Local model checking in the modal mu-calculus
– Stirling, Walker
- 1991
|
|
94
|
Efficient Model Checking Using Tabled Resolution
– Ramakrishna, Ramakrishnan, et al.
- 1997
|
|
81
|
Model checking in CLP
– Delzanno, Podelski
- 1999
|
|
27
|
Set-based analysis of reactive infinitestate systems
– Charatonik, Podelski
- 1998
|
|
19
|
Fighting livelock in the i-protocol: a comparative study of verification tools
– Dong, Du, et al.
- 1999
|
|
15
|
Memoing evaluation for constraint extensions of datalog
– TOMAN
- 1997
|
|
3
|
Tabulation-based Logic Programming
– Degerstedt
- 1996
|
|
2
|
Toupie = Mu-calculus + Constraints
– Rauzy
- 1995
|
|
1
|
Model Checking Infinite-State Systems using CLP
– Delzanno, Podelski
- 1998
|
|
1
|
On-the-fly CTL Model-checking using Constraint Logic Programming
– Lubcke, Nilsson
- 1999
|