From outermost termination to innermost termination

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

Volumn 5404 LNCS, Issue , 2009, Pages 533-545

  Thiemann, Reňe ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EVALUATION STRATEGIES; PROGRAM VERIFICATION; TERM REWRITE SYSTEMS; TERMINATION ANALYSIS;

FUNCTIONAL PROGRAMMING;

EID: 67650706263     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-95891-8_48     Document Type: Conference Paper

References (20)

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133-178 (2000)
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
3. Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. Information and Computation 205(4), 512-534 (2007) (Pubitemid 46386374)
4. Giesl, J., Arts, T.: Verification of Erlang processes by dependency pairs. Appl. Algebra in Engineering, Communication and Computing 12(1,2), 39-72 (2001) (Pubitemid 32610954)
5. Giesl, J., Middeldorp, A.: Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming 14(4), 379-427 (2004) (Pubitemid 38874712)
6. Giesl, J., Thiemann, R., Swiderski, S., Schneider-Kamp, P.: Proving termination by bounded increase. In: Pfenning, F. (ed.) CADE 2007. LNCS, vol.4603, pp. 443-459. Springer, Heidelberg (2007) (Pubitemid 47545129)
7. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol.3452, pp. 301-331. Springer, Heidelberg (2005)
8. Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS, vol.3717, pp. 216-231. Springer, Heidelberg (2005)
9. Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS, vol.4130, pp. 281-286. Springer, Heidelberg (2006) (Pubitemid 44532680)
10. 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) (Pubitemid 44502675)
11. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37(3), 155-203 (2006) (Pubitemid 46181594)
12. Gnaedig, I., Kirchner, H.: Termination of rewriting under strategies. ACM Transactions on Computational Logic (to appear, 2008), http://tocl.acm.org/ accepted/315gnaedig.ps
13. Hirokawa, N., Middeldorp, A.: Tyrolean Termination Tool: Techniques and features. Information and Computation 205(4), 474-511 (2007) (Pubitemid 46386379)
14. Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1, 1-61 (1998)
15. Ohlebusch, E.: Termination of logic programs: Transformational methods revisited. Appl. Algebra in Eng., Communication and Computing 12(1-2), 73-116 (2001) (Pubitemid 32610955)
16. Panitz, S.E., Schmidt-Schauss, M.: TEA: Automatically proving termination of programs in a non-strict higher-order functional language. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.1302, pp. 345-360. Springer, Heidelberg (1997) (Pubitemid 127119182)
17. Plasmeijer, R., van Eekelen, M.: Functional Programming and Parallel Graph Rewriting. Addison-Wesley, Reading (1993)
18. Raffelsieper, M., Zantema, H.: A transformational approach to prove outermost termination automatically. In: Informal Proc. WRS 2008, pp. 76-89, technical report RISC-Linz 08-09 (2008), http://www.risc.uni-linz.ac.at/ publications/ download/risc 3452/wrs2008.pdf
19. Thiemann, R., Giesl, J., Schneider-Kamp, P.: Deciding innermost loops. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.5117, pp. 366-380. Springer, Heidelberg (2008)
20. Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24, 89-105 (1995)