Static Analysis of Numerical Algorithms

DOI10.1007/11823230_3zbMATH Open1225.68073OpenAlexW1938260438MaRDI QIDQ3613375FDOQ3613375

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

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

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)

Cited In (33)

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

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)