Results 1  10
of
376,476
An Investigation of Hierarchical Bit Vectors
"... Hierarchical bit vectors represent sets of integers using a collection of bit vectors. At the top level, a single bit is set iff the set is nonempty. The bits of this next level summarize ranges of the elements. In the case of a binary hierarchical bit vector the two bits of the next level summariz ..."
Abstract
 Add to MetaCart
Hierarchical bit vectors represent sets of integers using a collection of bit vectors. At the top level, a single bit is set iff the set is nonempty. The bits of this next level summarize ranges of the elements. In the case of a binary hierarchical bit vector the two bits of the next level
Solving BitVector Equations
 Formal Methods in ComputerAided Design (FMCAD '98
, 1998
"... This paper is concerned with solving equations on fixed and nonfixed size bitvector terms. We define an equational transformation system for solving equations on terms where all sizes of bitvectors and extraction positions are known. This transformation system suggests a generalization for dealin ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
This paper is concerned with solving equations on fixed and nonfixed size bitvector terms. We define an equational transformation system for solving equations on terms where all sizes of bitvectors and extraction positions are known. This transformation system suggests a generalization
The Bit Vector Intersection Problem
, 1995
"... This paper introduces the bit vector intersection problem: given a large collection of sparse bit vectors, find all the pairs with at least t ones in common for a given input parameter t. The assumption is that the number of ones common to any two vectors is significantly less than t, except for an ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This paper introduces the bit vector intersection problem: given a large collection of sparse bit vectors, find all the pairs with at least t ones in common for a given input parameter t. The assumption is that the number of ones common to any two vectors is significantly less than t, except
BitVector Optimization
"... Abstract. A variety of applications of Satisfiability Modulo Theories (SMT) require finding a satisfying assignment which optimizes some usergiven function. Optimization in the context of SMT is referred to as Optimization Modulo Theories (OMT). Current OMT research is mostly dedicated to optimizat ..."
Abstract
 Add to MetaCart
to optimization in arithmetic domains. This paper is about Optimization modulo BitVectors (OBV). We introduce two OBV algorithms which can easily be implemented in an eager bitvector solver. We show that an industrial problem of fixing cell placement during the physical design stage of the CAD process can
A decision procedure for bitvectors and arrays
 IN COMPUTER AIDED VERIFICATION, NUMBER 4590 IN LNCS
, 2007
"... STP is a decision procedure for the satisfiability of quantifierfree formulas in the theory of bitvectors and arrays that has been optimized for large problems encountered in software analysis applications. The basic architecture of the procedure consists of wordlevel preprocessing algorithms fo ..."
Abstract

Cited by 191 (11 self)
 Add to MetaCart
STP is a decision procedure for the satisfiability of quantifierfree formulas in the theory of bitvectors and arrays that has been optimized for large problems encountered in software analysis applications. The basic architecture of the procedure consists of wordlevel preprocessing algorithms
Deciding bitvector arithmetic with abstraction
 IN PROC. TACAS 2007
, 2007
"... We present a new decision procedure for finiteprecision bitvector arithmetic with arbitrary bitvector operations. Our procedure alternates between generating under and overapproximations of the original bitvector formula. An underapproximation is obtained by a translation to propositional log ..."
Abstract

Cited by 58 (24 self)
 Add to MetaCart
We present a new decision procedure for finiteprecision bitvector arithmetic with arbitrary bitvector operations. Our procedure alternates between generating under and overapproximations of the original bitvector formula. An underapproximation is obtained by a translation to propositional
Compression of Correlated BitVectors
 Information Systems
, 1990
"... : Bitmaps are data structures occurring often in information retrieval. They are useful; they are also large and expensive to store. For this reason, considerable effort has been devoted to finding techniques for compressing them. These techniques are most effective for sparse bitmaps. We propose a ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
: Bitmaps are data structures occurring often in information retrieval. They are useful; they are also large and expensive to store. For this reason, considerable effort has been devoted to finding techniques for compressing them. These techniques are most effective for sparse bitmaps. We propose a preprocessing stage, in which bitmaps are first clustered and the clusters used to transform their member bitmaps into sparser ones, that can be more effectively compressed. The clustering method efficiently generates a graph structure on the bitmaps. In some situations, it is desired to impose restrictions on the graph; finding the optimal graph satisfying these restrictions is shown to be NPcomplete. The results of applying our algorithm to the Bible is presented: for some sets of bitmaps, our method almost doubled the compression savings. 1. Introduction Textual Information Retrieval Systems (IRS) are voracious consumers of computer storage resources. Most conspicuous, of course, is the...
An Abstract Domain for BitVector Inequalities
"... This paper advances the state of the art in abstract interpretation of machine code. It tackles two of the biggest challenges in machinecode analysis: (1) holding onto invariants about values in memory, and (2) identifying affineinequality invariants while handling overflow in arithmetic operatio ..."
Abstract
 Add to MetaCart
operations over bitvector datatypes. Most current approaches either capture relations only among registers (and ignore memory entirely), or make potentially unsound assumptions when handling memory. Furthermore, existing bitvector domains are able to represent either relational affine equalities or non
for BitVector Arithmetic
, 2009
"... personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires pri ..."
Abstract
 Add to MetaCart
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission.
Results 1  10
of
376,476