1. What are the contributions in "Formalizing single-assignment program verification: an adaptation-complete approach" ?
In this paper the authors formalize program verification based on the translation of While programs annotated with loop invariants into a dynamic single-assignment language with a dedicated iterating construct, and the subsequent generation of compact, indeed linear-size, verification conditions.. The formalization is based on a program logic that the authors show to be adaptation-complete.. Although this important property has not, as far as the authors know, been established for any existing program verification tool, they believe that adaptation-completeness is one of the major motivations for the use of SA form as an intermediate language.
read more
2. What have the authors stated for future works in "Formalizing single-assignment program verification: an adaptation-complete approach" ?
The idea, which the authors will explore in future work, is to formalize this notion in a deductive setting, by obtaining a semantically justified bounded version of the VCGen of Section 4.
read more
3. What is the size of the VCs of a Hoare triple?
For left-associative sequences the size of this formula may still be quadratic, since the sequence clause duplicates the program formula ψ1 of C1; however, if sequences are represented in a right-associative way (a reasonable assumption for an intermediate language), the size of the resulting VCs is linear in the size of C in the worst-case.
read more
4. What is the structure of the interpretation of assertions?
For the interpretation of assertions the authors take the usual interpretation of first-order formulas, noting two facts: since assertions build on the language of program expressions their interpretation also depends on M (possibly extended to account for user-defined predicates and functions), and states from Σ can be used as variable assignments in the interpretation of assertions.
read more
