Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

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

Most specification languages express only qualitative constraints. However, among two
implementations that satisfy a given specification, one may be preferred to another. For …

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 …

Cubicle is a new model checker for verifying safety properties of parameterized systems. It
implements a parallel symbolic backward reachability procedure using Satisfiabilty Modulo …

The safety of infinite state systems can be checked by a backward reachability procedure.
For certain classes of systems, it is possible to prove the termination of the procedure and …

Existing process modeling notations ranging from Petri nets to BPMN have difficulties
capturing the data manipulated by processes. Process models often focus on the control …

Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …

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

We propose DAB–a data-aware extension of BPMN where the process operates over case
and persistent data (partitioned into a read-only database called catalog and a read-write …