International audienceThe classical method for program analysis by abstract in- terpretation consists in computing a increasing sequence with widening, which converges towards a correct solution, then computing a decreasing sequence of correct solutions without widening. It is generally admit- ted that, when the decreasing sequence reaches a fixpoint, it cannot be improved further. As a consequence, all efforts for improving the pre- cision of an analysis have been devoted to improving the limit of the increasing sequence. In this paper, we propose a method to improve a fixpoint after its computation. The method consists in projecting the solution onto well-chosen components and to start again increasing and decreasing sequences from the re...
This paper presents an efficient algorithm for solving the fixpoints that arise in complex program a...
The purpose of this note is to report a new tool for discrete programming: Bound improving sequences...
FuncTion is a static analyzer designed for proving conditional termination of C programs by means of...
Abstract. The classical method for program analysis by abstract in-terpretation consists in computin...
International audienceThe classical method for program analysis by abstract interpretation consists ...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
Static analysis by abstract interpretation aims at automatically proving properties of computer prog...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
AbstractNumerical static program analyses by abstract interpretation, e.g., the problem of inferring...
Abstract. We propose a novel approach for computing weakest liberal safe pre-conditions of programs....
AbstractIn this paper, we explore the adaptation of policy iteration techniques to compute greatest ...
We propose a novel approach for computing weakest liberal safe preconditions of programs. The standa...
In this paper we present a generalization and a computational improvement of the Bound Improvement S...
This paper presents an efficient algorithm for solving the fixpoints that arise in complex program a...
The purpose of this note is to report a new tool for discrete programming: Bound improving sequences...
FuncTion is a static analyzer designed for proving conditional termination of C programs by means of...
Abstract. The classical method for program analysis by abstract in-terpretation consists in computin...
International audienceThe classical method for program analysis by abstract interpretation consists ...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
Static analysis by abstract interpretation aims at automatically proving properties of computer prog...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
AbstractNumerical static program analyses by abstract interpretation, e.g., the problem of inferring...
Abstract. We propose a novel approach for computing weakest liberal safe pre-conditions of programs....
AbstractIn this paper, we explore the adaptation of policy iteration techniques to compute greatest ...
We propose a novel approach for computing weakest liberal safe preconditions of programs. The standa...
In this paper we present a generalization and a computational improvement of the Bound Improvement S...
This paper presents an efficient algorithm for solving the fixpoints that arise in complex program a...
The purpose of this note is to report a new tool for discrete programming: Bound improving sequences...
FuncTion is a static analyzer designed for proving conditional termination of C programs by means of...