Generating compiler optimizations from proofs

DOI10.1145/1706299.1706345zbMath1312.68047OpenAlexW2119664062MaRDI QIDQ5255097

Sorin Lerner, Ross Tate, Michael Stepp

Publication date: 11 June 2015

Published in: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.5709

zbMATH Keywords

compiler optimizationexplanation-based learningproof generalization

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Relational Decomposition

This page was built for publication: Generating compiler optimizations from proofs