Proving the Correctness of Compiler Optimizations Based on Strictness Analysis

Geoffrey L. Burn, Daniel Le Métayer. Proving the Correctness of Compiler Optimizations Based on Strictness Analysis. In Maurice Bruynooghe, Jaan Penjam, editors, Programming Language Implementation and Logic Programming, 5th International Symposium, PLILP 93, Tallinn, Estonia, August 25-27, 1993, Proceedings. Volume 714 of Lecture Notes in Computer Science, pages 346-364, Springer, 1993.

@inproceedings{BurnM93,
  title = {Proving the Correctness of Compiler Optimizations Based on Strictness Analysis},
  author = {Geoffrey L. Burn and Daniel Le Métayer},
  year = {1993},
  tags = {optimization, rule-based, analysis, compiler},
  researchr = {https://researchr.org/publication/BurnM93},
  cites = {0},
  citedby = {0},
  pages = {346-364},
  booktitle = {Programming Language Implementation and Logic Programming, 5th International Symposium, PLILP 93, Tallinn, Estonia, August 25-27, 1993, Proceedings},
  editor = {Maurice Bruynooghe and Jaan Penjam},
  volume = {714},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-57186-8},
}