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 7 of 7 for “"Inductive proofs"”.

  1. Extending Model Checking Using Inductive Proofs in Distributed Digital Currency Protocols

    … theorem provers allow for machine-checked proofs. These proofs can include inductive reasoning which allows them to reason about an arbitrarily large number of entities. However, proving safety and liveness properties in these proofs can be difficult. This work explores how combining model …

    byu Repository record for Extending Model Checking Using Inductive Proofs in Distributed Digital Currency Protocols (opens in a new tab) Download PDF for Extending Model Checking Using Inductive Proofs in Distributed Digital Currency Protocols (opens in a new tab)

  2. Proof output and machine learning for inductive theorem provers

    … 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 foundation for supporting machine learning implementations within HipSpec. Firstly, a format for representing inductive proofs of …

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

  3. Automated Discovery of Conditional Lemmas in Hipster

    … a tool for theory exploration and automation of inductive proofs for the proof assistant Isabelle/HOL. The purpose of theory exploration is to automate the discovery (and proof) of new lemmas of interest within a theory development, enriching the background theory and providing necessary missing …

    chalmers Repository record for Automated Discovery of Conditional Lemmas in Hipster (opens in a new tab)

  4. Reasoning with !-graphs

    … be built on this to allow the formalisation of inductive proofs in the string diagrams of compact closed and traced symmetric monoidal categories.</p> <p>String diagrams provide an intuitive method for reasoning about monoidal categories. However, this does not negate the ability for those using …

    oxford Repository record for Reasoning with !-graphs (opens in a new tab)

  5. Cohomology rings of arrangements

    … are proved. It is shown that they allow inductive proofs of exact formulas if products vanish in certain cases. The necessary vanishing result for affine arrangements is obtained by a simple geometric argument. The corresponding result for projective arrangements is considerably harder. …

    fu-berlin Repository record for Cohomology rings of arrangements (opens in a new tab)

  6. Inductive Validity Cores

    Symbolic model checkers can construct proofs of properties over very complex models. However, the results reported by the tool when a proof succeeds do not generally provide much insight to the user. It is often useful for users to have traceability information related to the proof: which portions …

    umn Repository record for Inductive Validity Cores (opens in a new tab)

  7. Three-strand pretzel knots, knot Floer homology and concordance invariants

    … the invariant C(P(2a,-2b-1,2c+1)), allowing the inductive proofs presented in Chapter 5 determining this invariant to be more closely motivated by the Heegaard diagrams for this family of knots used by Eftekhary. Using the DA-bimodules defined by Ozsvath-Szabo in their algebraic construction, and …

    glasgow Download PDF for Three-strand pretzel knots, knot Floer homology and concordance invariants (opens in a new tab)