A Generalized Program Verification Workflow Based on Loop Elimination and SA Form
This paper presents a minimal model of the functioning of program verification and property checking tools based on (i) the encoding of loops as non-iterating programs, either conservatively, making use of invariants and assume/assert commands, or in a bounded way; and (ii) the use of an intermediate single-assignment (SA) form. The model captures the basic workflow of tools like Boogie, Why3, or CBMC, building on a clear distinction between operational and axiomatic semantics. This allows us to consider separately the soundness of program annotation, loop encoding, translation into SA form, and VC generation, as well as appropriate notions of completeness for each of these processes.
To the best of our knowledge, this is the first formalization of a bounded model checking of software technique, including soundness and completeness proofs using Hoare logic; we also give the first completeness proof of a deductive verification technique based on a conservative encoding of invariant-annotated loops with assume/assert in SA form, as well as the first soundness proof based on a program logic.
Mon 27 May Times are displayed in time zone: (GMT-04:00) Eastern Time (US & Canada) change
|14:00 - 14:25|
|14:25 - 14:40|
|14:40 - 15:05|
Verifying Channel Communication Correctness for a Multi-Core Cooperatively Scheduled Runtime Using CSP
|15:05 - 15:30|