Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Proving Termination of Integer Term Rewriting , J. Giesl1
 

Summary: Proving Termination of Integer Term Rewriting
C. Fuhs1
, J. Giesl1
, M. Pl¨ucker1
, P. Schneider-Kamp2
, and S. Falke3
1
LuFG Informatik 2, RWTH Aachen University, Germany
2
Dept. of Mathematics & CS, University of Southern Denmark, Odense, Denmark
3
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.
1 Introduction
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-

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences