Refining Approximations in Software Predicate Abstraction (2004)
Cached
Download Links
- [www.foment.net]
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
by
Thomas Ball
,
Byron Cook
,
Satyaki Das
,
Sriram K. Rajamani
| Venue: | In: TACAS 04: Tools and Algorithms for Construction and Analysis of Systems, Springer-Verlag |
| Citations: | 25 - 7 self |
BibTeX
@INPROCEEDINGS{Ball04refiningapproximations,
author = {Thomas Ball and Byron Cook and Satyaki Das and Sriram K. Rajamani},
title = {Refining Approximations in Software Predicate Abstraction},
booktitle = {In: TACAS 04: Tools and Algorithms for Construction and Analysis of Systems, Springer-Verlag},
year = {2004},
pages = {388--403},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Predicate abstraction is an automatic technique that can be used to find abstract models of large or infinite-state systems. In tools like Slam, where predicate abstraction is applied to software model checking, a number of heuristic approximations must be used to improve the performance of computing an abstraction from a set of predicates.
