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 64 for “"Theorem Proving"”.
-
Theorem proving with the real numbers
… thesis 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 …
-
User interaction widgets for interactive theorem proving
… means pencil in Italian) is a new interactive theorem prover under development at the University of Bologna. When compared with state-of-the-art proof assistants, Matita presents both traditional and innovative aspects. The underlying calculus of the system, namely the Calculus of (Co)Inductive …
-
Theorem-proving distributed algorithms with dynamic analysis
Theorem provers are notoriously hard to use because of the amount of human interaction they require, but they are important tools that can verify infinite state distributed systems. We present a method to make theorem-proving safety properties of distributed algorithms more productive by reducing …
-
Building trustworthy smart contracts using interactive theorem proving
… 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 ensure their …
-
Topics in Automated Theorem Proving and Program Generation
This thesis contains two parts, each deals with a different subject.
-
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, …
-
Monte Carlo Tree Search Applications to Neural Theorem Proving
… following 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 …
-
Generic Theorem Proving Using HOL2P: A Category Theory Inspired Approach
… approach to generic program specification. Theorems to simplify verification of generic programs are developed along with a formal framework for reasoning. The result is theorem proving support based on type quantification and type operator variables in HOL, HOL2P. This is demonstrated by …
-
Automatic inductive theorem proving and program construction methods using program transformation
… programs from the resulting proofs. These theorem proving and program construction techniques make use of the distillation algorithm to transform input conjectures into a normalised form which we call distilled form. The proof rules are applied to the resulting distilled program. Our …
-
Translating timed I/O automata specifications for theorem proving in PVs
… evolution. In order to employ an interactive theorem prover in deducing properties of a timed input/output automaton, its state-transition based description has to be translated to the language of the theorem prover. This thesis describes a tool for translating from TIOA, the formal language …
-
TEMPLAR : efficient determination of relevant axioms in big formula sets for theorem proving
… selection system for classical first order theorem proving based on the relevance of formulae for the proof of a conjecture. It is based on unifiability of predicates and is also able to use a linguistic approach for the selection. The scope of the technique is the reduction of the set of …
-
Input Transformations and Resolution Implementation Techniques for Theorem Proving in First-Order Logic (Clause Form, Discrimination Networks, Heuristic Search, Locking Resolution)
This thesis describes a resolution based theorem prover designed for users with little or no knowledge of automated theorem proving. The prover is intended for high speed solution of small to moderate sized problems, usually with no user guidance. This contrasts with many provers designed to use …
-
Constraints, a model of computation
… satisfaction is applied to logic programming and theorem proving. It is shown that incorporating constraint solving in definite clause programs enhances their expressive power. Also, an alternative semantics - based on constraint satisfaction - is given for theorem proving.
-
Term rewriting with built-in numbers and collection data structures
… is investigated, and automatic termination proving for term rewrite systems has received increased interest in recent years. Ordinary term rewrite systems, however, exhibit serious drawbacks. First, they do not provide a tight integration of natural numbers or integers. Since the pre-defined …
-
Steps towards proof construction using reinforcement learning : environments and models for hypothesis-posing as subtask creation
… first tasks seen as susceptible to automation: theorem proving. I present steps towards training agents to construct proofs through utilizing the ability to pose hypotheses as a way to uncover information and break tasks down into subtasks. To do so, I create a novel bitstring problem that …
-
Termination of non-simple rewrite systems
… Showing termination is an important component of theorem proving and of great interest in programming languages.
-
Nelson Oppen combination as a rewrite theory
… matrices to demonstrate its use in automated theorem proving, and with hereditarily finite sets with reals to show its use with non-convex theories. This is done using both SMT solvers written in Maude itself via reflection (Variant-based satisfiability) and using external solvers (CVC4 and …
-
Semantic unification for convergent systems
… matching constitute an important component of theorem proving and programming language interpreters.
Page 1 of 4