An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors (1997) [21 citations — 3 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Cyrluk97anefficient,author = {David Cyrluk and Oliver Moller},
title = {An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors},
booktitle = {},
year = {1997},
pages = {60--71},
publisher = {Springer}
}
Years of Citing Articles
Abstract:
The theory of fixed-sized bitvectors with composition and extraction has been shown to be useful in the realm of hardware verification, and in this paper we develop an efficient algorithm for deciding this theory. A proper input is an unquantified bitvector equation, say t = u, and our algorithm returns true if t = u is valid in the bitvector theory, false if t = u is unsatisfiable, and a system of solved equations otherwise. The time complexity of this solver is O(j t j \Delta log n + n 2), where j t j is the length of the bitvector term t and n denotes the number of bits on either side of the equation. Moreover, the resulting procedure can readily be integrated into Shostak's procedure for deciding combinations of theories. 1
