Analysing Mu-Calculus Properties of Pushdown Systems

Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown parity game and its adaptation to the direct computation of modal µ-calculus properties over pushdown systems. We also extend the algorithm to allow backwards, as well as forwards, modalities and allow the user to restrict the control flow graph to configurations reachable from a designated initial state. These extensions are motivated by applications in dataflow analysis. We provide two sets of experimental data. First, we obtain a picture of the asymptotic behaviour by analysing random problem instances. Secondly, we use the tool to perform dataflow analysis on real-world Java programs, taken from the DaCapo benchmark suite.

• Type: Journal
• Year: 2010
• Where: SPIN
• Authors: Matthew Hague, C.-H. Luke Ong
• Keywords: Modal µ-calculus Properties, Pushdown Parity Game, Pushdown Systems, SPIN 2010, Theoretical Computer Science