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 2289 for “"Proofs"”.

  1. Tactics From Proofs

    … The current construction of tactics from proofs does not yield sufficiently robust tactics. Proofs tend to be specific to the details of a specification and so are not reusable in general, e.g. the same proof may not work when the definition of a conjecture is changed. The major challenges …

    the-open-u Download PDF for Tactics From Proofs (opens in a new tab)

  2. Combining Proofs and Programs

    … languages allow us to develop programs and write proofs quickly and without errors, and the last decade has seen many success stories for verified programming with dependent types. Despite these successes, dependently typed languages are rarely used for day-to-day programming tasks. There are many …

    penn Repository record for Combining Proofs and Programs (opens in a new tab)

  3. Generic Programs and Proofs

    oxford Restricted access

  4. Proofs of Secure Erasure

    Ερευνούμε το πρόβλημα του ελέγχου της εσωτερικής κατάστασης μίας ενσωματωμένης απομακρυσμένης συσκευής, χρησιμοποιώντας πρωτόκολλα, που οι Tsudik και Perito εισήγαγαν ως αποδείξεις ασφαλούς διαγραφής. Αυτή είναι μια διαδικασία που πρέπει να λάβει χώρα σε πολλές περιπτώσεις, που κυμαίνονται από …

    athens Repository record for Proofs of Secure Erasure (opens in a new tab)

  5. Automata, Representations, And Proofs

    … theory of Kleene algebra. We also show that such proofs can be generated by a P SP ACE transducer. Finally, we discuss alternating automata in relation to our framework, and provide a determinizing functor.

    cornell Repository record for Automata, Representations, And Proofs (opens in a new tab)

  6. Aggregated Set Membership Proofs

    … for the verification of multiple zero-knowledge proofs. More precisely, verification of numerous zero-knowledge set membership proofs performed by a single verifier is considered. To reduce the computations required by such a verifier Aggregated Set Membership Proofs are introduced. Aggregated …

    chalmers Repository record for Aggregated Set Membership Proofs (opens in a new tab)

  7. Tools for semi-formal proofs

    … formally or informally. We hypothesize that such proofs are easier to check accurately, compared with standard informal prose proofs. Our framework is conceptually simple, and proofs written in it look similar to informal proofs. We also give the definitions and the main theorem on the correctness …

    ttu Repository record for Tools for semi-formal proofs (opens in a new tab)

  8. An exploration of mathematical proofs

    The purpose of this thesis is to teach methods of proving statements in mathematics. We will be dissecting proven statements and examining the individual steps to gain a greater understanding on how to prove statements. Mathematical literature such as books, textbooks, and lecture notes will be …

    twu Repository record for An exploration of mathematical proofs (opens in a new tab)

  9. Non-Constructivity in Security Proofs

    … three instances of non-constructive security proofs for cryptographic protocols in the literature: (1) a password-based key derivation function; (2) an HMAC-related message authentication code scheme; and (3) a round-optimal blind signature scheme.

    waterloo Repository record for Non-Constructivity in Security Proofs (opens in a new tab)

  10. Parallel Proofs for Parallel Programs

    This dissertation addresses the problem of automated reasoning about multi-threaded programs. Multi-threaded programs are notoriously prone to error, making them an attractive target for formal methods which can be used to \emph{guarantee} that programs satisfy desirable properties. …

    toronto-retro Repository record for Parallel Proofs for Parallel Programs (opens in a new tab)

  11. On Proofs of Sylow's Theorem

    We give five proofs of Sylow's Theorem. The proofs given will be Sylow's original proof, the Cauchy-Frobenius proof using double cosets, Frobenius' proof (two versions) using the class equation, and Wielandt's proof using subsets. We give a number of different examples to illustrate the various …

    mo-state Repository record for On Proofs of Sylow's Theorem (opens in a new tab)

  12. Quadratic Reciprocity: Proofs and Applications

    … The purpose of this thesis is to present several proofs as well as applications of the law of quadratic reciprocity. I will present three proofs of the quadratic reciprocity. We begin with a proof that depends on Gauss's lemma and Eisenstein's lemma. We then describe another proof due to Eisentein …

    mississippi Repository record for Quadratic Reciprocity: Proofs and Applications (opens in a new tab)

  13. Leveraging Parallelism in Interactive Proofs

    … is true. Since their introduction, interactive proofs have become one of the most fundamental concepts in theoretical computer science, and have led to breakthrough results across complexity theory and modern cryptography. In recent years, there has been immense interest in succinct proof …

    cornell Repository record for Leveraging Parallelism in Interactive Proofs (opens in a new tab)

  14. Machine-Assisted Proofs for Institutions

    Institution theory is the abstract study of logical systems using category theory. The theory has expanded since the ’80s to encompass and relate a wide range of concrete logical systems. But inducting particular logical systems into the theory can be tiresome—often straightforward, but repetitive, …

    maynooth Download PDF for Machine-Assisted Proofs for Institutions (opens in a new tab)

  15. Formalizing soundness proofs of SNARKs

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms

    uiuc Repository record for Formalizing soundness proofs of SNARKs (opens in a new tab)

  16. Practical Automaton proofs in PVS

    This thesis is about an approach to modeling, validating and verifying com- puter-based systems. The kinds of systems we examine happen to be em- bedded systems, for the most part, but our approach is generally applicable to computer-based systems. Since veri?cation is essential to the production …

    radboud Repository record for Practical Automaton proofs in PVS (opens in a new tab) Download PDF for Practical Automaton proofs in PVS (opens in a new tab)

Page 1 of 115