On equality predicates in algebraic specification languages

Authors:
Nakamura Masaki;Futatsugi Kokichi
Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology;School of Information Science, Japan Advanced Institute of Science and Technology
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 6
Cited 2

Algebraic specification

Handbook of theoretical computer science (vol. B)
Universal algebra

Handbook of logic in computer science (vol. 1)
Principles of OBJ2

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Advanced topics in term rewriting

Advanced topics in term rewriting
Algebraic Semantics of Imperative Programs

Algebraic Semantics of Imperative Programs
The Semantics of CLEAR, A Specification Language

Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School

Formal Analysis of the Bakery Protocol with Consideration of Nonatomic Reads and Writes

ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Order-Sorted equality enrichments modulo axioms

WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The execution of OBJ algebraic specification languages is based on the term rewriting system (TRS), which is an efficient theory to perform equational reasoning. We focus on the equality predicate implemented in OBJ languages. The equality predicate is used to test the equality of given terms by TRS. Unfortunately, it is well known that the current execution engine of OBJ languages with the equality predicate is not sound. To solve this problem, we define a modular term rewriting system (MTRS), which is suitable for the module system of OBJ languages, and propose a new equality predicate based on MTRS.