Finite Countermodel Based Verification for Program Transformation (A Case Study)

Abstract

Both automatic program verification and program transformation are based on program analysis. In the past decade a number of approaches using various automatic general-purpose program transformation techniques (partial deduction, specialization, supercompilation) for verification of unreachability properties of computing systems were introduced and demonstrated [10,19,30,36]. On the other hand, the semantics based unfold-fold program transformation methods pose themselves diverse kinds of reachability tasks and try to solve them, aiming at improving the semantics tree of the program being transformed. That means some general-purpose verification methods may be used for strengthening program transformation techniques. This paper considers the question how finite countermodels for safety verification method [34] might be used in Turchin's supercompilation method. We extract a number of supercompilation sub-algorithms trying to solve reachability problems and demonstrate use of an external model finder for solving some of the problems.

Verification of high-level transformations with inductive refinement types

“…There are similarities between our work and verification techniques based on program transformation [22,30]. Our systematic exploration of execution rules for abstraction is similar to unfolding, and widening is similar to folding.…”

Verification of Program Transformations with Inductive Refinement Types

“…There are similarities between our work and verification techniques based on program transformation [23,36]. Our systematic exploration of execution rules for abstraction is similar to unfolding, and widening is similar to folding.…”

Verification of high-level transformations with inductive refinement types

“…There are similarities between our work and verification techniques based on program transformation (e.g., [21,32]) like partial evaluation [29] and supercompilation [48]. Our systematic exploration of execution rules for abstraction is similar to unfolding, and our use of widening is similar to folding.…”