This is an old revision of the document!
@misc{li2021analytical, title={Analytical Characterization and Design Space Exploration for Optimization of CNNs}, author={Rui Li and Yufan Xu and Aravind Sukumaran-Rajam and Atanas Rountev and P. Sadayappan}, year={2021}, eprint={2101.09808}, archivePrefix={arXiv}, primaryClass={cs.LG}, url={https://arxiv.org/pdf/2101.09808.pdf} }
@article{10.1145/3434321, author = {Courant, Nathana\“{e}l and Leroy, Xavier}, title = {Verified Code Generation for the Polyhedral Model}, year = {2021}, issue_date = {January 2021}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, volume = {5}, number = {POPL}, url = {https://doi.org/10.1145/3434321}, doi = {10.1145/3434321}, abstract = {The polyhedral model is a high-level intermediate representation for loop nests that supports elegantly a great many loop optimizations. In a compiler, after polyhedral loop optimizations have been performed, it is necessary and difficult to regenerate sequential or parallel loop nests before continuing compilation. This paper reports on the formalization and proof of semantic preservation of such a code generator that produces sequential code from a polyhedral representation. The formalization and proofs are mechanized using the Coq proof assistant.}, journal = {Proc. ACM Program. Lang.}, month = jan, articleno = {40}, numpages = {24}, keywords = {Polyhedral model, Polyhedral code generation, Compiler verification} }
