Parameterized model checking is an active research field that considers automated
verification of distributed or concurrent systems, for all numbers of participating processes. In …

We present a method for the automated verification of temporal properties of infinite state
systems. Our verification method is based on the specialization of constraint logic programs …

Model checking is a fully-automatic formal verification method that has been extremely
successful in validating and verifying safety-critical systems in the past three decades. In the …

We address the problem of the automated verification of temporal properties of infinite state
reactive systems. We present some improvements of a verification method based on the …

We consider infinite state reactive systems specified by using linear constraints over the
integers, and we address the problem of verifying safety properties of these systems by …

The Java memory model guarantees sequentially consistent behavior only for programs that
are data race free. Legal executions of programs with data races may be sequentially …

We consider infinite state reactive systems specified by using linear constraints over the
integers, and we address the problem of verifying safety properties of these systems by …

Program specialization has been proposed as a means of improving constraint-based
analysis of infinite state reactive systems. In particular, safety properties can be specified by …

In this paper we present a counter-example guided abstraction and approximation
(CEGAAR) refinement technique for partial predicate abstraction, which combines predicate …

In this paper we consider combining two techniques that have been effective in analyzing
infinite-state systems: predicate abstraction and fixpoint approximations. Using a carefully …