On the analysis of interacting pushdown systems

Vineet Kahlon, Aarti Gupta

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)303-314
Number of pages12
JournalACM SIGPLAN Notices
Issue number1
StatePublished - Jan 2007

All Science Journal Classification (ASJC) codes

  • General Computer Science


  • Concurrency
  • Dataflow analysis
  • LTL
  • Model checking
  • Mu-Calculus
  • Pushdown systems


Dive into the research topics of 'On the analysis of interacting pushdown systems'. Together they form a unique fingerprint.

Cite this