Skip to Main content Skip to Navigation
New interface
Conference papers

SToP : Scalable Termination analysis of (C) Programs (tool presentation)

Guillaume Andrieu 1 Christophe Alias 2, * Laure Gonnord 1, 3, 4 
* Corresponding author
2 COMPSYS - Compilation and embedded computing systems
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 LIFL - DART/Émeraude
LIFL - Laboratoire d'Informatique Fondamentale de Lille
4 DART - Contributions of the Data parallelism to real time
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : In this talk, we present Stop, which implements 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 (\cite{compsys-termination-sas10}) and preliminary results shows the feasibility of the method.
Document type :
Conference papers
Complete list of metadata
Contributor : Laure Gonnord Connect in order to contact the contributor
Submitted on : Tuesday, December 4, 2012 - 3:38:53 PM
Last modification on : Tuesday, October 25, 2022 - 4:21:52 PM


  • HAL Id : hal-00760926, version 1


Guillaume Andrieu, Christophe Alias, Laure Gonnord. SToP : Scalable Termination analysis of (C) Programs (tool presentation). Tapas 2012, Sep 2012, Deauville, France. ⟨hal-00760926⟩



Record views