We run MCMT on various examples:
parametrized mutual exclusion and cache coherence protocols, timed systems,
imperative programs, etc. These experiments show the great flexibility of the tool.
All the files for these examples are included in the distribution (in each file, a brief description of the source
and the meaning of the example is supplied). Table with experimental statistics (concerning the old version 1.0) are available
Further case studies have been analyzed:
Parameterized Timed Systems:
benchmarks and statistics in this area (Fischer mutual exclusion, csma, etc.)
Mutual exclusion, deadlock freedom and waiting time bounds for Fischer and Lynch-Shavit algorithms:
see here for full analysis, statistics and benchmarks;
Fault Tolerant Systems:
reliable broadcast algorithms from Chandra-Toueg papers have been studied with MCMT; see
here and here
for more information;
Imperative programs: these benchmarks concern standard functions on strings and unbounded arrays (like copying, comparing, searching, etc.) where the new abstraction and acceleration features of version 2.0 are exploited; benchmarks files are available in the distribution.
The tool Booster is an integrated framework: it supplies a front-end to a C fragment and
is able to run different copies of MCMT, trying in parallel
the most promising settings. Booster is recommended for people interested in software model checking applications.
The tools ArCa and ArCa_Sat analyze model-checking and satisfiability problems involving arrays and cardinality constraints; see here for more information.
The tool ASASP analyzes security access policies
within the model checking modulo theories framework.
SAFARI is an ongoing re-implementation of MCMT, comprising abstraction/refinement capabilities.
Cubicle implements the array-based MCMT framework in a parallel architecture.
We thank R. Bruttomesso for supplying a parser that has been integrated in the current distribution; we also thank F. Alberti for various help and for the developement of
translation facilities from higher level specification languages.
S. Ghilardi, E. Nicolini,
S. Ranise, and
D. Zucchelli. Towards
SMT Model-Checking of Array-based Systems In Proc. of IJCAR'08
S. Ghilardi and S. Ranise, Backward Reachability of Array-based Systems by SMT Solving: Termination and Invariant Synthesis, Logical Methods in Computer Science,
vol.6, n.4, 2010.
Stopping failures / Approximated Models.
F. Alberti, S. Ghilardi, E. Pagani, S. Ranise, G. Rossi Universal guards, relativization of quantifiers, and failure models in model checking modulo theories, Journal on Satisfiability, Boolean Modeling and Computation (JSAT), vol. 8, pp. 29-61, 2012.
Abstraction and acceleration features.
F. Alberti, R. Bruttomesso, S, Ghilardi, S. Ranise, N. Sharygina Lazy Abstraction with Interpolants for Arrays, Proceedings of LPAR-18, Springer LNCS, 2012;
F. Alberti, S. Ghilardi, N. Sharygina Definability of Accelerated Relations in a Theory of Arrays and its Applications, Proc. of FroCoS 13, Springer LNCS, 2013;
Implementation of MCMT.
F. Alberti, S. Ghilardi, N. Sharygina
A framework for the verification of parameterized infinite-state systems,
In Proc. of CILC 14, CEUR, 2014.
S. Ghilardi, S. Ranise
MCMT: a Model Checker Modulo Theories,
In Proc. of IJCAR'10, Springer LNCS, vol. 6173, pp. 22-29, 2010.
S. Ghilardi, S. Ranise
Model Checking Modulo Theory
at work: the intergration of Yices in MCMT, Proc. of AFM 09, ACM Digital Library.
F. Alberti, S. Ghilardi, E. Pagani, S. Ranise, G. Rossi BA: Automated Support for
the Design and Validation of Fault Tolerant Parameterized Systems - a case study,
Proc. of the XXIV DIStributed Computing Conference (DISC 10), Springer LNCS, 2010;
full version to appear in the Proc. of the 10th Int.
Work. on Automated Verification of Critical Systems (AVOCS 10), Electr. Communications of the EASST, vol.X, 2010.
A. Carioni, S. Ghilardi, S. Ranise MCMT
in the Land of Parameterized Timed Automata, In Proc. of VERIFY 2010, co-located with IJCAR, Edinburgh, UK, (2010).
R. Bruttomesso, A. Carioni, S. Ghilardi, S. Ranise Automated Analysis of Parametric Timing Based Mutual Exclusion Protocols,
In Proc. the Fourth NASA Formal Methods Symposium, Norfolk, VA, USA (2012).