Verified Construction of Static Single Assignment Form


Title: Verified Construction of Static Single Assignment Form
Authors: Sebastian Ullrich (sebasti /at/ nullri /dot/ ch) and Denis Lohner
Submission date: 2016-02-05

We define a functional variant of the static single assignment (SSA) form construction algorithm described by Braun et al., which combines simplicity and efficiency. The definition is based on a general, abstract control flow graph representation using Isabelle locales.

We prove that the algorithm's output is semantically equivalent to the input according to a small-step semantics, and that it is in minimal SSA form for the common special case of reducible inputs. We then show the satisfiability of the locale assumptions by giving instantiations for a simple While language.

Furthermore, we use a generic instantiation based on typedefs in order to extract OCaml code and replace the unverified SSA construction algorithm of the CompCertSSA project with it.

A more detailed description of the verified SSA construction can be found in the paper Verified Construction of Static Single Assignment Form, CC 2016.

  author  = {Sebastian Ullrich and Denis Lohner},
  title   = {Verified Construction of Static Single Assignment Form},
  journal = {Archive of Formal Proofs},
  month   = feb,
  year    = 2016,
  note    = {\url{},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Depends on: Collections, Dijkstra_Shortest_Path, Slicing
Used by: Minimal_SSA
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.