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 provers"”.

  1. Finding Bugs in Functional Programs using Theorem Provers

    … investigates whether automated first-order theorem provers can be efficiently used to discover bugs in Haskell programs by extracting counterexamples to incorrect program properties. To enable counterexample extraction, we present an alternative translation from Haskell programs to …

    chalmers Repository record for Finding Bugs in Functional Programs using Theorem Provers (opens in a new tab)

  2. Proof output and machine learning for inductive theorem provers

    Automatic theorem provers have lately seen significant performance improvements by utilising knowledge from previously proven theorems using machine learning. HipSpec is an inductive theorem prover that has not yet explored this area, which is the primary motivation for this work. We lay a …

    chalmers Repository record for Proof output and machine learning for inductive theorem provers (opens in a new tab)

  3. Theorem Provers as Libraries -- An Approach to Formally Verifying Functional Programs

    … this hybridization is the titular concept -- a theorem prover as a library. The verification capabilities of this prover, HaskHOL, are introduced to a Haskell development environment as a GHC compiler plugin. Operating at the compiler level provides for a comparatively simpler integration and …

    ku Repository record for Theorem Provers as Libraries -- An Approach to Formally Verifying Functional Programs (opens in a new tab)

  4. Compiling Haskell into Lean: A Common Abstract Syntax for Haskell and Interactive Theorem Provers

    … and executable Lean code that users can prove theorems about. We conducted a case study using a heap sort algorithm to support our claim that HS-TO-LEAN produces verifiable Lean code. Our approach is inspired by recent advances in formal verification of Haskell programs in Coq, and we currently …

    chapman Repository record for Compiling Haskell into Lean: A Common Abstract Syntax for Haskell and Interactive Theorem Provers (opens in a new tab)

  5. WPTrans: um assistente para verificação de programas em Frama-C

    … automatic (mainly SMT solvers) and interactive theorem provers. Some proof obligations may be proved automatically, while others can be too complex to be solved by automatic theorem provers, requiring the users of Frama-C and WP to handle them manually. This approach usually requires a signi …

    brazil-ufrn Repository record for WPTrans: um assistente para verificação de programas em Frama-C (opens in a new tab)

  6. A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic

    Automated Theorem Provers (ATP) are software programs which carry out inferences over logico-mathematical systems, often with the goal of finding proofs to some given theorem. ATP systems are enormously powerful computer programs, capable of solving immensely difficult problems. Currently, many …

    usf Repository record for A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic (opens in a new tab)

  7. Finding, simplifying and presenting proofs automatically

    Automated theorem provers are computer programs that construct formal proofs of mathematical theorems. Given a set of axioms and a formula to prove, they try to determine whether the formula follows logically from the axioms. Producing a proof in reasonable time, however, is only one of the …

    lmu-germany Repository record for Finding, simplifying and presenting proofs automatically (opens in a new tab)

  8. 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)

  9. A simple proof checker for real-time systems

    … of formal rigor when compared with traditional theorem provers. In this approach, an abstract data type represents the hypotheses, claim, and pending proof obligations at each step. A complete proof is a program that generates a proof state with the derived claim and no pending obligations. The …

    ubc Repository record for A simple proof checker for real-time systems (opens in a new tab) Download PDF for A simple proof checker for real-time systems (opens in a new tab)

  10. Reinforcement learning for rule selection in end to end differentiable proving

    Neural Theorem Provers (NTPs) are neuro-symbolic models that combine deep learning with a system of logic. They can learn representations for data, induce rules, are naturally interpretable, come with built-in explanations for conclusions, and demonstrate the capacity for systematic generalization. …

    oxford Repository record for Reinforcement learning for rule selection in end to end differentiable proving (opens in a new tab)

  11. Reasoning about Java programs in higher order logic using PVS and Isabelle

    … are done with the use of interactive theorem provers,namely PVS and Isabelle. Both theorem provers are described in some detail, resulting in a comparison of the strong and weak points of both systems. A Hoare logic is discussed, which is especially tailored to reasoning about Java. …

    radboud Repository record for Reasoning about Java programs in higher order logic using PVS and Isabelle (opens in a new tab) Download PDF for Reasoning about Java programs in higher order logic using PVS and Isabelle (opens in a new tab)

  12. An analysis and implementation of linear derivation strategies

    … the ME -TP, SL-TP, GC-TP, SLM-TP and SLM5-TP theorem provers respectively. In addition to the original features of each derivation strategy, the following search strategies were included in the implementations : the modified consecutively bounded depth-first search unit preference strategy, …

    edithcowan Repository record for An analysis and implementation of linear derivation strategies (opens in a new tab)

  13. A Proof-Theoretic Approach to Mathematical Knowledge Management

    … research that is forever growing. Definitions, theorems, axioms, and proofs are integral part of every area of mathematics. The relationships between these elements bring to light the elegant abstractions that bind even the most intricate aspects of math and science. As the body of mathematics …

    cornell Repository record for A Proof-Theoretic Approach to Mathematical Knowledge Management (opens in a new tab)

  14. 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)

  15. 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)

  16. A Reconciliation of Logical Representations of Space: from Multidimensional Mereotopology to Geometry

    … Throughout the thesis, we utilize automated theorem provers to assist with the verification of all ontologies by constructing nontrivial models and by proving key properties about the axiomatized relations and functions. Theorem provers are also utilized to obtain some of the integration …

    toronto-retro Repository record for A Reconciliation of Logical Representations of Space: from Multidimensional Mereotopology to Geometry (opens in a new tab)

  17. Generalization, lemma generation, and induction in ACL2

    … the formal verification tools available today, theorem provers offer the ability to do the most complete verification of the most complex systems. However, theorem proving requires expert guidance and typically is too costly to be economical for all but the most mission critical systems. Three …

    texas Repository record for Generalization, lemma generation, and induction in ACL2 (opens in a new tab)

  18. Evaluation of a new recursion induction principle for automated induction

    … input. Many of today’s cutting-edge automated theorem provers use structural induction, which makes it impossible for them to prove properties about non-structurally recursive functions. We introduce a new induction principle, where the induction is done over a function application. This …

    chalmers Repository record for Evaluation of a new recursion induction principle for automated induction (opens in a new tab)

  19. An algorithm for parallel subsumption

    "Many current automated theorem provers use a refutation procedure based on some version of the principle of resolution. These methods normally lead to the generation of large numbers of new clauses. Subsumption is a process that eliminates the superfluous clauses from the clause space, thus …

    must-thes Repository record for An algorithm for parallel subsumption (opens in a new tab)

Page 1 of 4