Constraint Logic Programming for Local and Symbolic Model-Checking

Authors:
Ulf Nilsson;Johan Lübcke
Affiliations:
-;-
Venue:
CL '00 Proceedings of the First International Conference on Computational Logic
Year:
2000

Citing 13
Cited 15

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Design and validation of computer protocols

Design and validation of computer protocols
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Local model checking in the modal mu-calculus

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Memoing for logic programs

Communications of the ACM
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Symbolic Model Checking

Symbolic Model Checking
Memoing Evaluation for Constraint Extensions of Datalog

Constraints
Set-Based Analysis of Reactive Infinite-State Systems

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Model Checking in CLP

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficient Model Checking Using Tabled Resolution

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Toupie = µ-Calculus + Constraints

Proceedings of the 7th International Conference on Computer Aided Verification

Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Program Derivation = Rules + Strategies

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Verification of Sets of Infinite State Processes Using Program Transformation

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Analysis of Linear Hybrid Systems in CLP

Logic-Based Program Synthesis and Transformation
Transformations of logic programs on infinite lists

Theory and Practice of Logic Programming
Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Program specialization for verifying infinite state systems: an experimental evaluation

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Transformational verification of parameterized protocols using array formulas

LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Deciding full branching time logic by program transformation

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
A CLP method for compositional and intermittent predicate abstraction

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Relative safety

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
ARMC: the logical choice for software model checking with abstraction refinement

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
Synthesizing Concurrent Programs Using Answer Set Programming

Fundamenta Informaticae - Concurrency Specification and Programming CS&P

Quantified Score

Hi-index	0.00

Visualization

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.