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 20 of 1194 for “"proving"”.

  1. Proving infeasibility in motion planning

    … or until a timeout. Reporting failure, or proving infeasibility, when no plan exists is another side of the problem that has not been well-studied previously. This thesis focuses on finding infeasibility proofs in motion planning. An infeasibility proof is a closed manifold in the obstacle …

    colo-mines Repository record for Proving infeasibility in motion planning (opens in a new tab)

  2. Theorem proving with the real numbers

    … discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few 'discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification of floating …

    cambridge

  3. Applied Compiler Optimizations for Proving Code

    The recent popularity of massively distributed, trustless systems has created a demand for cryptographic proofs: systems to prove that a piece of data is a valid output for a given program. These systems exist, but face very high runtimes for the generation of proofs. Significant effort has been …

    mit Repository record for Applied Compiler Optimizations for Proving Code (opens in a new tab)

  4. User interaction widgets for interactive theorem proving

    … Most activities connected with interactive proving require the user to input mathematical formulae. Being mathematical notation ambiguous, parsing formulae typeset as mathematicians like to write down on paper is a challenging task; a challenge neglected by several theorem provers which …

    bologna Repository record for User interaction widgets for interactive theorem proving (opens in a new tab)

  5. Theorem-proving distributed algorithms with dynamic analysis

    … systems. We present a method to make theorem-proving safety properties of distributed algorithms more productive by reducing human intervention. We model the algorithms as I/O automata, render the automata executable, and analyze the test executions with dynamic invariant detection. The human …

    mit Repository record for Theorem-proving distributed algorithms with dynamic analysis (opens in a new tab)

  6. Building trustworthy smart contracts using interactive theorem proving

    … bytecode executed on-chain. Interactive theorem proving can provide the foundation for developing provably correct smart contracts. Due to the immutable nature of smart contracts and their potential to manage highly valuable assets and tokens representing power, techniques to ensure their …

    waikato-masters Repository record for Building trustworthy smart contracts using interactive theorem proving (opens in a new tab)

  7. Topics in Automated Theorem Proving and Program Generation

    This thesis contains two parts, each deals with a different subject.

    uiuc Repository record for Topics in Automated Theorem Proving and Program Generation (opens in a new tab)

  8. The DP framework for proving termination of term rewriting

    … not have reached the highest scores both for proving and disproving termination in the years 2004 - 2007.

    aachen Repository record for The DP framework for proving termination of term rewriting (opens in a new tab)

  9. Differential dynamic logics - automated theorem proving for hybrid systems

    Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equations. With the goal of developing a theoretical and practical foundation for deductive verification of hybrid systems, …

    oldenburg Repository record for Differential dynamic logics - automated theorem proving for hybrid systems (opens in a new tab)

  10. Proving presence and locality to mitigate compromised smartphone scenarios

    This research delves into the evolving landscape of smartphone security and authentication technologies. While the scope of threats and security measures is applicable to mobile computing in general, the study focuses primarily on mobile banking, a sector particularly vulnerable to evolving …

    malta Repository record for Proving presence and locality to mitigate compromised smartphone scenarios (opens in a new tab)

  11. Automatic techniques for proving correctness of heap-manipulating programs

    … decision procedures can be used in not only proving programs correct but also in software analysis and testing. Dryad is a family of logics, including Dryad-tree as a first-order logic for trees and Dryad-sep as a dialect of separation logic. Both the two logics are amenable to automated …

    uiuc Repository record for Automatic techniques for proving correctness of heap-manipulating programs (opens in a new tab)

  12. A verification framework suitable for proving large language translations

    … basis for defining language specifications and proving properties about the specifications. Second, we define a complete operational semantics of LLVM in K, named K-LLVM, including the specifications of all instructions and intrinsic functions in LLVM, as well as the concurrency model of LLVM. …

    uiuc Repository record for A verification framework suitable for proving large language translations (opens in a new tab)

  13. Monte Carlo Tree Search Applications to Neural Theorem Proving

    … Yang’s recent contribution: LeanDojo: Theorem Proving with Retrieval-Augmented Language Models. In their work, Yang et al. introduce LeanDojo, an environment for programmatic interaction with the Lean theorem proving language, alongside ReProver, a ByT5-Small transformer-based ATP fine-tuned …

    mit Repository record for Monte Carlo Tree Search Applications to Neural Theorem Proving (opens in a new tab)

  14. Proving Cryptographic C Programs Secure with General-Purpose Verification Tools

    … the symbolic model, we illustrate our method by proving authentication and weak secrecy for implementations of several network security protocols. In the computational model, we illustrate our method by proving authentication and strong secrecy properties for an exemplary key management API, …

    the-open-u Repository record for Proving Cryptographic C Programs Secure with General-Purpose Verification Tools (opens in a new tab)

  15. Generic Theorem Proving Using HOL2P: A Category Theory Inspired Approach

    … framework for reasoning. The result is theorem proving support based on type quantification and type operator variables in HOL, HOL2P. This is demonstrated by the verification the Yoenda Lemma.

    essex Repository record for Generic Theorem Proving Using HOL2P: A Category Theory Inspired Approach (opens in a new tab)

Page 1 of 60