V. Sabelfeld  Home/Search
Context
Related
| goethe.ira.uka.de/fsynth...Sabe00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: goethe.ira.uka.de/fsynth...Sabe00 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the paper, a complete system of transformation rules preserving the tree equivalence and a polynomial-time algorithm deciding the tree equivalence of linear polyadic recursion schemes are proposed. The algorithm is formulated as a sequential transformation process which brings together the schemes in question. In the last step, the tree equivalence problem for the given schemes is reduced to a global flow analysis problem which is solved by an efficient marking algorithm. (Update)
Active bibliography (related documents): More All
0.5: On the Equivalence of Persistent Term Rewriting Systems and.. - Khasidashvili (1993) (Correct)
0.4: Equivalent Transformations of Recursive Programs with.. - Sabelfeld, Sabelfeld (1997) (Correct)
0.4: Context-Free Languages and Pushdown Automata - Autebert, Berstel, Boasson (1997) (Correct)
Similar documents based on text: More All
0.4: Forwards and Backwards Analysis for Functional Programs - Andrei Sabelfeld (Correct)
0.1: Simple Semantic Analysis Problems for Functional Programs - Sabelfeld, Sabelfeld (Correct)
0.1: Introducing Mutual Exclusion in Esterel - Schneider, Sabelfeld (1999) (Correct)
BibTeX entry: (Update)
@article{ sabelfeld00tree,
author = "V. Sabelfeld",
title = "The tree equivalence of linear recursion schemes",
journal = "Theoretical Computer Science",
volume = "238",
number = "1--2",
pages = "1--29",
year = "2000",
url = "citeseer.ist.psu.edu/668863.html" }
Citations (may not include all citations):116 Monotone data flow analysis frameworks (context) - Kam, Ullman - 1977
82 Variations on the common subexpression problem (context) - Downey, Sethi et al. - 1980
8 The Equivalence problem for deterministic finite-turn pushdo.. (context) - Valiant - 1975
4 A representation of trees by languages (context) - Courcelle - 1978
3 On jump deterministic pushdown automata (context) - Courcelle - 1977
3 School of Engineering and Applied Science (context) - Garland, Luckham - 1971
3 An improvement on Valiant's decision procedure for equivalen.. (context) - Beeri - 1976
2 Program equivalence and context-free grammars (context) - Rosen - 1975
1 unpublished report (context) - deBakker, Scott - 1969
1 Equivalent Transformations of Recursion Schemes and Admissib.. (context) - Sabelfeld - 1993
1 Decision procedures for families of deterministic pushdown a.. (context) - Valiant - 1973
1 DPDA's in 'Atomic normal form` and applications to equivalen.. (context) - Gallier - 1981
1 Tree equivalence of linear recursive schemata is polynomialt.. (context) - Sabelfeld - 1981
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC