论文信息 - TRSPEC: A Term Rewriting Based System for Algebraic Specifications

TRSPEC: A Term Rewriting Based System for Algebraic Specifications

Term rewriting systems and methods can be used for functional programming and as a technology for program verification using the same formalism in both cases. The TRSPEC system provides tools for specifying functions by term rewriting systems and for proving (equational) properties of these functions in the corresponding initial algebra by a specialized Knuth-Bendix Completion Procedure (cf. [Mu80], [HuHu82]).Various checks of abstract specifications as well as rapid prototyping by means of a compilation into executable specifications are possible. One of the main goals of the system is to provide a suitable basis for performing experiments in order to validate new theoretical results and approaches and to identify the main problems and limits of rewriting techniques for program verification from a practical point of view.

Rüdiger Göbel | Jürgen Avenhaus | Klaus Madlener | Benjamin Benninghofen

[1] David R. Musser,et al. On proving inductive properties of abstract data types , 1980, POPL '80.

[2] Jürgen Müller,et al. Effiziente Reduktionsstrategien in Termersetzunssystemen , 1986, GWAI.

[3] Richard Göbel. Completion of Globally Finite Term Rewriting Systems for Inductive Proofs , 1985, GWAI.

[4] Hélène Kirchner,et al. Completion of a set of rules modulo a set of equations , 1984, SIAM J. Comput..

[5] Stéphane Kaplan,et al. Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[6] Pierre Lescanne,et al. An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations , 1986, CADE.

[7] Harald Ganzinger. Ground Term Confluence in Parametric Conditional Equational Specifications , 1987, STACS.

[8] Laurent Fribourg,et al. A Strong Restriction of the Inductive Completion Procedure , 1986, J. Symb. Comput..

[9] Isabelle Gnaedig,et al. Proving Termination of Associative Commutative Rewriting Systems by Rewriting , 1986, CADE.

[10] Jürgen Avenhaus. On the Descriptive Power of Term Rewriting Systems , 1986, J. Symb. Comput..

[11] Richard Göbel. Rewrite Rules with Conditions for Algebraic Specifications , 1983, ADT.

[12] Gérard P. Huet,et al. Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).