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 32 for “"Interactive Theorem Proving"”.
-
Learning Systems for Interactive Theorem Proving
Interactive theorem proving is a great tool to establish correctness of programs and mathematics. Despite the well-known undecidability of any fairly expressive system, it is possible to leverage machine learning to help find proofs in a humanlike way. This thesis focuses on interactive theorem …
-
Building trustworthy smart contracts using interactive theorem proving
… apply to the real 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 …
-
Design and Implementation of Family Polymorphism for Interactive Theorem Proving
… it has become ever more pressing that interactive theorem provers make 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 …
-
Incomplete proofs and terms and their use in interactive theorem proving
Item does not contain fulltext
-
ON THE APPLICATIONS OF INTERACTIVE THEOREM PROVING IN COMPUTATIONAL SCIENCES AND ENGINEERING
Interactive Theorem Proving (ITP) is one of the most rigorous methods used in formal verification of computing systems. While ITP provides a high level of confidence in the correctness of the system under verification, it suffers from a steep learning curve and the laborious nature of interaction …
-
Proof Recommendation for the HOL4 Theorem Prover
Interactive theorem proving is a complex process that often requires significant expertise, user intervention and deep domain knowledge, making it challenging for users to construct valid proofs. The HOL4 theorem prover, while a powerful tool in formal verification, presents usability challenges …
-
Toward a tool to verify complex data structure invariants
… analysis tools provide limited abstractions, and interactive theorem proving techniques while providing deeper verifications are often too tedious to be practical. The goal of our research is to make interactive theorem proving techniques more practical to use. We started by developing the …
-
Security modeling and correctness proof using Specware and Isabelle
… for correctness in Isabelle which is a generic, interactive theorem proving environment. It is found that the translation between Specware and Isabelle is almost seamless and there is much potential in the use of Isabelle/HOL to discharge proof obligations that arise in developing Specware …
-
Formal Analysis of Concurrent Programs
… denotational models are implemented in the interactive theorem prover Isabelle/HOL. Formal soundness proofs link the algebras to their models. This follows a general algebraic approach for developing correct by construction verification tools within Isabelle. In this approach, algebras …
-
Interaktyvaus teoremų įrodymo asistento pritaikymas neregiams /
This thesis explores the accessibility of the interactive theorem proof assistant „TLA⁺ Proof Manager“ (TLAPM) for users with visual impairments, focusing on its integration via the „TLA⁺“ extension in „Visual Studio Code“ („VS Code“). The work begins by defining accessibility criteria specifically …
-
Formal Methods for the Design and Verification of UAV Feedback Controls
… examples of formal proofs of theoretical control theorems. These represent the first steps towards verifying control theories by software using formal methods by interactive theorem proving. The thesis presents a new nonlinear controller for unmanned aerial vehicles by jointly addressing modelling …
-
HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs
HOLCF is an interactive theorem proving system that uses the mathematics of domain theory to reason about programs written in functional programming languages. This thesis introduces HOLCF '11, a thoroughly revised and extended version of HOLCF that advances the state of the art in program …
-
Combining advanced formal hardware verification techniques
… formal verification is to modify general-purpose theorem proving techniques to increase the number of lemma instances considered automatically. Such a modification to the forward chaining proof technique within the ACL2 theorem prover is described. This dissertation identifies a decidable subclass …
-
Language Based Security for Java and JML
… non-interference. Abstract interpretation, interactive theorem proving, program transformation and specification generation techniques are used to enforce each of the different notions of non-interference discussed above.
-
Secure architectures on a verified microkernel
… of system initialisation and prove, in the theorem prover Isabelle/HOL, that the resulting state conforms with the desired one, giving us an unprecedented level of assurance for the correctness of system initialisation. Our proof formally connects to the existing functional correctness proof …
-
Formal verification of biologically inspired computing models
… To verify cP systems, both model checking and interactive theorem proving are considered in this thesis. By using formal tools including PAT3, ProB, and Coq, several cP systems were verified including two NPC solutions proposed in this study. These are: ΠSSP - a cP system that solves the subset …
-
Low-Level Static Analysis for Memory Usage and Control Flow Recovery
… of noninterference. However, soundly proving memory usage requires operating on the assembly level due to the semantic gap between high-level languages and the code that processors actually execute. Automated methods, such as model checking, would not be able to handle many interesting …
-
Automated proof-producing abstraction of C code
… tool named AutoCorres, built on the Isabelle/HOL interactive theorem prover. We demonstrate the effectiveness of our abstractions in a number of case studies, and show the scalability of AutoCorres by translating real-world programs consisting of tens of thousands of lines of code. While our work …
Page 1 of 2