Using Stålmarck's algorithm to prove inequalities (2005)
Cached
Download Links
- [www.foment.net]
- [www.research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
by
Byron Cook
,
Georges Gonthier
| Venue: | In ICFEM 05: Conference on Formal Engineering Methods |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Cook05usingstålmarck's,
author = {Byron Cook and Georges Gonthier},
title = {Using Stålmarck's algorithm to prove inequalities},
booktitle = {In ICFEM 05: Conference on Formal Engineering Methods},
year = {2005},
pages = {330--344}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Stalmarck's 1-saturation algorithm is an incomplete but fast method for computing partial equivalence relations over propositional formulae. Aside from anecdotal evidence, until now little has been known about what it can prove. In this paper we characterize a set of formulae with bitvector-inequalities for which 1-saturation is su#cient to prove unsatisfiability. This result has application to fast predicate abstraction for software with fixed-width bit-vectors. 1
