Abstract
We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on specific tree automata techniques. In the context of rewriting logic, a Term Rewriting System is a program, and a normal form is a result of the program. Thus, approximations of sets of descendants and sets of normal forms provide tools for analysing a few properties of programs: we show how to compute a superset of results, to prove the sufficient completeness property, or to find a criterion for proving termination under a specific strategy, the sequential reduction strategy. The main technical contribution of the paper is the construction of an approximation automaton which recognises a superset of the set of normal forms of terms in a set E, w.r.t. a Term Rewriting System R.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail. In M. Bidoit and M. Dauchet, editors, Proc. 22nd CAAP Conf., Lille (France), volume 1214 of LNCS, pages 261–272. Springer-Verlag, 1997.
T. Arts and J. Giesl. Proving innermost termination automatically. In Proc. 7th RTA Conf., Sitges (Spain), volume 1232 of LNCS, pages 157–171. Springer-Verlag, 1997.
H. Comon. Sufficient completeness, term rewriting system and anti-unification. In J. Siekmann, editor, Proc. 8th CADE Conf., Oxford (UK), volume 230 of LNCS, pages 128–140. Springer-Verlag, 1986.
H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and Tommasi. Tree automata techniques and applications. Preliminary Version, http://13ux02.univ-lille3.fr/tata/, 1997.
H. Comon and J.-L. Rémy. How to characterize the language of ground normal forms. Technical Report 676, INRIA-Lorraine, 1987.
J. Coquidé, M. Dauchet, R. Gilleron, and S. Vagvölgyi. Bottom-up tree pushdown automata and rewrite systems. In R. V. Book, editor, Proc. 4th RTA Conf., Como (Italy), volume 488 of LNCS, pages 287–298. Springer-Verlag, 1991.
M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc. 5th LICS Symp., Philadelphia (Pa., USA), pages 242–248, June 1990.
N. Dershowitz and C. Hoot. Natural termination. TCS, 142(2):179–207, May 1995.
N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244–320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.
J. H. Gallier and R. V. Book. Reductions in tree replacement systems. TCS, 37:123–150, 1985.
F. Gécseg and M. Steinby. Tree automata. Akadémiai Kiadó, Budapest, Hungary, 1984.
T. Genet. Decidable approximations of sets of descendants and sets of normal forms (extended version). Technical Report RR-3325, INRIA, 1997.
T. Genet. Proving termination of sequential reduction relation using tree automata. Technical Report 97-R-091, CRIN, 1997.
T. Genet and I. Gnaedig. Termination proofs using gpo ordering constraints. In M. Dauchet, editor, Proc. 22nd CAAP Conf., Lille (France), volume 1214 of LNCS, pages 249–260. Springer-Verlag, 1997.
R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundamenta Informaticae, 24:157–175, 1995.
F. Jacquemard. Decidable approximations of term rewriting systems. In H. Ganzinger, editor, Proc. 7th RTA Conf., New Brunswick (New Jersey, USA), pages 362–376. Springer-Verlag, 1996.
D. Kapur, P. Narendran, and H. Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24:395–415, 1987.
C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., chapter 8, pages 131–158. The MIT press, 1995.
E. Kounalis. Completeness in data type specifications. In B. Buchberger, editor, Proceedings EUROCAL Conference, Linz (Austria), volume 204 of LNCS, pages 348–362. Springer-Verlag, 1985.
M. Kurihara and I. Kaji. Modular term rewriting systems and the termination. IPL, 34:1–4, Feb. 1990.
M. Kurihara and A. Ohuchi. Modular term rewriting systems with shared constructors. Journal of Information Processing of Japan, 14(3):357–358, 1991.
S. Limet and P. Réty. E-unification by means of tree tuple synchronized grammars. In M. Dauchet, editor, Proc. 22nd CAAP Conf., Lille (France), volume 1214 of LNCS, pages 429–440. Springer-Verlag, 1997.
T. Nipkow and G. Weikum. A decidability result about sufficient completeness of axiomatically specified abstract data types. In 6th GI Conference, volume 145 of LNCS, pages 257–268. Springer-Verlag, 1983.
E. Ohlebusch. Modular Properties of Composable Term Rewriting Systems. PhD thesis, Universität Bielefeld, Bielefeld, 1994.
K. Salomaa. Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. J. of Computer and System Sciences, 37:367–394, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Genet, T. (1998). Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (eds) Rewriting Techniques and Applications. RTA 1998. Lecture Notes in Computer Science, vol 1379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052368
Download citation
DOI: https://doi.org/10.1007/BFb0052368
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64301-2
Online ISBN: 978-3-540-69721-3
eBook Packages: Springer Book Archive