- Record: found
- Abstract: not found
- Book Chapter: not found
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references22
- Record: found
- Abstract: not found
- Article: not found
The theory of ends, pushdown automata, and second-order logic
David Muller, Paul E. Schupp (1985)
- Record: found
- Abstract: not found
- Book Chapter: not found
Higher-Order Pushdown Trees Are Easy
Teodor Knapik, Damian Niwinski, Paweł Urzyczyn (2002)
- Record: found
- Abstract: not found
- Book Chapter: not found
A Temporal Logic of Nested Calls and Returns
Rajeev Alur, Kousha Etessami, P. Madhusudan (2004)