Languages of Nested Trees
We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown programs, so that the problem of branching-time software model checking may be phrased as a membership question for such languages. We define finite-state automata accepting such languages—these automata can pass states along jump-edges as well as tree edges. We find that the model-checking problem for these automata on pushdown systems is EXPTIME-complete, and that their alternating versions are expressively equivalent to NT-μ, a recently proposed temporal logic for nested trees that can express a variety of branching-time, “context-free” requirements. We also show that monadic second order logic (MSO) cannot exploit the structure: MSO on nested trees is too strong in the sense that it has an undecidable model checking problem, and seems too weak to capture NT-μ.
Unable to display preview. Download preview PDF.
- 1.Alur, R., Chaudhuri, S., Madhusudan, P.: A fixpoint calculus for local and global program flows. In: Proc. of POPL 2006, pp. 153–165 (2006)Google Scholar
- 2.Alur, R., Chaudhuri, S., Madhusudan, P.: Languages of nested trees. University of Pennsylvania Technical Report MS-CIS-06-10 (2006)Google Scholar
- 3.Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. of STOC 2004, pp. 202–211 (2004)Google Scholar
- 5.Ball, T., Rajamani, S.: The SLAM project: debugging system software via static analysis. In: Proc. of POPL 2002, pp. 1–3 (2002)Google Scholar
- 8.Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Draft (2003)Google Scholar
- 9.Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus, and determinacy. In: Proc. of FOCS 1991, pp. 368–377 (1991)Google Scholar
- 13.Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 263–277. Springer, Heidelberg (1996)Google Scholar
- 16.Löding, C.: Private communicationGoogle Scholar
- 18.McMillan, K.L.: Symbolic model checking: an approach to the state explosion problem. Kluwer Academic Publishers, Dordrecht (1993)Google Scholar
- 22.Reps, T., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: Proc. of POPL 1995, pp. 49–61 (1995)Google Scholar