Compositional verification of asynchronous processes via constraint solving

Authors:
Giorgio Delzanno;Maurizio Gabbrielli
Affiliations:
Dip. di Informatica e Scienze dell’Informazione, Università di Genova, Genova, Italy;Dip. di Scienze dell’Informazione, Università di Bologna, Bologna, Italy
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 11
Cited 1

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming by multiset transformation

Communications of the ACM
Mappings of languages by two-tape devices

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
A model and proof system for asynchronous networks

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A timed concurrent constraint language

Information and Computation
Model Checking in CLP

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A denotational semantics for Timed Linda

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
An incremental and layered procedure for the satisfiability of linear arithmetic logic

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems

An overview of AI research in Italy

Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the foundations of a constraint-based compositional verification method for infinite-state systems. We first consider an asynchronous process calculus which is an abstract formalization of several existing languages based on the blackboard model. For this calculus we define a constraint-based symbolic representation of finite computations of a compositional model based on traces. The constraint system we use combines formulas of integer arithmetics with equalities over uninterpreted functions in which satisfiability is decidable. The translation is inductively defined via a CLP program. Execution traces of a process can be compositionally obtained from the solutions of the answer constraints of the CLP encoding. This way, the task of compositional verification can be reduced to constraint computing and solving.