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 12 of 12 for “"automated theorem proving"”.

  1. Topics in Automated Theorem Proving and Program Generation

    This thesis contains two parts, each deals with a different subject.

    uiuc Repository record for Topics in Automated Theorem Proving and Program Generation (opens in a new tab)

  2. 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, …

    oldenburg Repository record for Differential dynamic logics - automated theorem proving for hybrid systems (opens in a new tab)

  3. Nelson Oppen combination as a rewrite theory

    … and integer 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 …

    uiuc Repository record for Nelson Oppen combination as a rewrite theory (opens in a new tab)

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

    uiuc Repository record for Input Transformations and Resolution Implementation Techniques for Theorem Proving in First-Order Logic (Clause Form, Discrimination Networks, Heuristic Search, Locking Resolution) (opens in a new tab)

  5. The Hob system for verifying software design properties

    … and very precise, unscalable, static analysis or automated theorem proving techniques to certain specific modules of that program: those that require the precision that such analyses can deliver. The use of assume/guarantee reasoning allows the analysis engine to harness the strengths of both …

    mit Repository record for The Hob system for verifying software design properties (opens in a new tab)

  6. Safety cases for the formal verification of automatically generated code

    Model-based development and automated code generation are increasingly used for actual production code, in particular in mathematical and engineering domains. However, since code generators are typically not qualified, there is no guarantee that their output is correct or even safe. Formal methods …

    soton Repository record for Safety cases for the formal verification of automatically generated code (opens in a new tab)

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

    potsdam-thes Repository record for TEMPLAR : efficient determination of relevant axioms in big formula sets for theorem proving (opens in a new tab)

  8. A Tool for Producing Verified, Explainable Proofs

    Mathematicians are reluctant to use interactive theorem provers. In this thesis I argue that this is because proof assistants don't emphasise explanations of proofs; and that in order to produce good explanations, the system must create proofs in a manner that mimics how humans would create proofs. …

    cambridge Repository record for A Tool for Producing Verified, Explainable Proofs (opens in a new tab)

  9. ProverX: rewriting and extending prover9

    O propósito principal deste projecto é tornar o demonstrador automático de teoremas Prover9 programável e, por conseguinte, extensível. Este propósito foi conseguido acrescentando um interpretador de Python, uma linha de comandos e uma biblioteca de módulos, objectos e funções escritos em Python …

    aberta Repository record for ProverX: rewriting and extending prover9 (opens in a new tab)

  10. Bibliotecas de axiomáticas: conceitos e resultados para sistemas algébricos

    Em 1996, EQP, um programa de computador, resolveu o Problema de Robbins, um problema colocado nos anos 30 e que tinha derrotado alguns dos maiores algebristas do século XX. Em julho de 2022, Enigma, uma ferramenta de inteligência arti cial aplicada à demonstração automática de teoremas produzida …

    aberta Repository record for Bibliotecas de axiomáticas: conceitos e resultados para sistemas algébricos (opens in a new tab)

  11. Αυτόματη παραγωγή και αξιολόγηση ασκήσεων και χρήση παιχνιδοποίησης σε ευφυή συστήματα διδασκαλίας

    Τα τελευταία χρόνια, η ραγδαία ανάπτυξη της τεχνολογίας και του διαδικτύου δεν θα μπορούσε να αφήσει ανεπηρέαστο τον τομέα των συστημάτων ηλεκτρονικής μάθησης (e-learning). Η χρήση του διαδικτύου άλλαξε τον τρόπο με τον οποίο παρέχεται η μάθηση στους εκπαιδευόμενους. Μια βασική και δημοφιλής …

    patras-thes Repository record for Αυτόματη παραγωγή και αξιολόγηση ασκήσεων και χρήση παιχνιδοποίησης σε ευφυή συστήματα διδασκαλίας (opens in a new tab)