We present a framework for validated numerical computations with real functions. The framework is based on a formalisation of abstract data types for basic floating-point arithmetic, interval arithmetic and function models based on banach algebra. As a concrete instantiation, we develop an elementary smooth function calculus approximated by sparse polynomial models. We demonstrate formal verification applied to validated calculus by a formalisation of basic arithmetic operations in a theorem prover. The ultimate aim is to develop a formalism powerful enough for reachability analysis of nonlinear hybrid systems
We provide a semantical framework for exact real arithmetic using linear fractional transformations ...
International audienceComputer arithmetic has applied formal methods and formal proofs for years. As...
International audienceWe describe here a representation of computable real numbers and a set of algo...
We present a framework for validated numerical computations with real functions. The framework is ba...
Abstract The focus of our work is the verification of tight functional properties of numeri-cal prog...
The notion of a real-valued function is central to mathematics, computer science, and many other sci...
We propose an arithmetic of function intervals as a basis for convenient rigorous numerical computat...
We initiate the study of regular real analysis, or the analysis of real functions that can be encode...
International audienceWe present a library to verify rigorous approximations of univariate functions...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathem...
We give a coinductive characterization of the set of continuous functions defined on a compact real ...
The focus of our work is the verification of tight functional properties of numerical programs, such...
This paper examines a calculus-based approach to building model functions in a derivative-free algor...
Rigorous numerics aims at providing certified representations for solutions of various problems, not...
We provide a semantical framework for exact real arithmetic using linear fractional transformations ...
International audienceComputer arithmetic has applied formal methods and formal proofs for years. As...
International audienceWe describe here a representation of computable real numbers and a set of algo...
We present a framework for validated numerical computations with real functions. The framework is ba...
Abstract The focus of our work is the verification of tight functional properties of numeri-cal prog...
The notion of a real-valued function is central to mathematics, computer science, and many other sci...
We propose an arithmetic of function intervals as a basis for convenient rigorous numerical computat...
We initiate the study of regular real analysis, or the analysis of real functions that can be encode...
International audienceWe present a library to verify rigorous approximations of univariate functions...
Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, in...
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathem...
We give a coinductive characterization of the set of continuous functions defined on a compact real ...
The focus of our work is the verification of tight functional properties of numerical programs, such...
This paper examines a calculus-based approach to building model functions in a derivative-free algor...
Rigorous numerics aims at providing certified representations for solutions of various problems, not...
We provide a semantical framework for exact real arithmetic using linear fractional transformations ...
International audienceComputer arithmetic has applied formal methods and formal proofs for years. As...
International audienceWe describe here a representation of computable real numbers and a set of algo...