Add to ORKGIn 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
We propose a modular method for proving termination of general logic programs (i.e. logic programs w...
We propose a modular method for proving termination of general logic programs (i.e., logic programs ...
In an earlier work with Neil D.~Jones, we proposed the ``size-change principle'' for program termin...
In this paper we describe a general method to prove termination of C programs in a scalable and modu...
International audienceIn this talk, we present Stop, which implements a general method to prove term...
Non-termination is the root cause of a variety of program bugs, such as hanging programs and denial...
Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging...
Abstract—Proving program termination is key to guaranteeing absence of undesirable behaviour, such a...
Abstract. We present a novel technique for proving program termination which introduces a new dimens...
Modeling the semantics of programming languages like C for the automated termination analysis of pro...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
We study the problem of proving termination of open, higher-order programs with recursive functions ...
Modularity is essential in software development, where a piece of software is often designed and imp...
Cette thèse propose une étude de la terminaison dans les systèmes concurrents. La terminaison est un...
We propose a modular method for proving termination of general logic programs (i.e. logic programs w...
We propose a modular method for proving termination of general logic programs (i.e., logic programs ...
In an earlier work with Neil D.~Jones, we proposed the ``size-change principle'' for program termin...
In this paper we describe a general method to prove termination of C programs in a scalable and modu...
International audienceIn this talk, we present Stop, which implements a general method to prove term...
Non-termination is the root cause of a variety of program bugs, such as hanging programs and denial...
Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging...
Abstract—Proving program termination is key to guaranteeing absence of undesirable behaviour, such a...
Abstract. We present a novel technique for proving program termination which introduces a new dimens...
Modeling the semantics of programming languages like C for the automated termination analysis of pro...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
We study the problem of proving termination of open, higher-order programs with recursive functions ...
Modularity is essential in software development, where a piece of software is often designed and imp...
Cette thèse propose une étude de la terminaison dans les systèmes concurrents. La terminaison est un...
We propose a modular method for proving termination of general logic programs (i.e. logic programs w...
We propose a modular method for proving termination of general logic programs (i.e., logic programs ...
In an earlier work with Neil D.~Jones, we proposed the ``size-change principle'' for program termin...