Static Analysis of Numerical Algorithms

DOI10.1007/11823230_3MaRDI QIDQ3613375zbMATH OpenOpenAlexFDO

Authors Éric Goubault, Sylvie Putot

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

Mathematics Subject Classification ID

Roundoff error (65G50) Computer aspects of numerical algorithms (65Y99) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Interval and finite arithmetic (65G30)

Recommendations

• Static analysis of finite precision computations
• scientific article; zbMATH DE number 1948393
• Numerical Software with Result Verification
• Programming Languages and Systems
• Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic

Cited in

(33)

• Deriving numerical abstract domains via principal component analysis
• scientific article; zbMATH DE number 3947539 (Why is no real title available?)
• Non-disjunctive Numerical Domain for Array Predicate Abstraction
• Runtime abstract interpretation for numerical accuracy and robustness
• Numerical Software with Result Verification
• Acceleration of the abstract fixpoint computation in numerical program analysis
• Proving the Correctness of the Implementation of a Control-Command Algorithm
• A formally verified floating-point implementation of the compact position reporting algorithm
• A zonotopic framework for functional abstractions
• Efficient SAT-based bounded model checking for software verification
• Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic
• Automatic modular abstractions for template numerical constraints
• Modularly combining numeric abstract domains with points-to analysis, and a scalable static numeric analyzer for Java
• Static analysis of finite precision computations
• Dynamic interval analysis by abstract interpretation
• Proceedings of the 6th international workshop on numerical and symbolic abstract domains, NSAD 2016, Edinburgh, UK, September 11, 2016
• Sparsity preserving algorithms for octagons
• Interval slopes as a numerical abstract domain for floating-point variables
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Donut domains: efficient non-convex domains for abstract interpretation
• Bracketing backward reach sets of a dynamical system
• Numeric bounds analysis with conflict-driven learning
• Provably correct floating-point implementation of a point-in-polygon algorithm
• scientific article; zbMATH DE number 1746686 (Why is no real title available?)
• scientific article; zbMATH DE number 1738295 (Why is no real title available?)
• Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics
• Programming Languages and Systems
• Formal verification of numerical programs: from C annotated programs to mechanical proofs
• scientific article; zbMATH DE number 1948393 (Why is no real title available?)
• scientific article; zbMATH DE number 1832227 (Why is no real title available?)
• Polynomial function intervals for floating-point software verification
• Formal analysis of the compact position reporting algorithm

This page was built for publication: Static Analysis of Numerical Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613375)