Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool (PDSolver) 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 general 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.
Unable to display preview. Download preview PDF.
- 6.Bradfield, J.C., Stirling, C.P.: Modal logics and mu-calculi: An introduction. In: Handbook of Process Algebra, pp. 293–330 (2001)Google Scholar
- 7.Hague, M., Ong, C.H.L.: A saturation method for the modal mu-calculus with backwards modalities over pushdown systems. arXiv:1006.5906v1 [cs.FL] (2010)Google Scholar
- 8.Vallée-Rai, R., Hendren, L., Sundaresan, V., Lam, P., Gagnon, E., Co, P.: Soot - a Java optimization framework. In: CASCON 1999, pp. 125–135 (1999)Google Scholar
- 9.Blackburn, S.M., et al.: The DaCapo benchmarks: Java benchmarking development and analysis. In: OOPSLA 2006, pp. 169–190 (2006)Google Scholar
- 10.Schwoon, S.: Model-checking Pushdown Systems. PhD thesis, Technical University of Munich (2002)Google Scholar
- 12.Ball, T., Rajamani, S.K.: The SLAM project: Debugging system software via static analysis. In: POPL 2002, pp. 1–3 (2002)Google Scholar