On implementing behavioral rewriting

Behavioral specification is an important algebraic method in software technology. A subtle aspect of behavioral specification is that operations may not be compatible with the behavioral (or observational) equivalence, meaning that the typical congruence inference rule may not be sound and, implicitly, that standard term rewriting cannot be used as is to execute behavioral specifications. Behavioral rewriting is an appropriate generalization of term rewriting which is already internally implemented in two behavioral specification and verification systems, CafeOBJ and BOBJ. In this paper we propose two alternative solutions to implement behavioral rewriting, on top of almost any standard term rewriting system, without modifying it internally.

[1]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[2]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[3]  Grigore Rosu,et al.  Hiding More of Hidden Algebra , 1999, World Congress on Formal Methods.

[4]  Samuel R. Buss,et al.  Incompleteness of Behavioral Logics , 2000, CMCS.

[5]  Joseph A. Goguen,et al.  Towards an Algebraic Semantics for the Object Paradigm , 1992, COMPASS/ADT.

[6]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7]  Razvan Diaconescu,et al.  Behavioural Coherence in Object-Oriented Algebraic Specification , 2000, J. Univers. Comput. Sci..

[8]  Michel Bidoit,et al.  Observer Complete Definitions are Behaviourally Coherent , 1999 .

[9]  Michel Bidoit,et al.  Observational Specifications and the Indistinguishability Assumption , 1995, Theor. Comput. Sci..

[10]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[11]  José Meseguer,et al.  Towards Behavioral Maude: Behavioral Membership Equational Logic , 2002, CMCS.

[12]  Michel Bidoit,et al.  Observational Logic , 1998, AMAST.

[13]  Razvan Diaconescu,et al.  Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification , 1998, AMAST Series in Computing.

[14]  Michaël Rusinowitch,et al.  Observational Proofs with Critical Contexts , 1998, FASE.

[15]  Michel Bidoit,et al.  Behavioural Theories and the Proof of Behavioural Properties , 1996, Theor. Comput. Sci..

[16]  Grigore Rosu,et al.  Circular coinductive rewriting , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

[17]  Grigore Rosu,et al.  Behavioral and Coinductive Rewriting , 2000, WRLA.

[18]  Rolf Hennicker,et al.  Context Induction: a Proof Principle for Behavioural Abstractions , 1990, DISCO.

[19]  HuetGérard.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980 .

[20]  Joseph A. Goguen,et al.  Hidden coinduction: behavioural correctness proofs for objects , 1999, Mathematical Structures in Computer Science.

[21]  Grigore Rosu,et al.  Hidden Congruent Deduction , 1998, FTP.

[22]  Narciso Martí-Oliet,et al.  Towards Maude 2.0 , 2000, WRLA.

[23]  Michaël Rusinowitch,et al.  Observational proofs by rewriting , 2002, Theor. Comput. Sci..