Summary: Deaccumulation --- Improving Provability #
J˜urgen Giesl 1 , Armin K˜uhnemann 2 , and Janis Voigtl˜ander 2##
1 LuFG Informatik II, RWTH Aachen, Ahornstr. 55, D--52074 Aachen, Germany
2 Institute for Theoretical Computer Science, Department of Computer Science,
Dresden University of Technology, D--01062 Dresden, Germany
email@example.com and firstname.lastname@example.org
Abstract. Several induction theorem provers were developed to verify
functional programs mechanically. Unfortunately, automated verification
usually fails for functions with accumulating arguments. In particular,
this holds for tailrecursive functions that correspond to imperative pro
grams, but also for programs with nested recursion.
Based on results from the theory of tree transducers, we develop an au
tomatic transformation technique. It transforms accumulative functional
programs into nonaccumulative ones, which are much better suited for
automated verification by induction theorem provers. Hence, in contrast
to classical program transformations aiming at improving the e#ciency,
the goal of our deaccumulation technique is to improve the provability.
In safetycritical applications, a formal verification of programs is required.