×

Hierarchical termination revisited. (English) Zbl 1042.68602


MSC:

68Q05 Models of computation (Turing machines, etc.) (MSC2010)
68Q42 Grammars and rewriting systems
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Arts, T.; Giesl, J., Termination of term rewriting using dependency pairs, Theoret. Comput. Sci., 236, 133-178 (2000) · Zbl 0938.68051
[2] Dershowitz, N., Hierarchical termination, (Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems. Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems, Lecture Notes in Computer Science, 968 (1995), Springer: Springer Berlin), 89-105
[3] Fernández, M.; Jouannaud, J.-P., Modular termination of term rewriting systems revisited, (Recent Trends in Data Type Specification (Proceedings of the 10th Workshop on Specification of Abstract Data Types). Recent Trends in Data Type Specification (Proceedings of the 10th Workshop on Specification of Abstract Data Types), Lecture Notes in Computer Science, 906 (1995), Springer: Springer Berlin), 255-272
[4] Giesl, J.; Arts, T.; Ohlebusch, E., Modular termination proofs for rewriting using dependency pairs, J. Symbolic Comput. (2002), to appear · Zbl 1010.68073
[5] Gramlich, B., Generalized sufficient conditions for modular termination of rewriting, Appl. Algebra Engrg. Comm. Comput., 5, 131-158 (1994) · Zbl 0810.68085
[6] Gramlich, B., Abstract relations between restricted termination and confluence properties of rewrite systems, Fund. Inform., 24, 3-23 (1995) · Zbl 0839.68047
[7] Krishna Rao, M. R.K., Simple termination of hierarchical combinations of term rewriting systems, (Proceedings of the 2nd International Symposium on Theoretical Aspects of Computer Software. Proceedings of the 2nd International Symposium on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, 789 (1994), Springer: Springer Berlin), 203-223 · Zbl 0942.68593
[8] Krishna Rao, M. R.K., Modular proofs for completeness of hierarchical term rewriting systems, Theoret. Comput. Sci., 151, 487-512 (1995) · Zbl 0871.68109
[9] Middeldorp, A., Approximating dependency graphs using tree automata techniques, (Proceedings of the International Joint Conference on Automated Reasoning. Proceedings of the International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence, 2083 (2001), Springer: Springer Berlin), 593-610 · Zbl 0988.68162
[10] Ohlebusch, E., Hierarchical termination revisited. Report 01-05, Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik (2001), Universität Bielefeld · Zbl 1042.68602
[11] Urbain, X., Automated incremental termination proofs for hierarchically defined term rewriting systems, (Proceedings of the International Joint Conference on Automated Reasoning. Proceedings of the International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence, 2083 (2001), Springer: Springer Berlin), 485-499 · Zbl 0988.68094
[12] Urbain, X., Approche incrémentale des preuves automatiques de terminaison, PhD thesis (2001), Université Paris-Sud
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.