Essays about: "HOL4"

Found 3 essays containing the word HOL4.

  1. 1. Proof-producing resolution of indirect jumps in the binary intermediate representation BIR

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Adrian Westerberg; [2021]
    Keywords : Formal verification; Binary analysis; Interactive theorem proving; Indirect jump resolution; Formell verifiering; Binär analys; Interaktiv teorembevisning; Indirekt hopp bestämning;

    Abstract : HolBA is a binary analysis library that can be used to formally verify binary programs using contracts. It is developed in the interactive theorem prover HOL4 to achieve a high degree of trust in verification, the result of verification is a machine-checked proof demonstrating its correctness. This thesis presents two proof-producing procedures. READ MORE

  3. 2. Verifying Correctness of Contract Decompositions

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Gustav Hedengran; [2020]
    Keywords : ;

    Abstract : The importance of verification in safety critical systems is well known. However, due to the complexity of verification, the task of formally verifying large safety-critical systems might prove computationally infeasible in many cases. Compositional verification is a technique aimed at enabling verification of large safety-critical systems. READ MORE

  4. 3. Provably Sound and Secure Automatic Proving and Generation of Verification Conditions

    University essay from KTH/Teoretisk datalogi, TCS

    Author : Didrik Lundberg; [2018]
    Keywords : HOL4; HOL; Higher-order logic; SML; Poly ML; Formal methods; Axiomatic semantics; Formal verification; Static verification; Program verification; Hoare logic; Floyd-Hoare logic; ITP; Interactive theorem prover; Theorem prover; Proof assistant; BIR; Automated theorem proving; ATP; Automated deduction; Computer-assisted proof; Automated reasoning;

    Abstract : Formal verification of programs can be done with the aid of an interactive theorem prover. The program to be verified is represented in an intermediate language representation inside the interactive theorem prover, after which statements and their proofs can be constructed. This is a process that can be automated to a high degree. READ MORE