Congruences for Visibly Pushdown Languages

  • Rajeev Alur
  • Viraj Kumar
  • P. Madhusudan
  • Mahesh Viswanathan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3580)

Abstract

We study congruences on words in order to characterize the class of visibly pushdown languages (Vpl), a subclass of context-free languages. For any language L, we define a natural congruence on words that resembles the syntactic congruence for regular languages, such that this congruence is of finite index if, and only if, L is a Vpl. We then study the problem of finding canonical minimal deterministic automata for Vpls. Though Vpls in general do not have unique minimal automata, we consider a subclass of VPAs called k-module single-entry VPAs that correspond to programs with recursive procedures without input parameters, and show that the class of well-matched Vpls do indeed have unique minimal k-module single-entry automata. We also give a polynomial time algorithm that minimizes such k-module single-entry VPAs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of STOC 2004, pp. 202–211. ACM Press, New York (2004)Google Scholar
  2. 2.
    Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 467–481. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Ball, T., Rajamani, S.: Bebop: A symbolic model checker for boolean programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol. 1885, Springer, Heidelberg (2000)CrossRefGoogle Scholar
  4. 4.
    Pitcher, C.: Visibly pushdown expression effects for XML stream processing. In: Programming Language Technologies for XML, pp. 1–14 (2005)Google Scholar
  5. 5.
    Murawski, A., Walukiewicz, I.: Third-order idealized algol with iteration is decidable. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 202–218. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Löding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 408–420. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Nerode, A.: Linear automaton transformations. In: Proc. AMS., vol. 9, pp. 541–544 (1958)Google Scholar
  8. 8.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (1979)MATHGoogle Scholar
  9. 9.
    Hopcroft, J.E.: An n logn algorithm for minimizing the states in a finite automaton. In: The Theory of Machines and Computations, pp. 189–196. Acad. Press, San Diego (1971)Google Scholar
  10. 10.
    Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T., Yannkakis, M.: Analysis of recursive state machines. ACM Transactions on Programming Languages and Systems (2005) (to appear)Google Scholar
  11. 11.
    Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. Technical Report UIUCDCS-R-2005-2565, UIUC (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Rajeev Alur
    • 1
  • Viraj Kumar
    • 2
  • P. Madhusudan
    • 2
  • Mahesh Viswanathan
    • 2
  1. 1.University of PennsylvaniaPhiladelphiaUSA
  2. 2.University of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations