Skip to main navigation Skip to search Skip to main content

Static analysis of numerical algorithms

  • Institut Pierre Simon Laplace, CNRS and CEA

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

94 Citations (Scopus)

Abstract

We present a new numerical abstract domain for static analysis of the errors introduced by the approximation by floating-point arithmetic of real numbers computation, by abstract interpretation [3]. This work extends a former domain [4,8], with an implicitly relational domain for the approximation of the floating-point values of variables, based on affine arithmetic [2]. It allows us to analyze non trivial numerical computations, that no other abstract domain we know of can analyze with such precise results, such as linear recursive filters of different orders, Newton methods for solving non-linear equations, polynomial iterations, conjugate gradient algorithms.

Original languageEnglish
Title of host publicationStatic Analysis - 13th International Symposium, SAS 2006, Proceedings
PublisherSpringer Verlag
Pages18-34
Number of pages17
ISBN (Print)3540377565, 9783540377566
DOIs
Publication statusPublished - 1 Jan 2006
Externally publishedYes
Event13th International Symposium on Static Analysis, SAS 2006 - Seoul, Korea, Republic of
Duration: 29 Aug 200631 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4134 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Symposium on Static Analysis, SAS 2006
Country/TerritoryKorea, Republic of
CitySeoul
Period29/08/0631/08/06

Fingerprint

Dive into the research topics of 'Static analysis of numerical algorithms'. Together they form a unique fingerprint.

Cite this