Perturbed affine arithmetic for invariant computation in numerical program analysis
Logic in Computer Science
2008-07-21 v1 Numerical Analysis
Abstract
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any order. Good evidence shows it behaves well also for some non-linear schemes. The result, and the structure of the domain, rely on an interesting interplay between order and topology.
Cite
@article{arxiv.0807.2961,
title = {Perturbed affine arithmetic for invariant computation in numerical program analysis},
author = {Eric Goubault and Sylvie Putot},
journal= {arXiv preprint arXiv:0807.2961},
year = {2008}
}
Comments
12 pages in two-column style