Improving saturation-based bounded model checking

Formal verification is becoming a fundamental step in assuring the correctness of safety-critical systems. Since these systems are often asynchronous and even distributed, their verification requires methods that can deal with huge or even infinite state spaces. Model checking is one of the current...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Darvas Dániel
Vörös András
Bartha Tamás
Dokumentumtípus: Cikk
Megjelent: 2016
Sorozat:Acta cybernetica 22 No. 3
Kulcsszavak:Aszinkron rendszerek - telítettség
Tárgyszavak:
doi:10.14232/actacyb.22.3.2016.2

Online Access:http://acta.bibl.u-szeged.hu/40263
Leíró adatok
Tartalmi kivonat:Formal verification is becoming a fundamental step in assuring the correctness of safety-critical systems. Since these systems are often asynchronous and even distributed, their verification requires methods that can deal with huge or even infinite state spaces. Model checking is one of the current techniques to analyse the behaviour of systems, as part of the verification process. In this paper a symbolic bounded model checking algorithm is presented that relies on efficient saturation-based methods. The previous approaches are extended with new bounded state space exploration strategies. In addition, constrained saturation is also introduced to improve the efficiency of bounded model checking. Our measurements confirm that these approaches do not only offer a solution to deal with infinite state spaces, but in many cases they even outperform the original methods.
Terjedelem/Fizikai jellemzők:573-589
ISSN:0324-721X