FAR-Cubicle — A new reachability algorithm for Cubicle

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 counterexamples. Refining is made through counterexample approximation. We show the effectiveness and limitations of this algorithm and tradeoffs that results from it.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01927220
Contributor : Claude Marché <>
Submitted on : Monday, November 19, 2018 - 5:05:06 PM
Last modification on : Thursday, October 3, 2019 - 2:04:03 PM
Long-term archiving on : Wednesday, February 20, 2019 - 4:30:15 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

Citation

Sylvain Conchon, Amit Goel, Sava Krstic, Rupak Majumdar, Mattias Roux. FAR-Cubicle — A new reachability algorithm for Cubicle. 2017 Formal Methods in Computer-Aided Design (FMCAD), Oct 2017, Vienna, France. ⟨10.23919/FMCAD.2017.8102256⟩. ⟨hal-01927220⟩

Share

Metrics

Record views

77

Files downloads

218