Accelerated Data-Flow Analysis
| dc.creator | Leroux, Jérôme | |
| dc.creator | Sutre, Gregoire | |
| dc.date | 2008-12-10 | |
| dc.date.accessioned | 2026-07-07T12:11:44Z | |
| dc.date.available | 2026-07-07T12:11:44Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0812.2011 | |
| dc.identifier | http://arxiv.org/abs/0812.2011 | |
| dc.identifier | Static Analysis, Kongens Lyngby : Danemark (2007) | |
| dc.identifier | doi:10.1007/978-3-540-74061-2_12 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/210317 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Accelerated Data-Flow Analysis | |
| dc.type | text |