Scalable analysis of linear systems using mathematical programming (2005)
Cached
Download Links
- [theory.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. VMCAI, LNCS 3385 |
| Citations: | 40 - 6 self |
BibTeX
@INPROCEEDINGS{Sankaranarayanan05scalableanalysis,
author = {Sriram Sankaranarayanan and Henny B. Sipma and Zohar Manna},
title = {Scalable analysis of linear systems using mathematical programming},
booktitle = {In Proc. VMCAI, LNCS 3385},
year = {2005},
pages = {25--41},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present a method for generating linear invariants for domain consisting of arbitrary polyhedra of a predefined fixed shape. The basic operations on the domain like abstraction, intersection, join and inclusion tests are all posed as linear optimization queries, which can be solved efficiently by existing LP solvers. The number and dimensionality of the LP queries are polynomial in the program dimensionality, size and the number of target invariants. The method generalizes similar analyses in the interval, octagon, and octahedra domains, without resorting to polyhedral manipulations. We demonstrate the performance of our method on some benchmark programs. 1
