Abstract Model Checking Modulo Theories is a recent approach for the automated
verification of safety properties of a class of infinite state systems manipulating arrays, called …

We introduce the notion of array-based system as a suitable abstraction of infinite state
systems such as broadcast protocols or sorting programs. By using a class of quantified-first …

Recently, the notion of an array-based system has been introduced as an abstraction of
infinite state systems (such as mutual exclusion protocols or sorting programs) which allows …

We describe mcmt, a fully declarative and deductive symbolic model checker for safety
properties of infinite state systems whose state variables are arrays. Theories specify the …

The problem of invariant checking in parametric systems–which are required to operate
correctly regardless of the number and connections of their components–is gaining …

We develop a framework for model checking infinite-state systems by automatically
augmenting them with auxiliary variables, enabling quantifier-free induction proofs for …

The paper considers the problem of uniform verification of parameterizedsystems by
symbolic model checking, using formulas in fs1s (a syntactic variant of the 2nd order logic …

We propose a verification method for parameterized systems with global conditions. The
method is based on context-sensitive constraints, a symbolic representation of infinite sets of …

Over the last few years there has been an increasing research effort directed towards the
automatic verification of infinite state systems. For different classes of such systems, eg …

Recently, the notion of an array-based system has been introduced as an abstraction of
infinite state systems (such as parametrised systems) which allows for model checking …