Fuhs, Carsten
[Author];
Giesl, Jürgen
[Author];
Plücker, Martin
[Author];
Schneider-Kamp, Peter
[Author];
Falke, Stephan
[Author]
;
Carsten Fuhs and Jürgen Giesl and Martin Plücker and Peter Schneider-Kamp and Stephan Falke
[Contributor]
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
Recently, techniques and tools from term rewriting have been successfully applied to prove termination automatically for different programming languages. The advantage of rewrite techniques is that they are very powerful for algorithms on user-defined data structures. But in contrast to techniques for termination analysis of imperative programs, the drawback of rewrite techniques is that they do not support data structures like integer numbers which are pre-defined in almost all programming languages. To solve this problem, we extend term rewriting by built-in integers and adapt the dependency pair framework to prove termination of integer term rewriting automatically. Our experiments show that this indeed combines the power of rewrite techniques on user-defined data types with a powerful treatment of pre-defined integers.