Numerical algorithms lie at the heart of many safety-critical aerospace systems. The complexity and hybrid nature of these systems often requires the use of interactive theorem provers to verify that these algorithms are logically correct. Usually, proofs involving numerical computations are conducted in the infinitely precise realm of the field of real numbers. However, numerical computations in these algorithms are often implemented using floating point numbers. The use of a finite representation of real numbers introduces uncertainties as to whether the properties veri ed in the theoretical setting hold in practice. This short paper describes work in progress aimed at addressing these concerns. Given a formally proven algorithm, written ...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
Floating-point computations are quickly finding their way in the design of safety- and mission-crit...
In the following basic principles of algorithms computing guaranteed bounds are developed from a the...
In this thesis we present an approach to automated verification of floating point programs. Existing...
International audienceNumerical programs may require a high level of guarantee. This can be achieved...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
On recent architectures, a numerical program may give different answers depending on the execution h...
Methods are investigated for formally specifying and verifying the correctness of mathematical softw...
Verification of programs using floating-point arithmetic is challenging on several accounts. One of ...
Verification of programs using floating-point arithmetic is challenging on several accounts. One of ...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
International audienceWe report on a case study that was conducted as part of an industrial research...
International audienceOn certain recently developed architectures, a numerical program may give diff...
International audienceOn recent architectures, a numerical program may give different answers depend...
Floating-point computations are quickly finding their way in the design of safety- and mission-crit...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
Floating-point computations are quickly finding their way in the design of safety- and mission-crit...
In the following basic principles of algorithms computing guaranteed bounds are developed from a the...
In this thesis we present an approach to automated verification of floating point programs. Existing...
International audienceNumerical programs may require a high level of guarantee. This can be achieved...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
On recent architectures, a numerical program may give different answers depending on the execution h...
Methods are investigated for formally specifying and verifying the correctness of mathematical softw...
Verification of programs using floating-point arithmetic is challenging on several accounts. One of ...
Verification of programs using floating-point arithmetic is challenging on several accounts. One of ...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
International audienceWe report on a case study that was conducted as part of an industrial research...
International audienceOn certain recently developed architectures, a numerical program may give diff...
International audienceOn recent architectures, a numerical program may give different answers depend...
Floating-point computations are quickly finding their way in the design of safety- and mission-crit...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
Floating-point computations are quickly finding their way in the design of safety- and mission-crit...
In the following basic principles of algorithms computing guaranteed bounds are developed from a the...