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 7 of 7 for “"Bitvectors"”.

  1. Integrating Skips and Bitvectors for List Intersection

    … can produce dense regions in these lists, where bitvectors can be used to improve the efficiency of conjunctive list intersection. Since the process of list intersection is a fundamental building block and a major performance bottleneck for search engines, this work will be important for all …

    waterloo Repository record for Integrating Skips and Bitvectors for List Intersection (opens in a new tab)

  2. Improvements to Many-Sorted Finite Model Finding using SMT Solvers

    … preventing overflows in integer problems using bitvectors as a transformation from/to a many-sorted first-order logic formula and extend it to support additional abstractions present in MSFOL - Propose an integer finitization method, called overflow-preventing finite integers (OPFI), that …

    waterloo Repository record for Improvements to Many-Sorted Finite Model Finding using SMT Solvers (opens in a new tab)

  3. Finding Termination and Time Improvement in Predicate Abstraction with Under-Approximation and Abstract Matching

    … which reduces concrete states of a system to bitvectors of true/false valuations of a set of predicates. Predicate abstraction comes in two flavors, over-approximation and under-approximation. A drawback of over-approximation is that it produces too many spurious errors for data-intensive …

    byu Repository record for Finding Termination and Time Improvement in Predicate Abstraction with Under-Approximation and Abstract Matching (opens in a new tab) Download PDF for Finding Termination and Time Improvement in Predicate Abstraction with Under-Approximation and Abstract Matching (opens in a new tab)

  4. Binarized activations for post-hoc interpretability and representation analysis in deep neural networks

    … Taken together, this work establishes bitvectors as a lightweight lens for analyzing and explaining deep networks, yielding insights into feature economy, robustness, and redundancy, and leading to Quant-CAM, an attribution method that demonstrates the strength of this binary …

    colostate Repository record for Binarized activations for post-hoc interpretability and representation analysis in deep neural networks (opens in a new tab) Embargoed until 2028-01-07

  5. Time-Triggered Program Monitoring

    … schemes and propose two new schemes based on bitvectors that significantly reduce the overhead for time-triggered execution monitoring. Time-triggered execution monitoring suffers from several drawbacks such as; the time-triggered monitor requires certain synchronization features at the …

    waterloo Repository record for Time-Triggered Program Monitoring (opens in a new tab)

  6. Precise verification of C programs

    … in most common languages use fixed-width bitvectors for their variables. This can have a real impact on the verification, leading to incorrect claims by the verifier.</p> <p>In this thesis we will show that it is possible to analyse C programs without generating false alarms, even if they …

    oxford Repository record for Precise verification of C programs (opens in a new tab)

  7. Speeding up hardware verification by automated data path scaling

    The main obstacle for formal hardware verification of digital circuits is formed by ever increasing design sizes and circuit complexity. Therefore, reducing runtimes and the amount of memory needed for verification computations is a major requirement in order to successfully apply formal …

    cau-kiel Repository record for Speeding up hardware verification by automated data path scaling (opens in a new tab)