Helmut Seidl. Program Analysis through Finite Tree Automata. In Sebastian Maneth, editor, Implementation and Application of Automata, volume 5642 of Lecture Notes in Computer Science, pages 3, Sydney, Australia, July 2009. Springer.

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.

Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com