Skip to main content
SpringerLink
Log in

Reachability analysis of pushdown automata: Application to model-checking

  • Contributions
  • Conference paper
  • First Online:
Book cover CONCUR '97: Concurrency Theory (CONCUR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1243))

Included in the following conference series:

Abstract

We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finite-state automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (such as model-checking for branching-time logics), we consider the more general class of alternating pushdown systems and use alternating finite-state automata as a representation structure for sets of their configurations. We give a simple and natural procedure to compute sets of predecessors using this representation structure. We incorporate this procedure into the automata-theoretic approach to model-checking to define new model-checking algorithms for pushdown systems against both linear and branching-time properties. From these results we derive upper bounds for several model-checking problems as well as matching lower bounds.

Supported by the University Joseph Fourier (Grenoble I) and by Teilprojekt A3 of the Sonderforschungsbereich 342.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1976.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The Algorithmic Analysis of Hybrid Systems. TCS, 138, 1995.

    Google Scholar 

  3. R. Alur and D. Dill. A Theory of Timed Automata. TCS, 126, 1994.

    Google Scholar 

  4. E. Asarin, O. Maler, and A. Pnueli. Symbolic Controller Synthesis for Discrete and Timed Systems. In Hybrid Systems II. LNCS 999, 1995.

    Google Scholar 

  5. B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In CAV'96. LNCS 1102, 1996.

    Google Scholar 

  6. R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, 1993.

    Google Scholar 

  7. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. Tech. Rep. Verimag, 1997. ftp://ftp.imag.fr/imag/SPECTRE/ODED/pda.ps.gz, http://papa.informatik.tu-muenchen.de/forschung/sfb342_a3/refs.html.

    Google Scholar 

  8. A. Bouajjani and O. Maler. Reachability Analysis of Pushdown Automata. In Infinity'96. tech. rep. MIP-9614, Univ. Passau, 1996.

    Google Scholar 

  9. J.C. Bradfield. Verifying Temporal Properties of Systems. Birkhauser, 1992.

    Google Scholar 

  10. R. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24, 1992.

    Google Scholar 

  11. O. Burkart and B. Steffen. Model Checking for Context-Free Processes. In CONCUR'92, 1992. LNCS 630.

    Google Scholar 

  12. O. Burkart and B. Steffen. Composition, Decomposition and Model-Checking of Pushdown Processes. Nordic Journal of Computing, 2, 1995.

    Google Scholar 

  13. E.M. Clarke, E.A. Emerson, and E. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications: A Practical Approach. In POPL'83. ACM, 1983.

    Google Scholar 

  14. E.A. Emerson. Automated Temporal Reasoning about Reactive Systems. In Logics for Concurrency. LNCS 1043, 1996.

    Google Scholar 

  15. A. Finkel, B. Willems, and P. Wolper. A Direct Symbolic Approach to Model Checking Pushdown Systems. In Personal communication, 1997.

    Google Scholar 

  16. G. Holzmann. Basic SPIN manual. Technical report, Bell Laboratories, 1994.

    Google Scholar 

  17. K.L. McMillan. Symbolic Model-Checking: an Approach to the State-Explosion Problem. Kluwer, 1993.

    Google Scholar 

  18. A. Pnueli. The Temporal Logic of Programs. In FOCS'77. IEEE, 1977.

    Google Scholar 

  19. M.Y. Vardi. A Temporal Fixpoint Calculus. In POPL'88. ACM, 1988.

    Google Scholar 

  20. M.Y. Vardi. Alternating Automata and Program Verification. In Computer Science Today. LNCS 1000, 1995.

    Google Scholar 

  21. M.Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In LICS'86. IEEE, 1986.

    Google Scholar 

  22. I. Walukiewicz. Pushdown Processes: Games and Model Checking. In CAV'96. LNCS 1102, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre Equation, Verimag, 2 av. de Vignate, 38610, Gières, France

    Ahmed Bouajjani & Oded Maler

  2. Inst. für Informatik, Tech. Univ. München, Arcisstr. 21, 81539, München, Germany

    Javier Esparza

Authors
  1. Ahmed Bouajjani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Oded Maler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz Józef Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouajjani, A., Esparza, J., Maler, O. (1997). Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-63141-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63141-5

  • Online ISBN: 978-3-540-69188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation