M.O. Moller. Solving Bit-Vector Equations---A Decision Procedure for Hardware Verification, 1998. Diploma Thesis, available from http://www.informatik.uni-ulm.de/ki/Bitvector/.  Home/Search   Document Details and Download   Summary   Related Articles

....the problem of solving. Hereby, we restrict ourselves to the theory of bit vectors with the fundamental operations of concatenation and extraction only, since other bit vector operations, like bitwise Boolean operations, can be added in a conceptually clean way using the notion of bit vector OBDDs [CMR97,Mol98]. Section 3 forms the core of this paper and describes a rule based algorithm for solving fixed size bit vector equations. In Section 4 we extend the rule based algorithm for solving equations on non fixed size bit vector terms. Section 5 concludes with some remarks. Prototypical implementations ....

....of structural equations can be discarded, since they do not represent proper splits. Notice also that, in the worst case, the cardinality of SE( may grow quadratically with the size of the bit vectors involved. Some simple implementation techniques for handling this kind of blowup are listed in [Mol98]. Definition 5. Let t = u be a bit vector equation. A set of equations Upsilon is called a solved set for t = u if: 1. Upsilon is equivalent with ft = ug. 2. no rule of C is applicable for Upsilon . 3. for each x 2 vars(t = u) Upsilon , Upsilon contains an equation of the form x ....

[Article contains additional citation context not shown here]

M.O. Moller. Solving Bit-Vector Equations---A Decision Procedure for Hardware Verification, 1998. Diploma Thesis, available from http://www.informatik.uni-ulm.de/ki/Bitvector/.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC