diff options
Diffstat (limited to 'content/zettel/3a7a.md')
| -rw-r--r-- | content/zettel/3a7a.md | 37 |
1 files changed, 37 insertions, 0 deletions
diff --git a/content/zettel/3a7a.md b/content/zettel/3a7a.md new file mode 100644 index 0000000..6ea573e --- /dev/null +++ b/content/zettel/3a7a.md @@ -0,0 +1,37 @@ ++++ +title = "Proving compiler optimisations" +author = "Yann Herklotz" +tags = [] +categories = [] +backlinks = ["3a7"] +forwardlinks = ["3a7b"] +zettelid = "3a7a" ++++ + +\[1\] + +- Module for general Analysis information +- Use Kildall's algorithm to get information about what the compiler + knows at that instruction +- Algorithm is implemented generally in Module AnalysisEntries (AE) +- Module for general transformations (Transfer) +- Implement transformations based on module TransferEntries, which can + prove other properties about the transformation for you +- Transformations are then done by applying a functor which takes + TransferEntries and returns the Transfer module. + +<div id="refs" class="references csl-bib-body" markdown="1"> + +<div id="ref-bertot06_struc_approac_provin_compil_optim" +class="csl-entry" markdown="1"> + +<span class="csl-left-margin">\[1\] +</span><span class="csl-right-inline">Y. Bertot, B. Grégoire, and X. +Leroy, “A structured approach to proving compiler optimizations based on +dataflow analysis,” in *Types for proofs and programs*, J.-C. Filliâtre, +C. Paulin-Mohring, and B. Werner, Eds., Berlin, Heidelberg: Springer +Berlin Heidelberg, 2006, pp. 66–81.</span> + +</div> + +</div> |