Monotonic Abstraction in Parameterized Verification

Authors:
Parosh Aziz Abdulla;Giorgio Delzanno;Ahmed Rezine
Affiliations:
Department of Information Technology, Uppsala University, Sweden;Dipartimento Informatica e Scienze dell'Informazione, Università di Genova, Italy;LIAFA, University of Paris 7, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 10
Cited 1

A closed-form evaluation for Datalog queries with integer (gap)-order constraints

ICDT Selected papers of the 4th international conference on Database theory
Symbolic model checking with rich assertional languages

Theoretical Computer Science
Regular Model Checking Made Simple and Efficient

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Automatic Verification of Parameterized Cache Coherence Protocols

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
General decidability theorems for infinite-state systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On Model Checking for Non-Deterministic Infinite-State Systems

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Regular model checking without transducers (on efficient verification of parameterized systems)

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Parameterized verification of infinite-state processes with global conditions

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Handling parameterized systems with non-atomic global conditions

VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation

State space reduction in modeling checking parameterized cache coherence protocol by two-dimensional abstraction

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes which are organized in a linear array. The aim is to prove correctness of the system regardless of the number of processes inside the system. We give an overview of the method of monotonic abstraction, which provides an over-approximation of the transition system induced by a parameterized system. The over-approximation gives a transition system which is monotonic with respect to a well quasi-ordering on the set of configurations. This makes it possible to use existing methods for verification of well quasi-ordered programs.