Proving correctness of compiler optimizations by temporal logic

  title={Proving correctness of compiler optimizations by temporal logic},
  author={David Lacey and Neil D. Jones and Eric Van Wyk and Carl Christian Frederiksen},
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: <i>I</i> ⇒ <i>I</i>′ if <i>&phis;</i>, where <i>I</i>, <i>I</i>′ are intermediate language instructions and <i>&phis;</i> is a property expressed in a temporal logic suitable for describing program data flow. Its reading: If the current program π contains an instruction of form <i>I</i> at some control point <i>p</i>, and if flow condition <i>&phis;</i> is satisfied at <i>p</i>, then replace <i>I</i… CONTINUE READING
Highly Cited
This paper has 111 citations. REVIEW CITATIONS

1 Figure or Table



Citations per Year

112 Citations

Semantic Scholar estimates that this publication has 112 citations based on the available data.

See our FAQ for additional information.