@inproceedings{eb96e541a06d4b868506e59ae466d099,
title = "On implementing behavioral rewriting",
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.",
keywords = "Behavioral rewriting, Hidden equational logic, Meta-programming, Term rewriting",
author = "Grigore Ro{\c s}u",
year = "2002",
doi = "10.1145/570186.570190",
language = "English (US)",
isbn = "1581136064",
series = "Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming",
publisher = "Association for Computing Machinery (ACM)",
pages = "43--51",
booktitle = "Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming",
address = "United States",
note = "Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming (RULE'02) ; Conference date: 05-10-2002 Through 05-10-2002",
}