A symbolic model checker for tccp programs

Authors:
M. Alpuente;M. Falaschi;A. Villanueva
Affiliations:
DSIC, Technical University of Valencia, Valencia, Spain;DIMI, University of Udine, Udine, Italy;DSIC, Technical University of Valencia, Valencia, Spain
Venue:
RISE'04 Proceedings of the First international conference on Rapid Integration of Software Engineering Techniques
Year:
2004

Citing 9
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The semantic foundations of concurrent constraint programming

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking

Model checking
A timed concurrent constraint language

Information and Computation
Symbolic Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Difference Decision Diagrams

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A Temporal Logic for Reasoning about Timed Concurrent Constraint Programs

TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Automatic verification of timed concurrent constraint programs

Theory and Practice of Logic Programming
Abstract Model Checking of tccp programs

Electronic Notes in Theoretical Computer Science (ENTCS)

A Tool for Generating a Symbolic Representation of tccp Executions

Electronic Notes in Theoretical Computer Science (ENTCS)
Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for reactive systems. Our approach is based on using streams to extend Difference Decision Diagrams (DDDs) which generalize the classical Binary Decision Diagrams (BDDs) with constraints. We use streams to model the values of system variables along the time, as occurs in many other (declarative) languages. Then, we define a symbolic (finite states) model checking algorithm for tccp which mitigates the state explosion problem that is common to more conventional model checking approaches. We show how the symbolic approach to model checking for tccp improves previous approaches based on the classical Linear Time Logic (LTL) model checking algorithm.