skip to main content
10.1145/1190216.1190262acmconferencesArticle/Chapter ViewAbstractPublication PagespoplConference Proceedingsconference-collections
Article

On the analysis of interacting pushdown systems

Published:17 January 2007Publication History

ABSTRACT

Pushdown Systems (PDSs) have become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for sequential programs and the model checking problem for PDSs. A natural extension of this framework to the concurrent domain hinges on the, somewhat less studied, problem of model checking Interacting Pushdown Systems. In this paper, we therefore focus on the model checking of Interacting Pushdown Systems synchronizing via the standard primitives - locks, rendezvous and broadcasts, for rich classes of temporal properties - both linear and branching time. We formulate new algorithms for model checking interacting PDSs for important fragments of LTL and the Mu-Calculus. Additionally, we also delineate precisely the decidability boundary for each of the standard synchronization primitives.

References

  1. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In CONCUR, LNCS 1243, pages 135--150, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Bouajjani, J. Esparza, S. Schwoon, and J. Strejcek. Reachability analysis of multithreaded software with asynchronous communica-tion. In FSTTCS, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In IJFCS, volume 14(4), pages 551--, 2003.]]Google ScholarGoogle Scholar
  4. A. Bouajjani, M. Olm, and T. Touili. Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. In CONCUR, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Chaki, E. Clarke, N. Kidd, T.Reps, and T.Touili. Verifying concurrent message-passing c programs with recursive calls. In TACAS, 2006.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. E. A. Emerson. Temporal and Modal Logic. In Handbook of Theoretical Computer Science, Volume B, pages 997--1072, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E.A. Emerson and V. Kahlon. Model checking guarded protocols. In LICS, 2003.]]Google ScholarGoogle ScholarCross RefCross Ref
  8. J. Esparza and A. Podelski. Efficient Algorithms for pre and post on Interprocedural Parallel Flow Graphs. In POPL, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. V. Kahlon and A. Gupta. An Automata-Theoretic Approach for Model Checking Threads for LTL Properties. In LICS, 2006.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. V. Kahlon, F. Ivančić, and A. Gupta. Reasoning about threads communicating via locks. In CAV, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Lal, G. Balakrishnan, and T. Reps. Extended weighted pushdown systems. In CAV, 2005.]]Google ScholarGoogle Scholar
  12. D. Lugiez and Ph. Schnoebelen. The Regular Viewpoint on PA-Processes. In Theor. Comput. Sci., volume 274(1--2), 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Qadeer, S. K. Rajamani, and J. Rehof. Summarizing procedures in concurrent programs. In POPL, pages 245--255, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. In ACM Trans. Program. Lang. Syst., volume 22(2), pages 416--430, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. T. W. Reps, S. Schwoon, S. Jha, and D. Melski. Weighted pushdown systems and their application to interprocedural dataflow analysis. In Science of Computer Programming, volume 58(1--2), 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. I. Walukeiwicz. Model checking ctl properties of pushdown systems. In FSTTCS, LNCS 1974, pages 127--138, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the analysis of interacting pushdown systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!