FAR-Cubicle — A new reachability algorithm for Cubicle - Archive ouverte HAL Access content directly
Conference Papers Year :

FAR-Cubicle — A new reachability algorithm for Cubicle

(1, 2) , (3) , (4) , (5) , (1, 2)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
main.pdf (103.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01927220 , version 1 (19-11-2018)

Identifiers

Cite

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⟩
77 View
78 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More