Abstract
Recent works have proposed pushdown systems as a tool for analyzing programs with (recursive) procedures. In particular, the modelchecking problem for LTL has been studied. In this paper we examine an extension of this, namely model-checking with regular valuations. The problem is solved via two different techniques, with an eye on efficiency — both techniques can be shown to be essentially optimal. Our methods are applicable to problems in different areas, e.g., data-flow analysis, analysis of systems with checkpoints, etc., and provide a general, unifying and efficient framework for solving these problems.
This work was partially supported by the project “Advanced Validation Techniques for Telecommunication Protocols” of the Information Societies Technology Pro- gramme of the European Union.
On leave at the Institute for Informatics,TU Munich.Supported by a Research Fellowship granted by the Alexander von Humboldt Foundation and by a grant GA CR No.201/00/1023.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Ball and S.K. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN 00: SPIN Workshop, volume 1885 of LNCS, pages 113–130. Springer, 2000.
A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In Proc. CONCUR’97, LNCS 1243, pages 135–150.
O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. In Proc. ICALP’97, volume 1256 of LNCS, pages 419–429. Springer, 1997.
E.A. Emerson. Temporal and modal logic. Handbook of Theoretical Comp. Sci., B, 1991.
E.A. Emerson and C. Lei. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming, 8(3):275–306, 1987.
J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. CAV’00, LNCS 1855, pages 232–247. Springer, 2000.
J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In Proceedings of FoSSaCS’99, volume 1578 of LNCS, pages 14–30. Springer, 1999.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In Proc. CAV’01, LNCS 2102, pages 324–336. Springer, 2001.
A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science, 9, 1997.
T. Jensen, D. Le M’etayer, and T. Thorn. Verification of control flow based security properties. In IEEE Symposium on Security and Privacy, pages 89–103, 1999.
B. Steffen, A. Clasen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proceedings of CONCUR’95, volume 962 of LNCS, pages 72–87. Springer, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esparza, J., Kučera, A., Schwoon, S. (2001). Model-Checking LTL with Regular Valuations for Pushdown Systems. In: Kobayashi, N., Pierce, B.C. (eds) Theoretical Aspects of Computer Software. TACS 2001. Lecture Notes in Computer Science, vol 2215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45500-0_16
Download citation
DOI: https://doi.org/10.1007/3-540-45500-0_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42736-0
Online ISBN: 978-3-540-45500-4
eBook Packages: Springer Book Archive