MCMT: A model checker modulo theories

S Ghilardi, S Ranise - … : 5th International Joint Conference, IJCAR 2010 …, 2010 - Springer
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: a parallel SMT-based model checker for parameterized systems: tool paper

S Conchon, A Goel, S Krstić, A Mebsout… - … , CA, USA, July 7-13, 2012 …, 2012 - Springer
Cubicle is a new model checker for verifying safety properties of parameterized systems. It
implements a parallel symbolic backward reachability procedure using Satisfiabilty Modulo …

[PDF][PDF] Backward reachability of array-based systems by SMT solving: Termination and invariant synthesis

S Ghilardi, S Ranise - Logical Methods in Computer Science, 2010 - lmcs.episciences.org
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 …

Towards SMT model checking of array-based systems

S Ghilardi, E Nicolini, S Ranise, D Zucchelli - Automated Reasoning: 4th …, 2008 - Springer
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 …

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 …

Enabling bounded verification of doubly-unbounded distributed agreement-based systems via bounded regions

C Wagner, N Jaber, R Samanta - Proceedings of the ACM on …, 2023 - dl.acm.org
The ubiquity of distributed agreement protocols, such as consensus, has galvanized interest
in verification of such protocols as well as applications built on top of them. The complexity …

Universal guards, relativization of quantifiers, and failure models in model checking modulo theories

F Alberti, S Ghilardi, E Pagani, S Ranise… - Journal on …, 2012 - content.iospress.com
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 …

Liveness of randomised parameterised systems under arbitrary schedulers

AW Lin, P Rümmer - … : 28th International Conference, CAV 2016, Toronto …, 2016 - Springer
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 …

Parametrized verification of distributed cyber-physical systems: An aircraft landing protocol case study

TT Johnson, S Mitra - 2012 IEEE/ACM Third International …, 2012 - ieeexplore.ieee.org
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) …

SMT-based safety verification of data-aware processes: Foundations and applications

A Gianola - 2022 - bia.unibz.it
SMT-based Safety Verification of Data-Aware Processes: Foundations and Applications Page 1
SMT-based Safety Verification of Data-Aware Processes: Foundations and Applications …