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

Alt-Ergo is an SMT solver jointly developed by Université Paris-Sud and the OCamlPro
company. The first version was released in 2006. Since then, its architecture has been …

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 …

Proving that an unbounded distributed protocol satisfies a given safety property amounts to
finding a quantified inductive invariant that implies the property for all possible instance …

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 …

Modern networks enforce rich and dynamic policies (eg, dynamic service chaining and path
pinning) over a number of complex and stateful NFs (eg, stateful firewall and load balancer) …

Lamport's celebrated Paxos consensus protocol is generally viewed as a complex hard-to-
understand algorithm. Notwithstanding its complexity, in this paper, we take a step towards …

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) …

We define a method for taking advantage of net reductions in combination with a SMT-based
model checker. We prove the correctness of this method using a new notion of equivalence …