Model checking for the concurrent constraint paradigm: Thesis

Authors:
Alicia Villanueva
Affiliations:
Dep. de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera, s/n, E-46022 Valencia, Spain E-mail: villanue@dsic.upv.es
Venue:
AI Communications
Year:
2004

Citing 10
Cited 0

Concurrent constraint programming

Concurrent constraint programming
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Hybrid cc, hybrid automata and program verification (extended abstract)

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A timed concurrent constraint language

Information and Computation
Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
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)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper abstracts the contents of the PhD dissertation which has been recently defended by the author. Although model checking was defined to automatically verify hardware, in the last decades it has been showed that it is possible to apply the technique also to software. The concurrent constraint paradigm is a simple but powerful computational model which we can use to specify reactive and hybrid systems. The thesis considers three of the timed languages of this paradigm. It presents two methods to apply the model checking technique to two different timed concurrent constraint languages, and it is also defined a denotational semantics which is fully abstract w.r.t. the operational behavior of another timed concurrent constraint language. This new semantics allows one to perform useful static analysis of programs.