Variant Narrowing and Equational Unification

Electronic Notes in Theoretical Computer Science

Volumn 238, Issue 3, 2009, Pages 103-119

  Escobar, Santiago ^a   Meseguer, José ^b   Sasse, Ralf ^b  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

cryptographic protocol analysis; Equational unification; finite variant property; narrowing; symbolic reachability analysis

Indexed keywords

CRYPTOGRAPHIC PROTOCOL ANALYSIS; EQUATIONAL UNIFICATION; FINITE VARIANT PROPERTY; NARROWING; SYMBOLIC REACHABILITY ANALYSIS;

FORMAL LOGIC; SET THEORY;

CRYPTOGRAPHY;

EID: 67649395597     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.05.015     Document Type: Article

References (23)

1. Baader F., and Snyder W. Unification theory. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning volume 1 (2001), Elsevier Science 445-532 chapter 8
2. Comon-Lundh H., and Delaune S. The finite variant property: How to get rid of some algebraic properties. In: Giesl J. (Ed). Term Rewriting and Applications, Proceedings. 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005. Lecture Notes in Computer Science volume 3467 (2005), Springer 294-307
3. Dershowitz N., and Jouannaud J.-P. Rewrite systems. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science Vol. B (1990), North-Holland 243-320
4. Dershowitz N., Mitra S., and Sivakumar G. Decidable matching for convergent systems (preliminary version). In: Kapur D. (Ed). CADE. Lecture Notes in Computer Science volume 607 (1992), Springer 589-602
5. Escobar S., Hendrix J., Meadows C., and Meseguer J. Diffie-Hellman cryptographic reasoning in the Maude-NRL Protocol Analyzer. Proc. of the Second International Workshop on Security and Rewriting Techniques (SecReT 2007) (2007)
6. Escobar S., Meadows C., and Meseguer J. A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties. Theor. Comput. Sci. 367 1-2 (2006) 162-202
7. Escobar S., Meadows C., and Meseguer J. Equational cryptographic reasoning in the Maude-NRL Protocol Analyzer. Electronic Notes in Theoretical Computer Science 171 4 (2007) 23-36
8. Escobar S., and Meseguer J. Symbolic model checking of infinite-state systems using narrowing. In: Baader F. (Ed). RTA. Lecture Notes in Computer Science volume 4533 (2007), Springer 153-168
9. S. Escobar, J. Meseguer, and R. Sasse. Variant narrowing and equational unification. Technical Report UIUCDCS-R-2007-2910, Department of Computer Science - University of Illinois at Urbana-Champaign, October 2007
10. Escobar S., Meseguer J., and Sasse R. Effectively checking the finite variant property. In: Voronkov A. (Ed). Rewriting Techniques and Applications, Proceedings. 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008. Lecture Notes in Computer Science volume 5117 (2008), Springer 79-93
11. Escobar S., Meseguer J., and Thati P. Natural narrowing for general term rewriting systems. In: Giesl J. (Ed). Term Rewriting and Applications, Proceedings. 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005. Lecture Notes in Computer Science volume 3467 (2005), Springer 279-293
12. Hanus M. Lazy narrowing with simplification. Journal of Computer Languages 23 2-4 (1997) 61-85
13. Hullot J.-M. Canonical forms and unification. In: Bibel W., and Kowalski R.A. (Eds). CADE. Lecture Notes in Computer Science volume 87 (1980), Springer 318-334
14. Jouannaud J.-P., Kirchner C., and Kirchner H. Incremental construction of unification algorithms in equational theories. In: Díaz J. (Ed). ICALP. Lecture Notes in Computer Science volume 154 (1983), Springer 361-373
15. Kapur D., and Narendran P. Matching, Unification and Complexity. ACM SIGSAM Bulletin 21 4 (1987) 6-9
16. Meseguer J. Conditioned rewriting logic as a united model of concurrency. Theor. Comput. Sci. 96 1 (1992) 73-155
17. Meseguer J. Membership algebra as a logical framework for equational specification. In: Parisi-Presicce F. (Ed). WADT. Lecture Notes in Computer Science volume 1376 (1997), Springer 18-61
18. Meseguer J., and Thati P. Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation 20 1-2 (2007) 123-160
19. S. Mitra. Semantic Unification for Convergent Rewrite Systems. PhD thesis, University Illinois at Urbana-Champaign, 1994
20. Peterson G.E., and Stickel M.E. Complete sets of reductions for some equational theories. J. ACM 28 2 (1981) 233-264
21. In: TeReSe (Ed). Term Rewriting Systems (2003), Cambridge University Press, Cambridge
22. Viola E. E-unifiability via narrowing. In: Restivo A., Rocca S.R.D., and Roversi L. (Eds). ICTCS. Lecture Notes in Computer Science volume 2202 (2001), Springer 426-438
23. Viry P. Equational rules for rewriting logic. Theor. Comput. Sci. 285 2 (2002) 487-517