article

Liveness Checking as Safety Checking for Infinite State Spaces

Authors:

Viktor Schuppan,

Armin BiereAuthors Info & Claims

Electronic Notes in Theoretical Computer Science (ENTCS), Volume 149, Issue 1

Pages 79 - 96

https://doi.org/10.1016/j.entcs.2005.11.018

Published: 01 February 2006 Publication History

Abstract

In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for model checking of liveness properties, help to find shortest counterexamples, and overcome limitations of closed-source model-checking tools. In this paper we show that a similar reduction can be applied to a number of infinite state systems, namely, (@w-)regular model checking, push-down systems, and timed automata.

References

[1]

Abdulla, P., Jonsson, B., Nilsson, M. and d'Orso, J., Algorithmic improvements in regular model checking. In: Hunt, W., Somenzi, F. (Eds.), LNCS, 2725. pp. 236-248.

[2]

Abdulla, P., B. Jonsson, M. Nilsson, J. d'Orso and M. Saksena, Regular model checking for LTL (MSO), in: Alur and Peled {5}, pp. 348--360

[3]

Aceto, L., Bouyer, P., Burgueòo, A. and Larsen, K., The power of reachability testing for timed automata. Theor. Comput. Sci. v300. 411-475.

Digital Library

[4]

Alur, R. and Dill, D., A theory of timed automata. Theor. Comput. Sci. v126. 183-235.

Digital Library

[5]

In: Alur, R., Peled, D. (Eds.), LNCS, 3114. Springer.

[6]

Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P. and Romijn, J., Efficient guiding towards cost-optimality in UPPAAL. In: Margaria, T., Yi, W. (Eds.), LNCS, 2031. pp. 174-188.

Digital Library

[7]

Biere, A., Artho, C. and Schuppan, V., Liveness checking as safety checking. Electronic Notes in Theoretical Computer Science. v66 i2.

[8]

Biere, A., Cimatti, A., Clarke, E. and Zhu, Y., Symbolic model checking without BDDs. In: Cleaveland, R. (Ed.), LNCS, 1579. pp. 193-207.

Digital Library

[9]

Boigelot, B., Legay, A. and Wolper, P., Omega-regular model checking. In: Jensen, K., Podelski, A. (Eds.), LNCS, 2988. pp. 561-575.

[10]

Bouajjani, A., Esparza, J. and Maler, O., Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A.W., Winkowski, J. (Eds.), LNCS, 1243. pp. 135-150.

Digital Library

[11]

Bouajjani, A., P. Habermehl and T. Vojnar, Abstract regular model checking, in: Alur and Peled {5}, pp. 372--386

[12]

Bouajjani, A., B. Jonsson, M. Nilsson and T. Touili, Regular model checking, in: Emerson and Sistla {15}, pp. 403--418

Digital Library

[13]

Bouajjani, A., A. Legay and P. Wolper, Handling liveness properties in (ω-)regular model checking, in: INFINITY'04, 2004

[14]

Clarke, E., Grumberg, O. and Peled, D., Model Checking. 1999. MIT Press.

Digital Library

[15]

In: Emerson, E., Sistla, A. (Eds.), LNCS, 1855. Springer.

[16]

Esparza, J., D. Hansel, P. Rossmanith and S. Schwoon, Efficient algorithms for model checking pushdown systems, in: Emerson and Sistla {15}, pp. 232--247

Digital Library

[17]

Esparza, J. and Schwoon, S., A BDD-based model checker for recursive programs. In: Berry, G., Comon, H., Finkel, A. (Eds.), LNCS, 2102. pp. 324-336.

Digital Library

[18]

Finkel, A., Willems, B. and Wolper, P., A direct symbolic approach to model checking pushdown systems (extended abstract). ENTCS. v9.

[19]

Jonsson, B. and Nilsson, M., Transitive closures of regular relations for verifying infinite-state systems. In: Graf, S., Schwartzbach, M. (Eds.), LNCS, 1785. pp. 220-234.

Digital Library

[20]

Kesten, Y., Maler, O., Marcus, M., Pnueli, A. and Shahar, E., Symbolic model checking with rich assertional languages. Theor. Comput. Sci. v256. 93-112.

Digital Library

[21]

Kozen, D., Results on the propositional μ-calculus. Theor. Comput. Sci. v27. 333-354.

[22]

Kupferman, O. and Vardi, M., Model checking of safety properties. Formal Methods in System Design. v19. 291-314.

Digital Library

[23]

Larsen, K., Pettersson, P. and Yi, W., Uppaal in a Nutshell. International Journal on Software Tools for Technology Transfer (STTT). v1. 134-152.

[24]

Pnueli, A. and E. Shahar, Liveness and acceleration in parameterized verification, in: Emerson and Sistla {15}, pp. 328--343

Digital Library

[25]

Schuppan, V., “Liveness Checking as Safety Checking to Find Shortest Counterexamples to Linear Time Properties,” Ph.D. thesis, ETH Zürich (2005)

[26]

Schuppan, V. and Biere, A., Efficient reduction of finite state model checking to reachability analysis. International Journal on Software Tools for Technology Transfer (STTT). v5. 185-204.

[27]

