Faster basic syntactic mutation with sorts for some separable equational theories

Authors:
Christopher Lynch;Barbara Morawska
Affiliations:
Department of Computer Science, Clarkson University, Potsdam, NY;Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany
Venue:
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Year:
2005

Citing 5
Cited 0

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

Theoretical Computer Science
Decidability and complexity analysis by basic paramodulation

Information and Computation
Dynamically-Typed Computations for Order-Sorted Equational Presentations

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Basic Syntactic Mutation

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Formal methods for cryptographic protocol analysis: emerging issues and trends

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sorting information arises naturally in E-unification problems. This information is used to rule out invalid solutions. We show how to use sorting information to make E-unification procedures more efficient. We illustrate our ideas using Basic Syntactic Mutation. We give classes of problems where E-unification becomes polynomial. We show how E-unification can be separated into a polynomial part and a more complicated part using a specialized algorithm. Our approach is motivated by a real problem arising from Cryptographic Protocol Verification.