Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6

Duran, Francisco; Eker, Steven; Escobar, Santiago; Meseguer, Jose; Talcott, Carolyn

doi:10.4230/LIPIcs.RTA.2011.31

Document

Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6

Authors Francisco Duran, Steven Eker, Santiago Escobar, Jose Meseguer, Carolyn Talcott

Part of: Volume: 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (RTA 2011)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Rewriting Techniques and Applications (RTA)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2011-04-26

PDF

File

LIPIcs.RTA.2011.31.pdf

Filesize: 248 kB
10 pages

Document Identifiers

DOI: 10.4230/LIPIcs.RTA.2011.31
URN: urn:nbn:de:0030-drops-31211

Author Details

Francisco Duran

Steven Eker

Santiago Escobar

Jose Meseguer

Carolyn Talcott

Cite AsGet BibTex

Francisco Duran, Steven Eker, Santiago Escobar, Jose Meseguer, and Carolyn Talcott. Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6. In 22nd International Conference on Rewriting Techniques and Applications (RTA'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 10, pp. 31-40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.RTA.2011.31

Abstract

This paper introduces some novel features of Maude 2.6 focusing on the variants of a term. Given an equational theory (Sigma,Ax cup E), the E,Ax-variants of a term t are understood as the set of all pairs consisting of a substitution sigma and the E,Ax-canonical form of t sigma. The equational theory (Ax cup E ) has the finite variant property if there is a finite set of most general variants. We have added support in Maude 2.6 for: (i) order-sorted unification modulo associativity, commutativity and identity, (ii) variant generation, (iii) order-sorted unification modulo finite variant theories, and (iv) narrowing-based symbolic reachability modulo finite variant theories. We also explain how these features have a number of interesting applications in areas such as unification theory, cryptographic protocol verification, business processes, and proofs of termination, confluence and coherence.

Keywords

Rewriting logic
narrowing
unification
variants

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail