A Transformational Approach to Prove Outermost Termination Automatically

Electronic Notes in Theoretical Computer Science

Volumn 237, Issue C, 2009, Pages 3-21

  Raffelsieper, Matthias ^a   Zantema, Hans ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

NON-TRIVIAL; TRANSFORMATIONAL APPROACHES;

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

References (17)

1. Baader F., and Nipkow T. Term Rewriting and All That (1998), Cambridge University Press, Cambridge, UK
2. Clavel, M., F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer and C. Talcott, The Maude 2.0 System, in: Proceedings of the 14th Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 2706 (2003), pp. 76-87
3. Endrullis, J., Jambox 2.0e, downloadable from http://joerg.endrullis.de
4. Futatsugi K., and Diaconescu R. CafeOBJ Report (1998), World Scientific Publishing Company
5. Giesl J., and Middeldorp A. Transformation Techniques for Context-Sensitive Rewrite Systems. Journal of Functional Programming 14 (2004) 379-427
6. Giesl, J., P. Schneider-Kamp and R. Thiemann, AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework, in: Proceedings of the 3rd International Joint Conference on Automatic Reasoning, Lecture Notes in Computer Science 4130 (2006), pp. 281-286, downloadable from http://aprove.informatik.rwth-aachen.de
7. Giesl, J., S. Swiderski, P. Schneider-Kamp and R. Thiemann, Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages, in: Proceedings of the 17th Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 4098, 2006, pp. 297-312
8. Giesl, J. and H. Zantema, Liveness in Rewriting, in: Proceedings of the 14th Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 2706 (2003), pp. 321-336
9. Gnaedig, I. and H. Kirchner, Termination of rewriting under strategies, ACM Transactions on Computational Logic (2007), to appear, available at http://tocl.acm.org/accepted/315gnaedig.ps
10. Huet G. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. J. ACM 27 (1980) 797-821
11. In: Jones S.P. (Ed). Haskell 98 Language and Libraries: The Revised Report (2003), Cambridge University Press. http://www.haskell.org/definition also available from
12. Kirchner, C., R. Kopetz and P.-E. Moreau, Anti-Pattern Matching, in: Proceedings of the 16th European Symposium on Programming, Lecture Notes in Computer Science 4421 (2007), pp. 110-124
13. Korp, M., C. Sternagel, H. Zankl and A. Middeldorp, Tyrolean Termination Tool 2 (TTT2), downloadable from http://colo6-c703.uibk.ac.at/ttt2
14. Lassez J.-L., and Marriot K. Explicit Representation of Terms Defined by Counter Examples. Journal of Automated Reasoning 3 (1987) 301-317
15. Marché, C. and H. Zantema, The Termination Competition, in: Proceedings of the 18th Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 4533 (2007), pp. 303-313, see also http://www.lri.fr/~marche/termination-competition
16. Panitz, S.E. and M. Schmidt-Schauss, TEA: Automatically proving termination of programs in a non-strict higher order functional language, in: Proceedings of the 4th International Symposium on Static Analysis, Lecture Notes in Computer Science 1302, 1997, pp. 345-360
17. Terese. Term Rewriting Systems (2003), Cambridge University Press, Cambridge, UK