Order-sorted equality enrichments modulo axioms

Raúl Gutiérrez, José Meseguer, Camilo Rocha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Built-in equality and inequality predicates based on comparison of canonical forms in algebraic specifications are frequently used because they are handy and efficient. However, their use places algebraic specifications with initial algebra semantics beyond the pale of theorem proving tools based, for example, on explicit or inductionless induction techniques, and of other formal tools for checking key properties such as confluence, termination, and sufficient completeness. Such specifications would instead be amenable to formal analysis if an equationally-defined equality predicate enriching the algebraic data types were to be added to them. Furthermore, having an equationally-defined equality predicate is very useful in its own right, particularly in inductive theorem proving. Is it possible to effectively define a theory transformation ε → ε that extends an algebraic specification ε to a specification ε having an equationally-defined equality predicate? This paper answers this question in the affirmative for a broad class of order-sorted conditional specifications ε that are sort-decreasing, ground confluent, and operationally terminating modulo axioms B and have a subsignature of constructors. The axioms B can consist of associativity, or commutativity, or associativity-commutativity axioms, so that the constructors are free modulo B. We prove that the transformation ε → ε preserves all the just-mentioned properties of ε. The transformation has been automated in Maude using reflection and is used in several Maude formal tools.

Original languageEnglish (US)
Title of host publicationRewriting Logic and Its Applications - 9th International Workshop, WRLA 2012, Held as a Satellite Event of ETAPS, Revised Selected Papers
Pages162-181
Number of pages20
DOIs
StatePublished - 2012
Event9th International Workshop on Rewriting Logic and Its Applications, WRLA 2012, Held as a Satellite Event of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012 - Tallinn, Estonia
Duration: Mar 24 2012Mar 25 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7571 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Workshop on Rewriting Logic and Its Applications, WRLA 2012, Held as a Satellite Event of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012
CountryEstonia
CityTallinn
Period3/24/123/25/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Order-sorted equality enrichments modulo axioms'. Together they form a unique fingerprint.

  • Cite this

    Gutiérrez, R., Meseguer, J., & Rocha, C. (2012). Order-sorted equality enrichments modulo axioms. In Rewriting Logic and Its Applications - 9th International Workshop, WRLA 2012, Held as a Satellite Event of ETAPS, Revised Selected Papers (pp. 162-181). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7571 LNCS). https://doi.org/10.1007/978-3-642-34005-5_9