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 168 for “"Theorem Prover"”.

  1. Automatický theorem prover

    Tato bakalářská práce se zabývá implementací systému pro automatické dokazování vět výrokové a predikátové logiky používajícím rezoluci. Cílem této práce je vytvořit jednoduchý systém a zdokumentovat jeho vývoj, nikoliv tvorba konkurenceschopného systému. Dále je v práci představeno několik …

    brno-tech Repository record for Automatický theorem prover (opens in a new tab)

  2. A self-verifying theorem prover

    … so instead we create and check them with theorem-proving software. This software must be advanced enough to make the proof process tractable, but this very sophistication casts doubt upon the whole enterprise: who verifies the verifier? We begin with a simple proof checker, Level 1, that …

    texas Repository record for A self-verifying theorem prover (opens in a new tab)

  3. The linear resolution theorem prover

    A resolution-based theorem prover (LRTP) has been built on the PROLOG/MTS system. The LRTP is designed for studying the performance of three resolution strategies, namely, linear input resolution, linear resolution, and ordered linear deduction. It allows the user to perform experiments on the …

    ubc Repository record for The linear resolution theorem prover (opens in a new tab) Download PDF for The linear resolution theorem prover (opens in a new tab)

  4. Liquid Haskell: Haskell as a theorem prover

    … about their code, thus turning Haskell into a theoremprover. Transforming a mature language — with optimized libraries and highly tuned parallelism — into a theorem prover enables us to verify a wide variety of properties on real world applications. We used LIQUID HASKELL to verify shallow …

    greece Repository record for Liquid Haskell: Haskell as a theorem prover (opens in a new tab)

  5. 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 …

    concordia Download PDF for Proof Recommendation for the HOL4 Theorem Prover (opens in a new tab)

  6. Deep Learning Recommendations for the ACL2 Interactive Theorem Prover

    … automating proof search in interactive theorem provers. Despite being a theorem prover with an active community and plentiful corpus of 170,000+ theorems, no deep learning system currently exists to help automate theorem proving in ACL2. We have developed a machine learning system that …

    calpoly Repository record for Deep Learning Recommendations for the ACL2 Interactive Theorem Prover (opens in a new tab)

  7. An Interactive Theorem Prover for First-Order Dynamic Logic

    … and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the …

    brock Repository record for An Interactive Theorem Prover for First-Order Dynamic Logic (opens in a new tab)

  8. The verification of MDG algorithms in the HOL theorem prover

    … equivalence checking) or deductive reasoning (theorem proving). Indeed, the combination of the two approaches, states exploration and deductive reasoning promises to overcome the limitation and to enhance the capabilities of each. Our research is motivated by this goal. In this thesis, we …

    concordia Download PDF for The verification of MDG algorithms in the HOL theorem prover (opens in a new tab)

  9. Parallelizing an interactive theorem prover : functional programming and proofs with ACL2

    … systems have become commonplace, however, theorem provers often do not take advantage of the additional computing resources in an interactive setting. This research explores automatically using these additional resources to lessen the delay between when users submit conjectures to the …

    texas Repository record for Parallelizing an interactive theorem prover : functional programming and proofs with ACL2 (opens in a new tab)

  10. A verified framework for symbolic execution in the ACL2 theorem prover

    Mechanized theorem proving is a promising means of formally establishing facts about complex systems. However, in applying theorem proving methodologies to industrial-scale hardware and software systems, a large amount of user interaction is required in order to prove useful properties. In …

    texas Repository record for A verified framework for symbolic execution in the ACL2 theorem prover (opens in a new tab)

  11. An Investigation into Three Games Using Isabelle, A Generic Theorem Prover

    … investigation of these properties is a generic theorem proving software called Isabelle. Isabelle is a generic logical framework written in ML and based on a subset of higher- order logic called meta-logic.

    oregon Repository record for An Investigation into Three Games Using Isabelle, A Generic Theorem Prover (opens in a new tab)

  12. Formalizing the Excluded Minor Characterization of Binary Matroids in the Lean Theorem Prover

    … of matroids over fields. Tutte's seminal theorem proven in 1958 characterizes matroids representable over GF(2) by noncontainment of U2,4 as a matroid minor. In this thesis, we document a formalization of the theorem and its proof in the Lean Theorem Prover, building on its community-built …

    waterloo Repository record for Formalizing the Excluded Minor Characterization of Binary Matroids in the Lean Theorem Prover (opens in a new tab)

  13. Verifying filesystems for abstract separation logic-based program verification in the ACL2 theorem prover

    … of FAT32 in the language of the ACL2 theorem prover. Devising HiFAT, a directory-tree model of FAT32, we prove it to abstract LoFAT. This refinement relationship allows us to quickly prototype a number of filesystem calls in LoFAT, which we later replace with more efficient …

    texas Repository record for Verifying filesystems for abstract separation logic-based program verification in the ACL2 theorem prover (opens in a new tab)

  14. Program verification using dynamic invariants and theorem prover: Exploratory study on Daikon and SAW

    … years, SMT/SAT solver based proof assistants and theorem provers have been deployed to prove desirable (e.g., necessary pre-/post-conditions of functions) properties of programs in a semi-automatic fashion relying on some expert knowledge and guidance. In this context, we investigate the viability …

    iastate Repository record for Program verification using dynamic invariants and theorem prover: Exploratory study on Daikon and SAW (opens in a new tab)

  15. Analyzing the selection of the herbrand base process for building a Smart Semantic Tree Theorem Prover

    … from the initial clause set in a particular theorem. When searching for a closed semantic tree, the selection of suitable atoms from the Herbrand Base is very important and should be carried out carefully by educated guesses in order to avoid building a tree using atoms which are irrelevant …

    birmingham Download PDF for Analyzing the selection of the herbrand base process for building a Smart Semantic Tree Theorem Prover (opens in a new tab)

  16. Reasoning About Loops Over Arrays using Vampire Loop Invariant Generation using a First-Order Theorem Prover

    … invariant generation using a first-order theorem prover was first introduced by the work of Kovacs and Voronkov [KV09a] in 2009. This approach employs a theorem prover, in our case the Vampire, as consequences inferencing engine and further to perform the symbol elimination for invariant …

    chalmers Repository record for Reasoning About Loops Over Arrays using Vampire Loop Invariant Generation using a First-Order Theorem Prover (opens in a new tab)

  17. Ciklais paremta išvedimo paieška tiesinio laiko logikai /

    … of loop-type linear temporal logic automatic theorem prover. It allows the proving of GLT sequent calculus formulas. Linear temporal logic semantics and sintax is described. The chosen data structures for automatic theorem proving are empirically tested for their validity and fit. Used …

    vilnius Repository record for Ciklais paremta išvedimo paieška tiesinio laiko logikai / (opens in a new tab)

  18. A modern Isabelle-based prover for VDM's logic of partial functions

    … and verification tools, often, employ theorem proving technology. This technology encompasses an underlying logic encoded in a theorem prover. VDM-LPF, first developed by Sten Agerholm and Jacob Frost in 1996, encodes VDM's Logic of Partial Functions (LPF) by extending the generic …

    concordia Download PDF for A modern Isabelle-based prover for VDM's logic of partial functions (opens in a new tab)

Page 1 of 9