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 24 for “"coq proof assistant"”.
-
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 …
-
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 …
-
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 …
-
Proving Correctness of a Chez Scheme Compiler Pass
We present a proof of correctness for a pass of the Chez Scheme compiler over a subset of the Scheme programming language. To improve trust in our proof approach, we provide two different validation frameworks. The first, created with the Coq proof assistant, is a partial mechanization of the …
-
A Verified Algorithm for Detecting Conflicts in XACML Access Control Rules
… algorithm to find these conflicts then use the Coq Proof Assistant to prove correctness of this algorithm. The algorithm takes a rule set specified in XACML and returns a list of pairs of indices denoting which rules conflict. It is then up to the policy writer to see if the conflicts are …
-
Shared-Environment Call-by-Need
… present a verified compiler, implemented in the Coq proof assistant, demonstrating how the simplicity of the approach enables formal verification.
-
Formalizing Abstract Computability: Turing Categories in Coq
… this computation model. Specifically, to use the Coq proof assistant to formulate informal definitions, propositions and proofs pertaining to Turing categories in the underlying formal language of Coq, the Calculus of Co-inductive Constructions (CIC). Furthermore, we have instantiated the more …
-
Programų korektiškumo įrodymai „Coq“ teoremų įrodymo aplinkoje /
… and verification of programs based on the formal proofs of their respective properties can be seen as separate field of study. As such methods have mathematical and logical foundations, the guarantees for program correctness provided by these methods are much stronger. However, the application of …
-
Formal Semantics and Mechanized Soundness Proof for Fast Gradually Typed JavaScript
… type system, and provides a mechanized soundness proof using the Coq proof assistant.
-
Random Testing For Language Design
… advanced random testing techniques to the Coq proof assistant. I describe QuickChick, a QuickCheck clone for Coq, and improve it by incorporating ideas explored in the context of Luck to automatically derive provably correct generators for data constrained by inductive relations. Finally, I …
-
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 …
-
Certified Software for Designing Asynchronous Circuits
… instructions with mechanically-verifiable proofs that certain properties of the instructions are upheld. In this dissertation, we build certified software that is used to design asynchronous circuits. These circuits differ from synchronous circuits by coordinating communication via local …
-
A Methodology For Micro-Policies
… has been formalized and verified in the Coq proof assistant, attesting that our methodology can provide rigorous security guarantees.
-
Formally Verified Bundling and Appraisal of Evidence for Layered Attestations
… as monadic, functional programs in the Coq proof assistant and verified with respect to a Copland reference semantics that characterizes attestation-relevant event traces and cryptographic evidence structure. Appraisal soundness is positioned within a novel end-to-end workflow that …
-
λir : A language with intensional receive
… safety. We have also formalized λir using the Coq proof assistant and prove its soundness. λir provides built-in proofs for guaranteed delivery of messages and encodes actions as an integral part that makes it possible to describe and prove properties about happens-before relations. λir comes …
-
Confidence in Confinement: An Axiom-free, Mechanized Verification of Confinement in Capability-based Systems
… either due to flawed system models or to proof errors that have not survived inspection. This dissertation presents SDM: a formal, general, and extensible system model for a broad class of capability-based systems. SDM includes: 1) a mechanical formalization for reasoning about …
-
Formal verification of a real-time operating system
… system microkernel (FreeRTOS) applies assisted proof checking to its formalized specification description. The experiment consists of describing real-time operating system characteristics, such as memory safety and scheduler determinism, in Separation Logic — a formal language that allows …
-
Proof Repair
… to large and critical systems—an era of proof engineering. Proof engineering is for verified systems what software engineering is for unverified systems. Still, while proof engineering—like software engineering—is about both development and maintenance, most proof engineering technologies …
-
Building trustworthy smart contracts using interactive theorem proving
… case studies are written in the language of the Coq Proof Assistant, making arbitrary mathematical statements expressible. The blockchain model enables stating and proving temporal properties relating to the execution of smart contract over time. While smart contracts are an ideal application …
-
Formally Verified Quantum Programming
… that quantum programs demand machine-checkable proofs of correctness. We justify this on the basis of the complexity of programs manipulating quantum states, the expense of running quantum programs, and the inapplicability of traditional debugging techniques to programs whose states cannot be …
Page 1 of 2