Modular termination of C programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2012

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.
Fichier principal
Vignette du fichier
RR-8166.pdf (676.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00760917 , version 1 (04-12-2012)
hal-00760917 , version 2 (19-12-2012)


  • HAL Id : hal-00760917 , version 2


Guillaume Andrieu, Christophe Alias, Laure Gonnord. Modular termination of C programs. [Research Report] RR-8166, INRIA. 2012. ⟨hal-00760917v2⟩
310 View
155 Download


Gmail Facebook X LinkedIn More