Improving Saturation-based Bounded Model Checking

  • Dániel Darvas
  • András Vörös
  • Tamás Bartha


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.


Download data is not yet available.
How to Cite
Darvas, D., Vörös, A., & Bartha, T. (2016). Improving Saturation-based Bounded Model Checking. Acta Cybernetica, 22(3), 573-589.
Regular articles