International audienceWe report on a case study that was conducted as part of an industrial research project on static analysis of critical C code. The example program considered in this paper is an excerpt of an industrial code, only slightly modified for confidentiality reasons, involving floating-point computations. The objective was to establish a property on the functional behavior of this code, taking into account rounding errors made during computations. The property is formalized using ACSL, the behavioral specification language available inside the Frama-C environment, and it is verified by automated theorem proving
Abstract. Finite precision computations can severely affect the accuracy of computed solutions. We p...
This paper introduces a static analysis technique for computing formally verified round-off error bo...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
International audienceWe report on a case study that was conducted as part of an industrial research...
This paper presents an implementation of an extension of the ACSL specication language in the Frama-...
International audienceIn the context of deductive program verification, supporting floatingpoint com...
International audienceNumerical programs may require a high level of guarantee. This can be achieved...
International audienceOn certain recently developed architectures, a numerical program may give diff...
In this thesis we present an approach to automated verification of floating point programs. Existing...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
International audienceHigh confidence in floating-point programs requires proving numerical properti...
Verification of programs using floating-point arithmetic is challenging on several accounts. One of ...
On recent architectures, a numerical program may give different answers depending on the execution h...
Abstract. Finite precision computations can severely affect the accuracy of computed solutions. We p...
This paper introduces a static analysis technique for computing formally verified round-off error bo...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
International audienceWe report on a case study that was conducted as part of an industrial research...
This paper presents an implementation of an extension of the ACSL specication language in the Frama-...
International audienceIn the context of deductive program verification, supporting floatingpoint com...
International audienceNumerical programs may require a high level of guarantee. This can be achieved...
International audienceOn certain recently developed architectures, a numerical program may give diff...
In this thesis we present an approach to automated verification of floating point programs. Existing...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
International audienceHigh confidence in floating-point programs requires proving numerical properti...
Verification of programs using floating-point arithmetic is challenging on several accounts. One of ...
On recent architectures, a numerical program may give different answers depending on the execution h...
Abstract. Finite precision computations can severely affect the accuracy of computed solutions. We p...
This paper introduces a static analysis technique for computing formally verified round-off error bo...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...