Efficient Chaotic Iteration Strategies With Widenings (1993)
Cached
Download Links
- [gatekeeper.dec.com]
- [www.exalead.com]
- [web.me.com]
- CiteULike
Other Repositories/Bibliography
| Venue: | In Proceedings of the International Conference on Formal Methods in Programming and their Applications |
| Citations: | 96 - 1 self |
BibTeX
@INPROCEEDINGS{Bourdoncle93efficientchaotic,
author = {François Bourdoncle},
title = {Efficient Chaotic Iteration Strategies With Widenings},
booktitle = {In Proceedings of the International Conference on Formal Methods in Programming and their Applications},
year = {1993},
pages = {128--141},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Abstract interpretation is a formal method that enables the static and automatic determination of run-time properties of programs. This method uses a characterization of program invariants as least and greatest fixed points of continuous functions over complete lattices of program properties. In this paper, we study precise and efficient chaotic iteration strategies for computing such fixed points when lattices are of infinite height and speedup techniques, known as widening and narrowing, have to be used. These strategies are based on a weak topological ordering of the dependency graph of the system of semantic equations associated with the program and minimize the loss in precision due to the use of widening operators. We discuss complexity and implementation issues and give precise upper bounds on the complexity of the intraprocedural and interprocedural abstract interpretation of higher-order programs based on the structure of their control flow graph. 1 Introduction Abstract in...
Citations
No citations identified.
