This paper introduces a static analysis technique for computing formally verified round-off error bounds of floating-point functional expressions. The technique is based on a denotational semantics that computes a symbolic estimation of floating-point round-o errors along with a proof certificate that ensures its correctness. The symbolic estimation can be evaluated on concrete inputs using rigorous enclosure methods to produce formally verified numerical error bounds. The proposed technique is implemented in the prototype research tool PRECiSA (Program Round-o Error Certifier via Static Analysis) and used in the verification of floating-point programs of interest to NASA
This paper proposes a technique for automaticdetection of overflow and roundoff errors, causedby the...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
Abstract. Finite precision computations can severely affect the accuracy of computed solutions. We p...
This paper presents an abstract interpretation framework for the round-off error analysis of floatin...
We present a new tool that generates bounds on the values and the round-off errors of programs using...
We present a detailed study of roundoff errors in probabilistic floating-point computations. We deri...
We present a detailed study of roundoff errors in probabilistic floating-point computations. We deri...
The aim of this thesis is to provide techniques for the abstraction of floating-point expressions in...
In this thesis we present an approach to automated verification of floating point programs. Existing...
Rigorous estimation of maximum floating-point round-off errors is an important capability central to...
Aggregated roundoff errors caused by floating-point arithmetic can make numerical code highly unreli...
In this article, we introduce a new static analysis for numerical accuracy. Weaddress the problem of...
Abstract. We introduce a concrete semantics for floating-point operations which describes the propag...
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ab...
International audienceWe report on a case study that was conducted as part of an industrial research...
This paper proposes a technique for automaticdetection of overflow and roundoff errors, causedby the...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
Abstract. Finite precision computations can severely affect the accuracy of computed solutions. We p...
This paper presents an abstract interpretation framework for the round-off error analysis of floatin...
We present a new tool that generates bounds on the values and the round-off errors of programs using...
We present a detailed study of roundoff errors in probabilistic floating-point computations. We deri...
We present a detailed study of roundoff errors in probabilistic floating-point computations. We deri...
The aim of this thesis is to provide techniques for the abstraction of floating-point expressions in...
In this thesis we present an approach to automated verification of floating point programs. Existing...
Rigorous estimation of maximum floating-point round-off errors is an important capability central to...
Aggregated roundoff errors caused by floating-point arithmetic can make numerical code highly unreli...
In this article, we introduce a new static analysis for numerical accuracy. Weaddress the problem of...
Abstract. We introduce a concrete semantics for floating-point operations which describes the propag...
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ab...
International audienceWe report on a case study that was conducted as part of an industrial research...
This paper proposes a technique for automaticdetection of overflow and roundoff errors, causedby the...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
Abstract. Finite precision computations can severely affect the accuracy of computed solutions. We p...