Global vs. local model checking: a comparison of verification techniques for infinite state systems

Abstract

Abstract

Local Model Checking Algorithm Based on Mu-calculus with Partial Orders

“…And our algorithm takes about reduces repetitive computation and improves the computational efficiency. The research in this paper is very important to theoretical research and practical application [25,27], it can improve the efficiency for verifying hardware and software designs. As we know, two groups of partial ordered relation were presented by Tarski fixpoint theory, our next work is to design a local algorithm by obtaining two groups of partial ordered relation and improve the space complexity.…”

Model-checking CTL* over flat Presburger counter systems

“…For instance, the flattable systems admit a flat finite unfolding of the control graph with the same reachability set. On the logical side, temporal logics with Presburger constraints have been defined and investigated in (Čerans, 1994;Bouajjani et al, 1995;Bultan et al, 1997;Comon et al, 2000;Schuele et al, 2004;Demri, 2006;Bruyère et al, 2003), some of which have quite expressive decidable fragments. However, undecidability of the reachability problem can be proved for quite restricted counter systems, see e.g.…”

Proving ∀μ-Calculus Properties with SAT-Based Model Checking

“…The reduction of proof search in local model checking to satisfiability can also be found in [18,19], in which the authors reduce the local model checking problem to Presburger arithmetic for infinite-state systems. Due to the undecidability of the µ-calculus model checking problem on infinite-state systems, the completeness of the algorithms in [18,19] is not the main concern of the authors.…”

“…Due to the undecidability of the µ-calculus model checking problem on infinite-state systems, the completeness of the algorithms in [18,19] is not the main concern of the authors. For the invariant and inevitable properties on finite-state systems, the present work extends and subsumes the complete algorithms in [20].…”