Print Email Facebook Twitter Mechanizing Hoare Style Proof Outlines for Imperative Programs in Agda Title Mechanizing Hoare Style Proof Outlines for Imperative Programs in Agda Author de Haas, Olav (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor van Deursen, A. (graduation committee) Krebbers, R.J. (graduation committee) Cockx, J.G.H. (graduation committee) Rouvoet, A.J. (mentor) Degree granting institution Delft University of Technology Programme Computer Science Date 2022-07-11 Abstract Formal verification of imperative programs can be carried out on paper by annotating programs to obtain an outline of a proof in the style of Hoare. This process has been mechanized by the introduction of Separation Logic and computer assisted verification tools. However, the tools fail to achieve the readability and convenience of manual paper proof outlines. This is a pity, because getting ideas and proofs across is essential for scientific research. I introduce a mechanization for proof outlines of imperative programs to interactively write human readable outlines in the dependently typed programming language and proof assistant Agda. I achieve this by introducing practical syntax and proof automation to write concise proof outlines for a simple imperative programming language based on λ-calculus. The proposed solution results in proof outlines that combine the readability of paper proof outlines and the precision of mechanization. Subject Programming LanguagesProof assistantSeparation LogicFormal VerificationProof AutomationAgda To reference this document use: http://resolver.tudelft.nl/uuid:5ca6e6f3-1242-4b86-8307-4ac4f4489951 Bibliographical note Implementation in Agda can be found at: https://github.com/Olavhaasie/hoare-proof-outlines Part of collection Student theses Document type master thesis Rights © 2022 Olav de Haas Files PDF Mechanizing_Hoare_Style_P ... e_Haas.pdf 332.15 KB Close viewer /islandora/object/uuid:5ca6e6f3-1242-4b86-8307-4ac4f4489951/datastream/OBJ/view