EPiC series in computing · 2018 · 39 citations · 29 references
ComputingComputer ScienceAlgorithmsFormal MethodsTheory Of ComputationData-flow AnalysisNumerical AnalysisFormal VerificationGuaranteed Upper BoundsInput VariablesInterval AnalysisInterval Arithmetic
Tool Presentation: Computing guaranteed bounds of function outputs when their input variables are bounded by intervals is an essential technique for many formal methods. Due to the importance of bounding function outputs, several techniques have been proposed for this problem, such as interval arithmetic, affine arithmetic, and Taylor models. While all methods provide guaranteed bounds, it is typically unknown to a formal verification tool which approach is best suitable for a given problem. For this reason, we present an implementation of the aforementioned techniques in our MATLAB tool CORA so that advantages and disadvantages of different techniques can be quickly explored without hav- ing to compile code. In this work we present the implementation of Taylor models and affine arithmetic; our interval arithmetic implementation has already been published. We evaluate the performance of our implementation using a set of benchmarks against Flow* and INTLAB. To the best of our knowledge, we have also evaluated for the first time how a combination of interval arithmetic and Taylor models performs: our results indicate that this combination is faster and more accurate than only using Taylor models.
29
Numerical Recipes: The Art of Scientific Computing
Eric R. Ziegel, William H. Press, Brian P. Flannery et al. · Technometrics · 1987 · 4.6K citations
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
Global Optimization Using Interval Analysis.
Arnold Neumaier, Eldon Hansen · Mathematics of Computation · 1994 · 985 citations