Computer Science – Data Structures and Algorithms
Scientific paper
2008-12-10
Static Analysis, Kongens Lyngby : Danemark (2007)
Computer Science
Data Structures and Algorithms
Scientific paper
10.1007/978-3-540-74061-2_12
Acceleration in symbolic verification consists in computing the exact effect of some control-flow loops in order to speed up the iterative fix-point computation of reachable states. Even if no termination guarantee is provided in theory, successful results were obtained in practice by different tools implementing this framework. In this paper, the acceleration framework is extended to data-flow analysis. Compared to a classical widening/narrowing-based abstract interpretation, the loss of precision is controlled here by the choice of the abstract domain and does not depend on the way the abstract value is computed. Our approach is geared towards precision, but we don't loose efficiency on the way. Indeed, we provide a cubic-time acceleration-based algorithm for solving interval constraints with full multiplication.
Leroux Jérôme
Sutre Gregoire
No associations
LandOfFree
Accelerated Data-Flow 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 Accelerated Data-Flow Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accelerated Data-Flow Analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-59775