Folding variant narrowing and optimal variant termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6381 LNCS, Issue , 2010, Pages 52-68

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

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

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

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL VARIANTS; TERMINATION METHOD; UNIFICATION ALGORITHMS;

APPLICATION PROGRAMS; COMPUTATION THEORY;

COMPUTER CIRCUITS;

EID: 78349254194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16310-4_5     Document Type: Conference Paper

References (25)

1. Alpuente, M., Escobar, S., Iborra, J.: Modular termination of basic narrowing. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 1-16. Springer, Heidelberg (2008)
2. Alpuente, M., Falaschi, M., Vidal, G.: Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems 20(4), 768-844 (1998)
3. Anantharaman, S., Narendran, P., Rusinowitch, M.: Unification modulo cui plus distributivity axioms. J. Autom. Reasoning 33(1), 1-28 (2004)
4. Comon-Lundh, H., Delaune, S.: The finite variant property: How to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 294-307. Springer, Heidelberg (2005)
5. Durán, F., Lucas, S., Meseguer, J.: Termination modulo combinations of equational theories. In: Ghilardi, S. (ed.) FroCoS 2009. LNCS, vol. 5749, pp. 246-262. Springer, Heidelberg (2009)
6. Escobar, S., Meadows, C., Meseguer, J.: Maude-npa: Cryptographic protocol analysis modulo equational properties. In: FOSAD 2007. LNCS, vol. 5705, pp. 1-50. Springer, Heidelberg (2009)
7. Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153-168. Springer, Heidelberg (2007)
8. Escobar, S., Meseguer, J., Sasse, R.: Effectively checking the finite variant property. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 79-93. Springer, Heidelberg (2008)
9. Escobar, S., Meseguer, J., Sasse, R.: Variant narrowing and equational unification. Electr. Notes Theor. Comput. Sci. 238(3), 103-119 (2009)
10. Escobar, S., Meseguer, J., Thati, P.: Natural narrowing for general term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 279-293. Springer, Heidelberg (2005) (Pubitemid 41313363)
11. Giesl, J., Kapur, D.: Dependency pairs for equational rewriting. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 93-108. Springer, Heidelberg (2001)
12. Goguen, J.A., Meseguer, J.: Equality, types, modules, and (why not?) generics for logic programming. J. Log. Program. 1(2), 179-210 (1984)
13. Hanus, M.: The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming 19&20, 583-628 (1994)
14. Hölldobler, S.: Foundations of Equational Logic Programming. In: Hölldobler, S. (ed.) Foundations of Equational Logic Programming. LNCS (LNAI), vol. 353. Springer, Heidelberg (1989)
15. Hullot, J.-M.: Canonical forms and unification. In: Bibel, W., Kowalski, R.A. (eds.) CADE 1980. LNCS, vol. 87, pp. 318-334. Springer, Heidelberg (1980)
16. Jouannaud, J.-P., Kirchner, C., Kirchner, H.: Incremental construction of unification algorithms in equational theories. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 361-373. Springer, Heidelberg (1983)
17. Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM J. Comput. 15(4), 1155-1194 (1986)
18. Meseguer, J.: Conditional rewriting logic as a united model of concurrency. Theor. Comput. Sci. 96(1), 73-155 (1992)
19. Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation 20(1-2), 123-160 (2007)
20. Middeldorp, A., Hamoen, E.: Completeness results for basic narrowing. Journal of Applicable Algebra in Engineering, Communication, and Computing 5, 213-253 (1994)
21. Peterson, G.E., Stickel, M.E.: Complete sets of reductions for some equational theories. J. ACM 28(2), 233-264 (1981)
22. Ryan, P.Y.A., Schneider, S.A.: An attack on a recursive authentication protocol. a cautionary tale. Inf. Process. Lett. 65(1), 7-10 (1998)
23. TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)
24. Viola, E.: E-unifiability via narrowing. In: Restivo, A., Rocca, S.R.D., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 426-438. Springer, Heidelberg (2001)
25. Viry, P.: Equational rules for rewriting logic. Theor. Comput. Sci. 285(2), 487-517 (2002)