Order-sorted Equational Unification Revisited

Authors:
Joe Hendrix;José Meseguer
Affiliations:
Galois, Inc, Portland, OR 97204, USA;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2012

Citing 9
Cited 3

Many-sorted unification

Journal of the ACM (JACM)
Order-sorted unification

Journal of Symbolic Computation
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Membership algebra as a logical framework for equational specification

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
CiME: Completion Modulo E

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Unification in Order-Sorted Algebras with Overloading

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer

Electronic Notes in Theoretical Computer Science (ENTCS)
Unification and Narrowing in Maude 2.4

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications

Order-sorted parameterization and induction

Semantics and algebraic specification
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Fast sort computations for order-sorted matching and unification

Formal modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of interest, using order-sorted unification over unsorted unification is able to reduce the total number of unifiers considered, and dramatically improve the performance of the Maude-NRL tool.