MTT: The maude termination tool (system description)

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

Volumn 5195 LNAI, Issue , 2008, Pages 313-319

  Durán, Francisco ^a   Lucas, Salvador ^b   Meseguer, José ^c  

^a UNIVERSITY OF MÁLAGA   (Spain)

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

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 53049086827     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71070-7_27     Document Type: Conference Paper

References (19)

1. Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E.: ELAN from a rewriting logic point of view. Theoretical Computer Science 285, 155-185 (2002)
2. Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic Theoretical Computer Science 236, 35-132 (2000)
3. Bruni, R., Meseguer, J.: Semantic foundations for generalized rewrite theories. Theoretical Computer Science 351(1), 386-414 (2006)
4. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)
5. Durán, F., Lucas, S., Marché, C., Meseguer, J., Urbain, X.: Proving Termination of Membership Equational Programs. In: Sestoft, P., Heintze, N. (eds.) Proc. of ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, PEPM 2004, pp. 147-158. ACM Press, New York (2004)
6. Durán, F., Lucas, S., Marché, C., Meseguer, J., Urbain, X.: Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation (published online) (to appear, April 2008)
7. Durán,F., Lucas, S., Meseguer, J.: Operational Termination in Rewriting Logic Technical Report 2008 (2008), http://www.dsic.upv.es/~slucas/ tr08.pdf
8. Futatsugi, K., Diaconescu,R.: CafeOBJ Report. AMAST Series. World Scientific (1998)
9. Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE1.2. In: Furbach, U., Shankar, N. (eds.) UCAR 2006. LNCS (LNAI), vol. 4130, pp. 281-286. Springer, Heidelberg (2006), http://www-i2.informatik.rwth-aachen.de/AProVE
10. Goguen, J., Meseguer,J.: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science 105, 217-273 (1992)
11. Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998(1), 1-61 (1998)
12. Lucas, S.: Context-sensitive rewriting strategies. Information and Computation 178(1),294-343 (2002)
13. Lucas, S.: MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 200-209. Springer, Heidelberg (2004), http://www.dsic.upv.es/~slucas/csr/termination/ muterm
14. Lucas, S., Marché, C. Meseguer, J.: Operational termination of conditional term rewriting systems. Information Processing Letters 95(4), 446-453 (2005)
15. Lucas, S., Meseguer,J.: Operational Termination of Membership Equational Programs: the Order-Sorted Way. In: Rosu, G. (ed.) Proc. of the 7th International Workshop on Rewriting Logic and its Applications, WRLA 2008. Electronic Notes in Theoretical Computer Science (to appear, 2008)
16. Marché, C. Zantema, H.: The termination competition. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 303-313. Springer,Heidelberg (2007)
17. Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18-61. Springer, Heidelberg (1998)
18. Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)
19. Ölveczky, P.C., Lysne, O.: Order-Sorted Termination: The Unsorted Way. In: Hanus, M., Rodríguez-Artalejo,M. (eds.) ALP 1996. LNCS. vol. 1139, pp. 92--106. Springer, Heidelberg (1996)