Advertisement

Program Analysis through Finite Tree Automata

  • Helmut Seidl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5642)

Abstract

Dynamic Pushdown Networks (dpn’s) have recently been introduced as a convenient abstraction of systems which provide recursive procedure calls and spawning of concurrent tasks such as Java programs [1, 4-6]. We show how the executions of dpn’s can naturally be represented through ranked trees. The configuration reached by a program execution then can be read off from the sequence of leaves of this execution tree. This observation allows us to reduce decision problems such as reachability of configurations within a regular set for dpn’s to standard decision problems for finite tree automata.

References

  1. 1.
    Bouajjani, A., Müller-Olm, M., Touili, T.: Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005, vol. 3653, pp. 473–487. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Nielson, F., Nielson, H.R., Seidl, H.: Normalizable Horn Clauses, Strongly Recognizable Relations and Spi. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002, vol. 2477, pp. 20–35. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Goubault-Larrecq, J.: Deciding \(\mathcal{\MakeUppercase{H}}_1\) by Resolution. Information Processing Letters 95(3), 401–408 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Lammich, P., Müller-Olm, M.: Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 287–302. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Lammich, P., Müller-Olm, M.: Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. P. Lammich, M. Müller-Olm, vol. 5079, pp. 205–220. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Lammich, P., Müller-Olm, M., Wenner, A.: Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints. In: Int. Conf. on Computer-Aided Verification (CAV). LNCS. Springer, Heidelberg (to appear, 2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Helmut Seidl
    • 1
  1. 1.Lehrstuhl für Informatik IITechnische Universität MünchenGarching b. MünchenGermany

Personalised recommendations