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 102 for “"proof assistant"”.

  1. A Functional and Monadic Proof Assistant for Streams

    … presents the discussion and imple­mentation of a proof assistant that supports this proof method. The tool is implemented in the purely functional language Haskell and makes extensive use of monads. The emphasis of the project is pla­ced on simplicity, clarity and terseness.

    oxford Restricted access

  2. TYPES OF ALGEBRAIC STRUCTURES IN PROOF ASSISTANT SYSTEMS

    … standard library of mathematical knowledge for a proof system is a complex task that relies on human effort. By conducting a survey on the standard library of four proof systems (Agda, Idris, Lean, and Coq), we define the scope for our research to study types of algebraic structures in proof …

    mcmaster Repository record for TYPES OF ALGEBRAIC STRUCTURES IN PROOF ASSISTANT SYSTEMS (opens in a new tab)

  3. Formally Verified Code Obfuscation in the Coq Proof Assistant

    … specification and verification, by using the Coq Proof Assistant and IMP (a simple imperative language within it), to formulate what it means for a program's semantics to be preserved by an obfuscating transformation, and give formal machine-checked proofs that these properties hold. We describe …

    ottawa-retro Repository record for Formally Verified Code Obfuscation in the Coq Proof Assistant (opens in a new tab)

  4. Verified commitment schemes and reduction proofs in the lean proof assistant

    … 4 theorem prover, together with machine-checked proofs of their core security properties. Commitment schemes allow a party to commit to a value while keeping it hidden, with guarantees of binding (the value cannot be changed) and hiding (the value remains secret until revealed). We develop a …

    uvic Repository record for Verified commitment schemes and reduction proofs in the lean proof assistant (opens in a new tab)

  5. Improving Memory Consumption with FAITH - a Proof Assistant for Improvement Theory

    … asymptotic space increase. However, since the proofs are long and complicated, Space Improvement proofs done on paper are prone to errors. To tackle this problem, I have constructed FAITH, the proof assistant for Improvement Theory. FAITH allows users to define transformational laws, such as …

    chalmers Repository record for Improving Memory Consumption with FAITH - a Proof Assistant for Improvement Theory (opens in a new tab)

  6. Don’t Mind The Formalization Gap: The Design And Usage Of Hs-To-Coq

    Using proof assistants to perform formal, mechanical software verification is a powerful technique for producing correct software. However, the verification is time-consuming and limited to software written in the language of the proof assistant. As an approach to mitigating this tradeoff, this …

    penn Repository record for Don’t Mind The Formalization Gap: The Design And Usage Of Hs-To-Coq (opens in a new tab)

  7. Design and Implementation of Family Polymorphism for Interactive Theorem Proving

    … it easy to write reusable, extensible code and proofs. This thesis presents a novel language design geared towards extensible metatheory mechanization in a proof assistant. The new design achieves reuse and extensibility via a form of family polymorphism, an object-oriented idea, that allows …

    waterloo Repository record for Design and Implementation of Family Polymorphism for Interactive Theorem Proving (opens in a new tab)

  8. Metamath kalbos vizualizavimas /

    … of enhancing the readability of mathematical proofs written in the Metamath language. The proposed approach introduces a graphical user interface (GUI) that utilizes the Blockly tool to visualize program code using graphic elements. The study involves a review and evaluation of existing proof …

    vilnius Repository record for Metamath kalbos vizualizavimas / (opens in a new tab)

  9. Geometric ergodicity of a random-walk metorpolis algorithm via variable transformation and computer aided reasoning in statistics.

    … program to assist with mathematical reasoning. Proofs done in a proof assistant program are done formally, every step and inference is validated back to the axioms and rules of inference. Thus we have higher confidence in the correctness of a formally verified proof than one done with the …

    umn Repository record for Geometric ergodicity of a random-walk metorpolis algorithm via variable transformation and computer aided reasoning in statistics. (opens in a new tab)

  10. A Verified Software Toolchain for Quantum Programming

    … representation deeply embedded in the Coq proof assistant, which has been used to implement and prove correct quantum algorithms such as Grover’s search and Shor’s factorization algorithm. Next, I present VOQC, a verified optimizer for quantum circuits that contains state-of-the-art SQIR …

    maryland Repository record for A Verified Software Toolchain for Quantum Programming (opens in a new tab)

  11. Formalisering av algoritmer och matematiska bevis En formalisering av Toom-Cook algoritmen i Coq med SSReflect

    … with the formalization of very large and complex proofs such as the proof of the Four color theorem and the Feit-Thompson theorem. In this report we present a formal proof of the Toom-Cook algorithm using the Coq proof assistant together with the SSReflect extension. The Toom-Cook algorithm is …

    chalmers Repository record for Formalisering av algoritmer och matematiska bevis En formalisering av Toom-Cook algoritmen i Coq med SSReflect (opens in a new tab)

  12. Programming Language Foundations for Packet Processing

    … The verification methodology combines manual proof in an LCF-style proof assistant with automatic decision procedures that rely on SAT/SMT solvers for a compact trusted computing base.

    cornell Repository record for Programming Language Foundations for Packet Processing (opens in a new tab)

  13. Redex-plus : a metanotation for programming languages

    … they are unsuitable for use in rigorous formal proofs. The aim of this project is to develop a tool that bridges the gap between the intuitive metanotations for defining programming languages, and proof assistant languages in which properties of the languages defined can be formally proven. In …

    ubc Repository record for Redex-plus : a metanotation for programming languages (opens in a new tab) Download PDF for Redex-plus : a metanotation for programming languages (opens in a new tab)

Page 1 of 6