Schuppan, V. and Biere, A., Shortest counterexamples for symbolic model checking of LTL with past. In: Halbwachs, N., Zuck, L. (Eds.), LNCS, 3440. pp. 493-509.

Digital Library

[28]

Schwoon, S., “Model-Checking Pushdown Systems,” Ph.D. thesis, Technische Universität München (2002)

[29]

Sebastiani, R., Tonetta, S. and Vardi, M., Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking. In: Etessami, K., Rajamani, S. (Eds.), LNCS, 3576. pp. 350-363.

Digital Library

[30]

Shilov, N. and Yi, K., On expressive and model checking power of propositional program logics. In: Bjørner, D., Broy, M., Zamulin, A. (Eds.), LNCS, 2244. pp. 39-46.

Digital Library

[31]

Shilov, N., K. Yi, H. Eo, S. O and K.-M. Choe, Proofs about folklore: why model checking = reachability? (2005), submitted

[32]

Stirling, C., Games and modal mu-calculus. In: Margaria, T., Steffen, B. (Eds.), LNCS, 1055. pp. 298-312.

Digital Library

[33]

Vardi, M. and P. Wolper, An automata-theoretic approach to automatic program verification, in: LICS'86 (1986), pp. 332--344

[34]

Wolper, P. and Boigelot, B., Verifying systems with infinite but regular state spaces. In: Hu, A., Vardi, M. (Eds.), LNCS, 1427. pp. 88-97.

Digital Library

Cited By

Hong CLin A(2024)Regular Abstractions for Array SystemsProceedings of the ACM on Programming Languages10.1145/36328648:POPL(638-666)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632864
Baier DBeyer DChien PJakobs MJankola MKettl MLee NLemberger TLingsch-Rosenfeld MWachowitz HWendler P(2024)Software Verification with CPAchecker 3.0: Tutorial and User GuideFormal Methods10.1007/978-3-031-71177-0_30(543-570)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71177-0_30
Baier DBeyer DChien PJankola MKettl MLee NLemberger TLingsch-Rosenfeld MSpiessl MWachowitz HWendler P(2024)CPAchecker 2.3 with Strategy SelectionTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57256-2_21(359-364)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57256-2_21
Show More Cited By

Liveness Checking as Safety Checking for Infinite State Spaces
1. Software and its engineering
  1. Software organization and properties
    1. Software functional properties
      1. Formal methods
2. Theory of computation

Recommendations

LTL satisfiability checking

We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-checking benchmarks to both explicit and symbolic model checkers. For symbolic ...
Efficient reduction of finite state model checking to reachability analysis

Two types of temporal properties are usually distinguished: safety and liveness. Recently we have shown how to verify liveness properties of finite state systems using safety checking. In this article we extend the translation scheme to typical ...
Fair stateless model checking
PLDI '08

Stateless model checking is a useful state-space exploration technique for systematically testing complex real-world software. Existing stateless model checkers are limited to the verification of safety properties on terminating programs. However, ...

Comments

Information & Contributors

Information

Published In

cover image Electronic Notes in Theoretical Computer Science (ENTCS)

Electronic Notes in Theoretical Computer Science (ENTCS) Volume 149, Issue 1

February, 2006

94 pages

ISSN:1571-0661

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2006.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 February 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hong CLin A(2024)Regular Abstractions for Array SystemsProceedings of the ACM on Programming Languages10.1145/36328648:POPL(638-666)Online publication date: 5-Jan-2024
Baier DBeyer DChien PJakobs MJankola MKettl MLee NLemberger TLingsch-Rosenfeld MWachowitz HWendler P(2024)Software Verification with CPAchecker 3.0: Tutorial and User GuideFormal Methods10.1007/978-3-031-71177-0_30(543-570)Online publication date: 9-Sep-2024
Baier DBeyer DChien PJankola MKettl MLee NLemberger TLingsch-Rosenfeld MSpiessl MWachowitz HWendler P(2024)CPAchecker 2.3 with Strategy SelectionTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57256-2_21(359-364)Online publication date: 6-Apr-2024
Beyer DDangl MWendler P(2018)A Unifying View on SMT-Based Software VerificationJournal of Automated Reasoning10.1007/s10817-017-9432-660:3(299-335)Online publication date: 1-Mar-2018
Kupferman OVardi G(2018)On relative and probabilistic finite counterabilityFormal Methods in System Design10.1007/s10703-017-0277-852:2(117-146)Online publication date: 1-Apr-2018
Urabe NHara MHasuo IAceto LIngólfsdóttir A(2017)Categorical liveness checking by corecursive algebrasProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330086(1-12)Online publication date: 20-Jun-2017
Padon OHoenicke JLosa GPodelski ASagiv MShoham S(2017)Reducing liveness to safety in first-order logicProceedings of the ACM on Programming Languages10.1145/31581142:POPL(1-33)Online publication date: 27-Dec-2017
Konnov ILazić MVeith HWidder J(2017)A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithmsACM SIGPLAN Notices10.1145/3093333.300986052:1(719-734)Online publication date: 1-Jan-2017
Konnov ILazić MVeith HWidder JCastagna GGordon A(2017)A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithmsProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009860(719-734)Online publication date: 1-Jan-2017
Castagna GGordon A(2017)Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesundefinedOnline publication date: 1-Jan-2017
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents