论文信息 - Modular termination of C programs

Modular termination of C programs

In this paper we describe a general method to prove termination of C programs in a scalable and modular way. The program to analyse is reduced to the smallest relevant subset through a termination-specific slicing technique. Then, the program is divided into pieces of code that are analysed separately, thanks to an external engine for termination. The result is implemented in the prototype \stoptool over our previous toolsuite WTC [compsys-termination-sas10] and preliminary results shows the feasibility of the method.

Laure Gonnord | Guillaume Andrieu | Christophe Alias

[1] Tomás Vojnar,et al. Proving Termination of Tree Manipulating Programs , 2007, ATVA.

[2] Frank Tip,et al. A survey of program slicing techniques , 1994, J. Program. Lang..

[3] Wolfram Amme,et al. Data Dependence Analysis in Programs with Pointers , 1998, Parallel Comput..

[4] Andreas Podelski,et al. A Complete Method for the Synthesis of Linear Ranking Functions , 2004, VMCAI.

[5] Sumit Gulwani,et al. Proving Conditional Termination , 2008, CAV.

[6] Paul Feautrier,et al. Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs , 2010, SAS.

[7] Henny B. Sipma,et al. Practical Methods for Proving Program Termination , 2002, CAV.

[8] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[9] Henny B. Sipma,et al. Linear Ranking with Reachability , 2005, CAV.

[10] Daniel J. Quinlan. ROSE: Compiler Support for Object-Oriented Frameworks , 2000, Parallel Process. Lett..

[11] Paul Feautrier,et al. Accelerated Invariant Generation for C Programs with Aspic and C2fsm , 2010, Electron. Notes Theor. Comput. Sci..

[12] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.