Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation

Zhao, Yiwen; Ciardo, Gianfranco

doi:10.1007/978-3-642-04761-9_27

Cited by 20 publications

(25 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Later, the algorithm was improved in [20]. In the latter publication the authors applied a constrained saturation algorithm to prune the next-state function.…”

Section: Saturation-based Bounded Model Checkingmentioning

confidence: 99%

“…Our algorithm follows a different idea: instead of exploring the whole state space and then pruning the next-state function for the computation of the fixedpoint iterations, we restrict the state space to a given bound, and apply structural CTL model checking on this restricted part. Our approach has both advantages and disadvantages compared to the approach in [20]. On the one hand, many design and implementation errors are shallow, thus they can be reached in a few steps, and so bounded model checking can find these errors efficiently.…”

Section: Saturation-based Bounded Model Checkingmentioning

confidence: 99%

“…Bounded saturation-based state space exploration was presented in [20], where the authors introduced a new saturation algorithm, which explores the state space only to some bounded depth. In this paper we extend their approach to bounded Computation Tree Logic (CTL) model checking.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Bounded saturation-based CTL model checking

Vörös¹,

Darvas²,

Bartha³

2013

Proc. Estonian Acad. Sci.

View full text Add to dashboard Cite

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 analyse the behaviour 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 saturationbased 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.

show abstract

“…Later, the algorithm was improved in [20]. In the latter publication the authors applied a constrained saturation algorithm to prune the next-state function.…”

Section: Saturation-based Bounded Model Checkingmentioning

confidence: 99%

Section: Saturation-based Bounded Model Checkingmentioning

confidence: 99%

See 1 more Smart Citation

Bounded saturation-based CTL model checking

Vörös¹,

Darvas²,

Bartha³

2013

Proc. Estonian Acad. Sci.

View full text Add to dashboard Cite

show abstract

“…In [13] the authors introduced an advanced saturation-based iteration strategy for the purpose of structural model checking. The algorithm, called constrained saturation, computes the least fixed point of the reachability relation that satisfies a given constraint.…”

Section: Constrained Saturationmentioning

confidence: 99%

“…The so-called saturation-based structural model checking algorithm can evaluate temporal logic properties. Nowadays, the so-called constrained saturation-based structural model checking algorithm is one of the most efficient algorithms for CTL model checking [13].…”

Section: Introductionmentioning

confidence: 99%

Improving Saturation-based Bounded Model Checking

2016

View full text Add to dashboard Cite

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.

show abstract

Symbolic Model Checking for Avionics

Gnesi

Margaria

2012

Formal Methods for Industrial Critical Systems

View full text Add to dashboard Cite

Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation

Cited by 20 publications

References 10 publications

Bounded saturation-based CTL model checking

Bounded saturation-based CTL model checking

Improving Saturation-based Bounded Model Checking

Symbolic Model Checking for Avionics

Contact Info

Product

Resources

About