Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Bit Vector"”.

  1. Synthesis of domain specific CNF encoders for bit-vector solvers

    … different domains of problems represented in the bit-vector benchmark suite from the SMT competition 2015.

    mit Repository record for Synthesis of domain specific CNF encoders for bit-vector solvers (opens in a new tab)

  2. Machine-independent parallel execution of speculative computations

    … in pure state-space search that associates bit-vector priorities with computations is described. The bit-vector priorities ensure that the resources are focused towards the first solution. A technique called delayed-release is developed which ensures that the memory usage of parallel …

    uiuc Repository record for Machine-independent parallel execution of speculative computations (opens in a new tab)

  3. Exploring Abstraction Techniques for Scalable Bit-Precise Verification of Embedded Software

    … begun modeling a non-Boolean data variable as a bit-vector with bounded width (i.e. a vector of multiple bits like 32- or 64- bits) to implement bit-precise verification. One major challenge in the scalable application of such bit-precise verification on real-world embedded software is that the …

    vt Repository record for Exploring Abstraction Techniques for Scalable Bit-Precise Verification of Embedded Software (opens in a new tab)

  4. Data Structures for Points-To Analysis

    … For points-to sets, we introduce an improved bit-vector stripping both leading and trailing zero-words, then use that to aid in improving the object-to-identifier mapping required to use bit-vectors as points-to sets. We frame this as an integer programming problem, yielding an optimal …

    uts Repository record for Data Structures for Points-To Analysis (opens in a new tab)

  5. An Information Theoretic Study on Linear Dispersion Codes and Low -Density Parity -Check Codes

    … and low-density parity-check (LDPC) codes. For bit-linear LD codes, we find necessary and sufficient conditions on the dispersion matrices for the a posteriori distribution of the information bit vector to be a product distribution. We also study the design of dispersion matrices to maximize the …

    uiuc Repository record for An Information Theoretic Study on Linear Dispersion Codes and Low -Density Parity -Check Codes (opens in a new tab)

  6. Optimization Modulo Theories with OptiMathSAT

    … Linear Integer and Rational Arithmetic, the Bit-Vector and the Floating Point domain– including (Partial Weighted) MaxSMT. We validate our theoretical contributions experimentally, by comparing the performance of OptiMathSAT against other, competing, OMT solvers. Finally, we investigate the …

    trento Repository record for Optimization Modulo Theories with OptiMathSAT (opens in a new tab)

  7. SMT-based bounded model checking of multi-threaded software in embedded systems

    … more accurate support for variables of finite bit width, bit-vector operations, arrays, structures, unions and pointers and thus making our approach suitable to reason about embedded software. We then provide new encodings into existing SMT theories and we show that our translations from ANSI-C …

    soton Repository record for SMT-based bounded model checking of multi-threaded software in embedded systems (opens in a new tab)

  8. Parallel acceleration of deadlock detection and avoidance algorithms on GPUs

    … the RAG is represented using integer-length bit-vectors. The advantages brought forth by this approach are plenty: (i) less memory required for algorithm matrices, (ii) 32 computations performed per instruction (in most cases), and (iii) allows our algorithms to handle large numbers of …

    iupui Repository record for Parallel acceleration of deadlock detection and avoidance algorithms on GPUs (opens in a new tab)