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 “"proof automation"”.

  1. Proof Automation for Fine-Grained Concurrent Separation Logic

    … The second group focuses on verification automation, but expects the user to fully trust the tool or logic. Verification that is both automated and highly reliable was not possible with the existing body of research. In this thesis, we present the first study that does both: automatic and …

    radboud Repository record for Proof Automation for Fine-Grained Concurrent Separation Logic (opens in a new tab) Download PDF for Proof Automation for Fine-Grained Concurrent Separation Logic (opens in a new tab)

  2. Push-Button Verification of Systems Software

    … requiring developers to write many lines of proof code for every line of implementation code. This is a considerable engineering effort that requires a high degree of expertise to achieve. This dissertation explores a new approach to designing, specifying, implementing, and verifying systems …

    washington Repository record for Push-Button Verification of Systems Software (opens in a new tab)

  3. HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs

    … that are beyond the scope of other formal proof tools, while providing a high degree of proof automation. The soundness of the system is ensured by adhering to a definitional approach: New constants and types are defined in terms of previous concepts, without introducing new axioms. Major …

    portland-state Repository record for HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs (opens in a new tab)

  4. Coinductive program verification

    … We also demonstrate a comfortable level of proof automation for several languages and domains, using a common overall heuristic strategy instantiated with customized subroutines. Manual assistance is also smoothly integrated where automation is not completely successful.

    uiuc Repository record for Coinductive program verification (opens in a new tab)

  5. Automation for Proof Engineering: Machine-Checked Proofs At Scale

    Formal proofs, interactively developed and machine-checked, are a means to achieve the highest level of assurance in the correctness of software. In larger verification projects, with multi-year timelines and hundreds of thousands of lines of proof text, the emerging discipline of proof engineering …

    unsw Repository record for Automation for Proof Engineering: Machine-Checked Proofs At Scale (opens in a new tab)

  6. Automated Analysis in Generic Groups

    … statement of an assumption, and outputs either a proof of its generic hardness or shows an algebraic attack against the assumption. Structure-preserving signatures are signature schemes defined over bilinear groups in which messages, public keys and signatures are group elements, and the …

    penn Repository record for Automated Analysis in Generic Groups (opens in a new tab)

  7. Proof Repair

    … to large and critical systems—an era of proof engineering. Proof engineering is for verified systems what software engineering is for unverified systems. Still, while proof engineering—like software engineering—is about both development and maintenance, most proof engineering technologies …

    washington Repository record for Proof Repair (opens in a new tab)