International audienceWe address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exists, as the greatest fixpoint of the function that maps a set of states into its pre-image with respect to the transition relation. This definition allows to compute the weakest non-termination precondition if at least one of the following holds: (i) the transition relation is deterministic, (ii) the descending Kleene sequence over-approximating the greatest fixpoint converges in finitely many steps, or (iii) the transition relation is well founded. We show that this i...
Abstract. Proving program termination is typically done by finding a well-founded ranking function f...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
We consider the problem of deciding termination of single-path while loops with integer variables, a...
International audienceWe address the problem of conditional termination, which is that of defining t...
Abstract. This paper addresses the problem of conditional termination, which is that of defining the...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
Abstract. We describe a method for synthesizing reasonable underap-proximations to weakest precondit...
Abstract. We study the proof of a recent and relevant result about termination of programs, the Term...
International audienceWe present a new parameterized abstract domain able to refine existing numeric...
Abstract. We present a new parameterized abstract domain able to refine ex-isting numerical abstract...
This paper describes a general framework for automatic termination analysis of logic programs, where...
Abstract. We present a new method for proving liveness and termination properties for fair concurren...
Proving program termination is typically done by finding a well-founded ranking function for the pro...
Abstract. We propose a new constraint-based approach to termination analysis, applicable to Logic Pr...
Abstract. We present a new method for proving liveness and termination prop-erties for fair concurre...
Abstract. Proving program termination is typically done by finding a well-founded ranking function f...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
We consider the problem of deciding termination of single-path while loops with integer variables, a...
International audienceWe address the problem of conditional termination, which is that of defining t...
Abstract. This paper addresses the problem of conditional termination, which is that of defining the...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
Abstract. We describe a method for synthesizing reasonable underap-proximations to weakest precondit...
Abstract. We study the proof of a recent and relevant result about termination of programs, the Term...
International audienceWe present a new parameterized abstract domain able to refine existing numeric...
Abstract. We present a new parameterized abstract domain able to refine ex-isting numerical abstract...
This paper describes a general framework for automatic termination analysis of logic programs, where...
Abstract. We present a new method for proving liveness and termination properties for fair concurren...
Proving program termination is typically done by finding a well-founded ranking function for the pro...
Abstract. We propose a new constraint-based approach to termination analysis, applicable to Logic Pr...
Abstract. We present a new method for proving liveness and termination prop-erties for fair concurre...
Abstract. Proving program termination is typically done by finding a well-founded ranking function f...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
We consider the problem of deciding termination of single-path while loops with integer variables, a...