On implementing behavioral rewriting

Authors:
Grigore Rosu
Affiliations:
University of Illinois at Urbana-Champaign
Venue:
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Year:
2002

Citing 8
Cited 1

Observational specifications and the indistinguishability assumption

Theoretical Computer Science
Behavioural theories and the proof of behavioural properties

ALP Proceedings of the fourth international conference on Algebraic and logic programming
Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
A hidden agenda

Theoretical Computer Science
Observational proofs by rewriting

Theoretical Computer Science
Circular Coinductive Rewriting

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Hidden coinduction: behavioural correctness proofs for objects

Mathematical Structures in Computer Science

Behavioral abstraction is hiding information

Theoretical Computer Science - Selected papers of CMCS'03

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.