Darvas Dániel and Vörös András and Bartha Tamás: Improving saturation-based bounded model checking. In: Acta cybernetica, (22) 3. pp. 573-589. (2016)
Preview |
Cikk, tanulmány, mű
actacyb_22_3_2016_2.pdf Download (453kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2016 |
| Volume: | 22 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 573-589 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/41665/ |
| DOI: | 10.14232/actacyb.22.3.2016.2 |
| Uncontrolled Keywords: | Aszinkron rendszerek - telítettség |
| Additional Information: | Bibliogr.: p. 588-589. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2017. Feb. 14. 18:06 |
| Last Modified: | 2022. Jun. 20. 12:40 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/40263 |
Actions (login required)
 |
View Item |
