Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms

María Alpuente, Angel Cuenca-Ortega, Santiago Escobar, José Meseguer

Research output: Contribution to journalArticlepeer-review


The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context of order-sorted rewrite theories that support symbolic execution methods modulo equational axioms. This paper generalizes the symbolic homeomorphic embedding relation to order-sorted rewrite theories that may contain various combinations of associativity and/or commutativity axioms for different binary operators. We systematically measure the performance of different, increasingly efficient formulations of the homeomorphic embedding relation modulo axioms that we implement in Maude. Our experimental results show that the most efficient version indeed pays off in practice.

Original languageEnglish (US)
Pages (from-to)297-329
Number of pages33
JournalFundamenta Informaticae
Issue number3-4
StatePublished - 2020


  • Maude
  • homeomorphic embedding
  • rewriting logic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics


Dive into the research topics of 'Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms'. Together they form a unique fingerprint.

Cite this