Perturbed affine arithmetic for invariant computation in numerical program analysis

Details Perturbed affine arithmetic for invariant computation in numerical program analysis Perturbed affine arithmetic for invariant computation in numerical program analysis

2008-07-18

arxiv.org/abs/0807.2961v1

Computer Science

Logic in Computer Science

12 pages in two-column style

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Perturbed affine arithmetic for invariant computation in numerical program analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Perturbed affine arithmetic for invariant computation in numerical program analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perturbed affine arithmetic for invariant computation in numerical program analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-388416