DMCA
Termination analysis of integer linear loops (2005)
Cached
Download Links
- [theory.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- [www-step.stanford.edu]
- [react.stanford.edu]
- [theory.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In CONCUR |
| Citations: | 34 - 3 self |
BibTeX
@INPROCEEDINGS{Bradley05terminationanalysis,
author = {Aaron R. Bradley and Zohar Manna and Henny B. Sipma},
title = {Termination analysis of integer linear loops},
booktitle = {In CONCUR},
year = {2005},
pages = {488--502},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Usually, ranking function synthesis and invariant generation over a loop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic must be soundly abstracted away so that the analysis over the abstracted loop is sound for the original loop. Consequently, the analysis loses precision. In contrast, we introduce a technique for handling loops over integer variables directly. The resulting analysis is more precise than previous analyses.
