Is Deductive Program Verification Mature Enough to be Taught to Software Engineers?

Abstract

Article 25fa pilot End User AgreementThis publication is distributed under the terms of Article 25fa of the Dutch Copyright Act (Auteurswet) with explicit consent by the author. Dutch law entitles the maker of a short scientific work funded either wholly or partially by Dutch public funds to make that work publicly available for no consideration following a reasonable period of time after the work was first published, provided that clear reference is made to the source of the first publication of the work.This publication is distributed under The Association of Universities in the Netherlands (VSNU) 'Article 25fa implementation' pilot project. In this pilot research outputs of researchers employed by Dutch Universities that comply with the legal requirements of Article 25fa of the Dutch Copyright Act are distributed online and free of cost or other barriers in institutional repositories. Research outputs are distributed six months after their first online publication in the original published version and with proper attribution to the source of the original publication.You are permitted to download and use the publication for personal purposes. All rights remain with the author(s) and/or copyrights owner(s) of this work. Any use of the publication other than authorised under this licence or copyright law is prohibited.If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons.

Efficient Verification of Optimized Code: Correct High-speed X25519

“…Like [31], only general purpose, well-understood verification methods were used. Why3 in particular has an easy learning curve [30]. Our method for translating C and assembly code into WhyML is straight-forward, and the AVR model of Section 4.1 can be validated, so trust in our results mainly resides with trusting the verification condition generation of Why3, the soundness of the automated provers, and the compilation-toolchain (C compiler, assembler and linker) used for producing AVR binaries.…”

“…We describe our approach in using Why3 for this verification task; this is an extension of earlier work [29], and has been demonstrated to be have low barrier to understanding [30]. This approach would work similarly well for other architectures such as ARM or RISC-V.…”

Efficient Verification of Optimized Code

“…Like [32], only general purpose, well-understood verification methods were used. Why3 in particular has an easy learning curve [31]. Our method for translating C and assembly code into WhyML is straight-forward, and the AVR model of Sect.…”

“…We describe our approach in using Why3 for this verification task; this is an extension of earlier work [30], and has been demonstrated to have a low barrier to understanding [31]. This approach should work similarly well for other architectures such as ARM or RISC-V.…”