MCMT: A model checker modulo theories
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 …
properties of infinite state systems whose state variables are arrays. Theories specify the …
Cubicle: a parallel SMT-based model checker for parameterized systems: tool paper
Cubicle is a new model checker for verifying safety properties of parameterized systems. It
implements a parallel symbolic backward reachability procedure using Satisfiabilty Modulo …
implements a parallel symbolic backward reachability procedure using Satisfiabilty Modulo …
Backward reachability of array-based systems by SMT solving: Termination and invariant synthesis
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 …
For certain classes of systems, it is possible to prove the termination of the procedure and …
Towards SMT model checking of array-based systems
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 …
systems such as broadcast protocols or sorting programs. By using a class of quantified-first …
[BOOK][B] Verification of Data-Aware Processes via Satisfiability Modulo Theories
A Gianola - 2023 - Springer
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 …
Verification of Data-Aware Processes via Satisfiability Modulo Theories Alessandro Gianola …
Invariants for finite instances and beyond
S Conchon, A Goel, S Krstić… - 2013 Formal Methods …, 2013 - ieeexplore.ieee.org
Verification of safety properties of concurrent programs with an arbitrary numbers of
processes is an old challenge. In particular, complex parameterized protocols like FLASH …
processes is an old challenge. In particular, complex parameterized protocols like FLASH …
Liveness of randomised parameterised systems under arbitrary schedulers
We consider the problem of verifying liveness for systems with a finite, but unbounded,
number of processes, commonly known as parameterised systems. Typical examples of …
number of processes, commonly known as parameterised systems. Typical examples of …
Universal guards, relativization of quantifiers, and failure models in model checking modulo theories
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 …
verification of safety properties of a class of infinite state systems manipulating arrays, called …
Parametrized verification of distributed cyber-physical systems: An aircraft landing protocol case study
In this paper, we present the formal modeling and automatic parameterized verification of a
distributed air traffic control protocol called the Small Aircraft Transportation System (SATS) …
distributed air traffic control protocol called the Small Aircraft Transportation System (SATS) …
Handling parameterized systems with non-atomic global conditions
We consider verification of safety properties for parameterized systems with linear
topologies. A process in the system is an extended automaton, where the transitions are …
topologies. A process in the system is an extended automaton, where the transitions are …