Advertisement

Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems

  • John V. Guttag
  • Deepak Kapur
  • David R. Musser
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Abstract

Starting from the seminal work of Knuth and Bendix, we develop several notions useful in the study of term rewriting systems. In particular we introduce the notions of “derived pairs” and “overlap closure” and show that they are useful in analyzing sets of rewrite rules for various properties related to termination. We also introduce a new representation, based on rewrite dominoes, for rewrite rules and sequences of rewrites.

Keywords

Transitive Closure Critical Pair Abstract Data Type Uniform Termination Major Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Dershowitz, “Termination of Linear Rewriting Systems — Preliminary Version,” in Automata, Languages, and Programming, Eighth Colloquium, Israel (Eds: S. Even and O. Kariv), LNCS 115, Springer Verlag, New York, 1981.Google Scholar
  2. J.A. Goguen and J. Tardo, “An Introduction to OBJ-T.”Proc. of Conf. on Specification of Reliable Software (1979).Google Scholar
  3. J.V. Guttag, E. Horowitz, and D.R. Musser, “Abstract Data Types and Software Validation,” Comm. A.C.M. 21 (1978), 1048–1064.MathSciNetzbMATHGoogle Scholar
  4. J.V. Guttag, D. Kapur, and D.R. Musser, On Proving Uniform Termination and Restricted Termination of Rewriting Systems, Report No. 81CRD272, G.E. C. Research and Development, Schenectady, New York, Nov. 1981.Google Scholar
  5. G. Huet, “Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,” J. ACM 27 (1980), 797–821.MathSciNetCrossRefGoogle Scholar
  6. G. Huet, D.S. Lankford, “On the Uniform Halting Problem for Term Rewriting Systems,” Rapport Laboria 283, IRIA, March, 1978.Google Scholar
  7. G. Huet, D.C. Oppen, “Equations and Rewrite Rules: a Survey,” Formal Languages Perspectives and Open Problems (R. Book, ed.), Academic Press (1980).Google Scholar
  8. D.E. Knuth, P. Bendix, “Simple Word Problems in Universal Algebra.” Computational Problems in Abstract Algebra (J. Leech, ed.), Pergamon Press (1970), 263–297.Google Scholar
  9. D. Musser, “Abstract Data Type Specification in the AFFIRM system.” IEEE Transactions on Software Engineering 6 (1980), 24–31.CrossRefGoogle Scholar
  10. G.E. Peterson and M.E. Stickel, Complete Sets of Reductions for Equational Theories With Complete Unification Algorithms, Tech. Report, Dept. of Computer Science, U. of Arizona, Tucson, Sept. 1977.Google Scholar
  11. A. Pettorossi, “Comparing and Putting Together Recursive Path Ordering, Simplification Orderings, And Non-Ascending Property for Termination Proofs of Term Rewriting Systems,” in Automata, Language, and Programming, Eighth Coll., Israel (Eds: S. Even and O. Kariv), LNCS115, Springer Verlag, New York, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • John V. Guttag
    • 1
  • Deepak Kapur
    • 2
  • David R. Musser
    • 2
  1. 1.MIT Laboratory for Computer ScienceUSA
  2. 2.General Electric Research and Development CenterUSA

Personalised recommendations