Paper Info
Title
Program Analysis through Finite Tree Automata
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.
Year
DOI
Venue
2009
10.1007/978-3-642-02979-0_3
CIAA
Keywords
Field
DocType
finite tree automata,concurrent task,standard decision problem,decision problem,recursive procedure call,program analysis,convenient abstraction,program execution,execution tree,finite tree automaton,dynamic pushdown networks,java program
Quantum finite automata,Decision problem,Programming language,Computer science,Automaton,Theoretical computer science,Reachability,Program analysis,Java,Recursion,Incremental decision tree
Conference
Citations 
PageRank 
References 
0
0.34
7
Authors
1
Name
Order
Citations
PageRank
Helmut Seidl11468103.61