Bounded saturation-based CTL model checking

Vörös, András and Darvas, Dániel and Bartha, Tamás (2013) Bounded saturation-based CTL model checking. Proceedings of the Estonian Academy of Sciences, 62 (1). pp. 59-70.

[img]
Preview
Text
PEAS2013_VorosDarvasBartha.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (805kB) | Preview

Abstract

Formal verification is becoming a fundamental step of safety-critical and model-based software development. As part of the verification process, model checking is one of the current advanced techniques to analyze the behavior of a system. Symbolic model checking is an efficient approach to handling even complex models with huge state spaces. Saturation is a symbolic algorithm with a special iteration strategy, which is efficient for asynchronous models. Recent advances have resulted in many new kinds of saturation-based algorithms for state space generation and bounded state space generation and also for structural model checking. In this paper, we examine how the combination of two advanced model checking algorithms – bounded saturation and saturation-based structural model checking – can be used to verify systems. Our work is the first attempt to combine these approaches, and this way we are able to handle and examine complex or even infinite state systems. Our measurements show that we can exploit the efficiency of saturation in bounded model checking.

Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Systems and Control Lab
Depositing User: Tamás Bartha
Date Deposited: 31 Oct 2013 12:10
Last Modified: 10 Jun 2015 13:46
URI: http://eprints.sztaki.hu/id/eprint/7222

Update Item Update Item