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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Snyder, W.: Unification Theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 447–533. Elsevier Science Publishers, Amsterdam (2001)
Comon, H.: Intruder Theories (Ongoing Work). In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 1–4. Springer, Heidelberg (2004)
Goguen, J.A., Meseguer, J.: Order-Sorted algebra I: equational deduction for multiple inheritance, overload, exceptions and partial operations. Theoretical Computer Science 105, 217–273 (1992)
Hintermeier, C., Kirchner, C., Kirchner, H.: Dynamically-Typed Computations for Order-Sorted Equational Presentations. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 450–461. Springer, Heidelberg (1994)
Jouannaud, J.P., Kirchner, C.: Solving Equations in Abstract Algebras: A Rule- Based Survey of Unification. In: Lassez, J., Plotkin, G. (eds.) Computational Logic, Essays in Honor of Alan Robinson, vol. ch. 8, pp. 257–321. MIT Press, Cambridge (1991)
Lynch, C., Meadows, C.: Sound Approximations to Diffie-Hellman Using Rewrite Rules. In: Proceedings of the Sixth International Conference on Information and Communications Security, Malaga, Spain (October 2004)
Lynch, C., Morawska, B.: Basic Syntactic Mutation. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 471–485. Springer, Heidelberg (2002)
Meadows, C.: Analysis of the Internet Key Exchange Protocol Using the NRL Protocol Analyzer. In: Proceedings of the 1999 IEEE Symposium on Security and Privacy, May 1999, IEEE Computer Society Press, Los Alamitos (1999)
Meadows, C.: Formal Methods for Cryptographic Protocol Analysis: Emerging Issues and Trends. IEEE Journal on Selected Areas in Communication 21(1), 44–54 (2003)
Nieuwenhuis, R.: Decidability and Complexity Analysis by Basic Paramodulation. Information and Computation 147, 1–21 (1998)
Smolka, G., Nutt, W., Goguen, J.A., Meseguer, J.: Order-Sorted Equational Computation. In: Ait-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures. Rewriting Techniques, vol. 2, ch. 10, pp. 267–297. Academic Press, London (1989)
Wallner, D., Harder, E., Agee, R.C.: Key Management for Multicast: Issues and Architectures. RFC 2627 (June 1999)
Weidenbach, C.: Sorted Unification and Tree Automata. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction – A Basis for Applications. Applied Logic, vol. 1, ch. 9, pp. 291–320. Kluwer, Dordrecht (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lynch, C., Morawska, B. (2005). Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. In: Giesl, J. (eds) Term Rewriting and Applications. RTA 2005. Lecture Notes in Computer Science, vol 3467. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32033-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-32033-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25596-3
Online ISBN: 978-3-540-32033-3
eBook Packages: Computer ScienceComputer Science (R0)