Summary: Proving Termination of Integer Term Rewriting
, J. Giesl1
, M. Pl¨ucker1
, P. Schneider-Kamp2
, and S. Falke3
LuFG Informatik 2, RWTH Aachen University, Germany
Dept. of Mathematics & CS, University of Southern Denmark, Odense, Denmark
CS Department, University of New Mexico, Albuquerque, NM, USA
Abstract. When using rewrite techniques for termination analysis of
programs, a main problem are pre-defined data types like integers. We
extend term rewriting by built-in integers and adapt the dependency pair
framework to prove termination of integer term rewriting automatically.
Recently, techniques and tools from term rewriting have been successfully applied
to prove termination automatically for different programming languages, cf. e.g.
[14, 27]. The advantage of rewrite techniques is that they are very powerful for al-