Affiliations: [a] VRAIN, Universitat Politècnica de València, Valéncia, Spain. [email protected] | [b] Universidad de Guayaquil, Guayaquil, Ecuador. [email protected] | [c] VRAIN, Universitat Politècnica de València, Valéncia, Spain. [email protected] | [d] University of Illinois at Urbana-Champaign, Urbana, IL, USA. [email protected]
Correspondence:
[†]
Address for correspondence: VRAIN, Universitat Politècnica de València, Valencia, Spain
Note: [*] M. Alpuente and S. Escobar have been partially supported by the EU (FEDER) and the Spanish MCIU under grant RTI2018-094403-B-C32, by the Spanish Generalitat Valenciana under grant PROMETEO/2019/098, and by the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 952215 (TAILOR). J. Meseguer has been supported by NRL under contract number N00173-17-1-G002. A. Cuenca-Ortega has been supported by the SENESCYT, Ecuador (scholarship program 2013).
Abstract: 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.
