International audienceWe present a static analysis for software patches. Given two syntactically close versions of a program, our analysis can infer a semantic difference, and prove that both programs compute the same outputs when run on the same inputs. Our method is based on abstract interpretation, and parametric in the choice of an abstract domain. We focus on numeric properties only. Our method is able to deal with unbounded executions of infinite-state programs, reading from infinite input streams. Yet, it is limited to comparing terminating executions, ignoring non terminating ones.We first present a novel concrete collecting semantics, expressing the behaviors of both programs at the same time. Then, we propose an abstraction of inf...
The aim of this thesis is to provide techniques for the abstraction of floating-point expressions in...
As software systems grow in complexity, they become difficult to manage. This applies to both develope...
Computer programs are rarely written in one fell swoop. Instead, they are written in a series of inc...
International audienceWe present work in progress on the static analysis of software patches. Given ...
We want to prove that a static analysis of a given program is complete, namely, no imprecision arise...
International audienceThe aim of static analysis is to infer invariants about programs that are tigh...
AbstractThe “right” way of writing and structuring compilers is well-known. The situation is a bit l...
International audienceOn certain recently developed architectures, a numerical program may give diff...
The goal of this thesis is to design techniques related to the automatic analysis of computer progra...
International audienceTwo programs are mutually equivalent if, for the same input, either they both ...
Automatically proving that (infinite-state) software programs satisfy a specification is an importan...
We show that abstract interpretation-based static program analysis can be made ecient and precise en...
International audienceIn this document, we use the Abstract Interpretation framework to analyze conc...
International audienceWe present a new algorithm for the construction of a correlating program from ...
Regression verification techniques are used to prove equivalence of syntactically similar programs. ...
The aim of this thesis is to provide techniques for the abstraction of floating-point expressions in...
As software systems grow in complexity, they become difficult to manage. This applies to both develope...
Computer programs are rarely written in one fell swoop. Instead, they are written in a series of inc...
International audienceWe present work in progress on the static analysis of software patches. Given ...
We want to prove that a static analysis of a given program is complete, namely, no imprecision arise...
International audienceThe aim of static analysis is to infer invariants about programs that are tigh...
AbstractThe “right” way of writing and structuring compilers is well-known. The situation is a bit l...
International audienceOn certain recently developed architectures, a numerical program may give diff...
The goal of this thesis is to design techniques related to the automatic analysis of computer progra...
International audienceTwo programs are mutually equivalent if, for the same input, either they both ...
Automatically proving that (infinite-state) software programs satisfy a specification is an importan...
We show that abstract interpretation-based static program analysis can be made ecient and precise en...
International audienceIn this document, we use the Abstract Interpretation framework to analyze conc...
International audienceWe present a new algorithm for the construction of a correlating program from ...
Regression verification techniques are used to prove equivalence of syntactically similar programs. ...
The aim of this thesis is to provide techniques for the abstraction of floating-point expressions in...
As software systems grow in complexity, they become difficult to manage. This applies to both develope...
Computer programs are rarely written in one fell swoop. Instead, they are written in a series of inc...