Advertisement

TRSPEC: A term rewriting based system for algebraic specifications

  • J. Avenhaus
  • R. Göbel
  • B. Gramlich
  • K. Madlener
  • J. Steinbach
Part 2 System Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 308)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ad87]
    Adler, C.: Vervollständigung von Termersetzungsystemen modulo einer gleichungsdefinierten Theorie, Diplomarbeit, FB Informatik, Universität Kaiserslautern, 1987Google Scholar
  2. [AvBeGöMa87]
    Avenhaus, J., Benninghofen, B., Göbel, R., Madlener, K.: TRSPEC: A Term Rewriting Based System for Algebraic Specifications, Proc. 8th CADE, Oxford, England, 1986Google Scholar
  3. [ChLe86]
    Cherifa, A.B., Lescanne, P.: An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations, 8th CADE, Oxford, England, 1986Google Scholar
  4. [Fr86]
    Fribourg, L.: A strong restriction of the inductive completion procedure, Proc. 13th ICALP, Rennes, France, 1986Google Scholar
  5. [Ga87]
    Ganzinger, H.: Ground term confluence in parametric conditional equational specifications, Proc. STACS '87, Passau, West Germany, 1987Google Scholar
  6. [GnLe86]
    Gnaedig, I., Lescanne, P.: Proving termination of associative commutative rewriting systems by rewriting, Proc. 8th CADE, Oxford, England, 1986Google Scholar
  7. [Gö83a]
    Göbel, R.: A Completion Procedure for Globally Finite Term Rewriting Systems, Proceedings of a NSF Workshop on the Rewrite Rule Laboratory, General Electric, Schenectady, USA, 1983Google Scholar
  8. [Gö83b]
    Göbel, R.: Rewrite Rules with Conditions for Algebraic Specifications, Proc. of 2nd Workshop on Theory and Applications of Abstract Data Types (Abstract), Passau, West Germany, 1983Google Scholar
  9. [Gö85a]
    Göbel, R.: Completion of Globally Finite TRSs for Inductive Proofs, Proc.of GWAI 85, Springer Lecture Notes, 1985Google Scholar
  10. [Gö85b]
    Göbel, R.: A Specialized Knuth-Bendix Algorithm for Inductive Proofs, Proc. Combinatorial Algorithms in Algebraic Structures, Universität Kaiserslautern, 1985Google Scholar
  11. [Gö87a]
    Göbel, R.: Ground Confluence, Proc. 2nd Int. Conf. on Rewriting Techniques and Applications, Springer LNCS, Bordeaux, France, 1987Google Scholar
  12. [Gö87b]
    Göbel, R.: Completion Methods for Obtaining Ground Confluent Rule Systems and their Applications for Inductive Proofs, Dissertation, FB Informatik, Universität Kaiserslautern, 1987Google Scholar
  13. [HuHu82]
    Huet, G., Hullot, J.: Proofs by Induction in Equational Theories with Constructors, JACM 25(2), 1982Google Scholar
  14. [JoKi84]
    Jouannaud, J.P., Kirchner, H.: Completion of a Set of Rules Modulo a Set of Equations, 11th Symp. on Principles of Programming Languages, Salt Lake City, Utah, USA, 1984Google Scholar
  15. [Ka84]
    Kaplan, S.: Conditional Rewrite Rules, Theoretical Computer Science 33, pp. 175–193, 1984CrossRefGoogle Scholar
  16. [Kü87]
    Küchlin, W.: Inductive Completion by Ground Proof Transformation, Tech. Rep. 87-08, Dept. of Computer and Information Sciences, Univ. of Delaware, 1987Google Scholar
  17. [Mu80]
    Musser, D.R.: Proving inductive properties of abstract data types, Proc. of 7th POPL, Las Vegas, Nevada, 1980Google Scholar
  18. [MüWa86]
    Müller, J., Wagner, E.: Effiziente Reduktionsstrategien in Termersetzungssytemen, GWAI 86, Springer IFB 124, 1986Google Scholar
  19. [Mü87]
    Müller, J.: THEOPOGLES: A Theorem Prover for First Order Logic Based on Rewriting Techniques, Proc. GWAI 87, to appearGoogle Scholar
  20. [Re82]
    Rémy, J.L.: Etude des Systèmes de Réécriture Conditionnelle et des Applications aux Types Abstraits, Thèse de 3ème cycle, France, 1982Google Scholar
  21. [Sa85]
    Sattler-Klein, A.: Ein benutzerfreundliches Testsystem für Reduktionsstrategien auf Wörtern, Projektarbeit, FB Informatik, Universität Kaiserslautern, 1985Google Scholar
  22. [Sa87]
    Sattler-Klein, A.: Minimierung der kritischen Paare imVervollständigungssystem COSY, Diplomarbeit, FB Informatik, Universität Kaiserslautern, 1987Google Scholar
  23. [St86]
    Steinbach, J.: Ordnungen für Termersetzungssysteme, Diplomarbeit, FB Informatik, Universität Kaiserslautern, 1986Google Scholar
  24. [Wa86]
    Wagner, E.: Strategien für den Knuth-Bendix Algorithmus, Diplomarbeit, FB Informatik, Universität Kaiserslautern, 1986Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • J. Avenhaus
    • 1
  • R. Göbel
    • 1
  • B. Gramlich
    • 1
  • K. Madlener
    • 1
  • J. Steinbach
    • 1
  1. 1.Fachbereich InformatikUniversität KaiserslauternKaiserslauternWest Germany

Personalised recommendations