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 10 of 10 for “"equivalence verification"”.

  1. Equivalence Verification for NULL Convention Logic and Latency-Insensitive Circuits

    … the synchronous speci cations, and verifying equivalence of the synthesized circuit to the synchronous speci cation is one of the main challenges. However, there is no existing work in the literature that address this challenge and still remains an open problem. This study makes an initial e …

    ndsu Repository record for Equivalence Verification for NULL Convention Logic and Latency-Insensitive Circuits (opens in a new tab)

  2. Formal Verification Methodology for Asynchronous Sleep Convention Logic Circuits Based on Equivalence Verification

    … Half Buffers (PCHB), there exists no formal verification methods for SCL. In this thesis, a unified formal verification scheme for combinational as well as sequential SCL circuits is proposed based on equivalence checking, which verifies both safety and liveness. The method is demonstrated …

    ndsu Repository record for Formal Verification Methodology for Asynchronous Sleep Convention Logic Circuits Based on Equivalence Verification (opens in a new tab)

  3. Formal equivalence checking of software specifications vs. hardware implementations

    … software is the target of functional validation, equivalence verification between the software specification and the RTL implementation is needed. This thesis introduces new techniques to reduce the complexity of this verification and increase the capability of current verification techniques. The …

    ubc Repository record for Formal equivalence checking of software specifications vs. hardware implementations (opens in a new tab) Download PDF for Formal equivalence checking of software specifications vs. hardware implementations (opens in a new tab)

  4. Formal Verification Methodologies for NULL Convention Logic Circuits

    … in popularity of asynchronous designs, a formal verification methodology is crucial for ensuring these circuits operate correctly. Four automated formal verification methodologies have been developed, three to ensure delay-insensitivity of an NCL circuit (i.e., prove Input-Completeness, …

    ndsu Repository record for Formal Verification Methodologies for NULL Convention Logic Circuits (opens in a new tab)

  5. Symbolic Reasoning for Query Verification and Optimization

    … I investigate two important problems in query verification and optimization to demonstrate the limitations of syntax-driven techniques: (1) proving query equivalence under set and bag semantics; (2) optimizing queries with learned predicates. I propose to use symbolic reasoning to address the …

    gatech Repository record for Symbolic Reasoning for Query Verification and Optimization (opens in a new tab)

  6. Optimization of battery AI models for edge deployment: A systematic study of model compression techniques and hardware-aware efficiency

    … PyTorch to MATLAB model transfer, numerical equivalence verification, pruning and quantization evaluation, Simulink integration, and embedded C++ code generation. Two complementary compression directions are evaluated. Structured pruning reduces the number of learnable parameters while …

    chalmers Repository record for Optimization of battery AI models for edge deployment: A systematic study of model compression techniques and hardware-aware efficiency (opens in a new tab)

  7. A graph based approach for formal verification of Galois field multipliers

    … computation power available to the hacker. Hence verification of these circuits is of utmost importance. Time and resources taken by conventional methods increase exponentially with the size and complexity of circuits. Formal verification has the potential to improve the verification process by …

    waterloo Repository record for A graph based approach for formal verification of Galois field multipliers (opens in a new tab)

  8. Modularity in answer set programs

    … planning, product configuration, computer aided verification, and bioinformatics. The topic of this thesis is modularity in answer set programming. While modern programming languages typically provide means to exploit modularity in a number of ways to govern the complexity of programs and their …

    aalto Repository record for Modularity in answer set programs (opens in a new tab)

  9. Formal Modeling and Verification Methodologies for Quasi-Delay Insensitive Asynchronous Circuits

    … corner-case bugs. Hence, development of formal verification methods for QDI circuits have been long desired. The very few formal verification methods that exist in the related field have major limiting factors. This dissertation presents different formal verification methodologies applicable to …

    ndsu Repository record for Formal Modeling and Verification Methodologies for Quasi-Delay Insensitive Asynchronous Circuits (opens in a new tab)

  10. Program verification and refactoring in answer set programming

    This thesis addresses the verification and refactoring of programs written in Answer Set Programming (ASP), a declarative programming paradigm used for solving complex combinatorial problems. The focus is on the use of the Anthem verification tool, which translates ASP programs into a two-sorted …

    texas Repository record for Program verification and refactoring in answer set programming (opens in a new tab)