Abstract Fixpoint Computations with Numerical Acceleration Methods

Details Abstract Fixpoint Computations with Numerical Acceleration Methods Abstract Fixpoint Computations with Numerical Acceleration Methods

2010-06-16

arxiv.org/abs/1006.3159v1

Computer Science

Programming Languages

Scientific paper

Static analysis by abstract interpretation aims at automatically proving properties of computer programs. To do this, an over-approximation of program semantics, defined as the least fixpoint of a system of semantic equations, must be computed. To enforce the convergence of this computation, widening operator is used but it may lead to coarse results. We propose a new method to accelerate the computation of this fixpoint by using standard techniques of numerical analysis. Our goal is to automatically and dynamically adapt the widening operator in order to maintain precision.

Affiliated with

Also associated with

No associations

Rating

Abstract Fixpoint Computations with Numerical Acceleration Methods 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 Abstract Fixpoint Computations with Numerical Acceleration Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstract Fixpoint Computations with Numerical Acceleration Methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100220