Loops under strategies

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

Volumn 5595 LNCS, Issue , 2009, Pages 17-31

  Thiemann, René ^a   Sternagel, Christian ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-SENSITIVE; DECISION PROCEDURE; TERM REWRITE SYSTEMS;

EID: 70350660913     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02348-4_2     Document Type: Conference Paper

References (17)

1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
2. Endrullis, J.: Jambox, http://joerg.endrullis.de
3. Giesl, J., Middeldorp, A.: Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming 14(4), 379-427 (2004)
4. Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 216-231. Springer, Heidelberg (2005)
5. Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic termination proofs in the DP framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS, vol. 4130, pp. 281-286. Springer, Heidelberg (2006)
6. Giesl, J., Swiderski, S., Schneider-Kamp, P., Thiemann, R.: Automated termination analysis for Haskell: From term rewriting to programming languages. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 297-312. Springer, Heidelberg (2006)
7. Guttag, J., Kapur, D., Musser, D.: On proving uniform termination and restricted termination of rewriting systems. SIAM J. Computation 12, 189-214 (1983)
8. Korp, M., Sternagel, C., Zankl, H., Middeldorp, A.: Tyrolean Termination Tool 2. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 295-304. Springer, Heidelberg (2009)
9. Kurth, W.: Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. PhD thesis, Technische Universität Clausthal, Germany (1990)
10. Lankford, D., Musser, D.: A finite termination criterion. Unpublished Draft. USC Information Sciences Institute (1978)
11. Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1, 1-61 (1998)
12. Payet, É.: Loop detection in term rewriting using the eliminating unfoldings. Theoretical Computer Science 403(2-3), 307-327 (2008)
13. Raffelsieper, M., Zantema, H.: A transformational approach to prove outermost termination automatically. In: Proc. WRS 2008. ENTCS 237, pp. 3-21 (2009)
14. Thiemann, R.: From outermost termination to innermost termination. In: Nielsen, M., et al. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 533-545. Springer, Heidelberg (2009)
15. Thiemann, R., Giesl, J., Schneider-Kamp, P.: Deciding inner most loops. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 366-380. Springer, Heidelberg (2008)
16. Waldmann, J.: Matchbox: A tool for match-bounded string rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 85-94. Springer, Heidelberg (2004)
17. Zantema, H.: Termination of string rewriting proved automatically. Journal of Automated Reasoning 34, 105-139 (2005)