McScM: A General Framework for the Verification of Communicating Machines

Alexander Heussner (1) , Tristan Le Gall (2) , Grégoire Sutre (3)

1 ULB - Département d'Informatique [Bruxelles]
2 LMeASI - Laboratoire Modélisation et Analyse de Systèmes en Interaction
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We present McScM, a platform for implementing and comparing verification algorithms for the class of finite-state processes exchanging messages over reliable, unbounded FIFO channels. McScM provides tools for the safety verification and controller synthesis of these infinite-state models. Our verification tool implements several model-checking techniques: CEGAR with different abstraction-refinement methods, abstract interpretation, abstract regular model checking, and lazy abstraction. Seen as a general framework for the class of transition systems with finite control/infinite data, McScM delivers the basic infrastructure for implementing verification algorithms, and privileges to conveniently implement new ideas on a high level of abstraction. It also allows us to compare and benchmark different algorithmic approaches with the same backend.

Mots clés: Model Checking; Infinite Systems; Tool; Framework; Synthesis; OCaml; CEGAR; ARMC; Lazy Abstraction Refinement; Abstract Interpretation

Domaines: Autre [cs.OH]

Alexander Heussner, Tristan Le Gall, Grégoire Sutre. McScM: A General Framework for the Verification of Communicating Machines. 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Apr 2012, Tallinn, Estonia. pp.487-484, ⟨10.1007/978-3-642-28756-5⟩. ⟨hal-00688776⟩