MOVES Seminar 12 Feb 2009, 11:00

Termination of Integer Term Rewrite Systems

 

Martin Plücker

 

Abstract:

 

 

 When analyzing termination of programs, a main problem are pre-defined
data types like integers. Approaches to analyze termination of
imperative programs have been proposed and are able to handle
integers, but they perform poorly when dealing with user-defined data
structures. In order to overcome this lack, we extend term rewrite
systems by built-in integers and Booleans and we add built-in
arithmetic, relational and Boolean operations.  This way we obtain
integer term rewrite systems (ITRSs), a formalism which is well suited
to handle user-defined data structures as well as pre-defined
integers. In this talk we show how to adapt the dependency pair
framework in order to prove termination of integer term rewriting
automatically.