Static Analysis of Numerical Algorithms
From MaRDI portal
Publication:3613375
DOI10.1007/11823230_3zbMath1225.68073OpenAlexW1938260438MaRDI QIDQ3613375
Publication date: 12 March 2009
Published in: Static Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11823230_3
Interval and finite arithmetic (65G30) Roundoff error (65G50) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computer aspects of numerical algorithms (65Y99)
Related Items (13)
Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics ⋮ Sparsity preserving algorithms for octagons ⋮ Formal verification of numerical programs: from C annotated programs to mechanical proofs ⋮ Acceleration of the abstract fixpoint computation in numerical program analysis ⋮ Polynomial function intervals for floating-point software verification ⋮ Efficient SAT-based bounded model checking for software verification ⋮ Formal analysis of the compact position reporting algorithm ⋮ A formally verified floating-point implementation of the compact position reporting algorithm ⋮ A zonotopic framework for functional abstractions ⋮ Static Analysis of Finite Precision Computations ⋮ Bracketing backward reach sets of a dynamical system ⋮ Proving the Correctness of the Implementation of a Control-Command Algorithm
This page was built for publication: Static Analysis of Numerical Algorithms
