Year: 2017
Type: conference-paper
Abstract: We present a fully automatic algorithm for verifying safety properties of parameterized software systems. This algorithm is based on both IC3 and Lazy Annotation. We implemented it in Cubicle, a model checker for verifying safety properties of array-based systems. Cache-coherence protocols and mutual exclusion algorithms are known examples of such systems. Our algorithm iteratively builds an abstract reachability graph refining the set of reachable states from counter-examples. Refining is made through counter-example approximation. We show the effectiveness and limitations of this algorithm and tradeoffs that results from it.
Authors: Sylvain Conchon, Amit Goel, Sava Krstic, Rupak Majumdar, Mattias Roux
Institutions: Université Paris-Sud, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Centre Inria de Saclay, Laboratoire de Recherche en Informatique, Apple (United States), Intel (United States), Max Planck Institute for Software Systems
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Agence Nationale de la Recherche
OpenAlex ID: W2767888276