We present Universal Property Directed Reachability (PDR∀), a property-directed semi-
algorithm for automatic inference of invariants in a universal fragment of first-order logic …

In recent times, satisfiability modulo theories (SMT) techniques gained increasing attention
and obtained remarkable success in model-checking infinite-state systems. Still, we believe …

Automated program verification is a difficult problem. It is undecidable even for transition
systems over Linear Integer Arithmetic (LIA). Extending the transition system with theory of …

It is well known that verification of safety properties of sequential programs is reducible to
satisfiability modulo theory of a first-order logic formula, called a verification condition (VC) …

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 …

Verification of Data-Aware Processes via Satisfiability Modulo Theories Page 1 123 LNBIP 470
Verification of Data-Aware Processes via Satisfiability Modulo Theories Alessandro Gianola …

We consider the problem of invariant checking for transition systems using SMT and
quantified variables ranging over finite but unbounded domains. We propose a general …

We present our framework for the verification of parameterized infinite-state systems. The
framework has been successfully applied in the verification of heterogeneous systems …

Automatic verification of array manipulating programs is a challenging problem because it
often amounts to the inference of inductive quantified loop invariants which, in some cases …

Parameterized verification is a challenging problem that is known to be undecidable in the
general case. ‍is a widely-used method for parameterized verification, originally proposed by …