PPT-Weakest Precondition Synthesis for Compiler Optimizations

Nuno Lopes and José Monteiro Deriving preconditions by hand is hard WPs are often nontrivial WPs derived by hand are often wrong Weaker preconditions expose more optimization opportunities. Lo Susan J Eggers Henry M Levy Sujay S Parekh and Dean M Tullsen Dept of Computer Science and Engineering Box 352350 University of Washington Seattle WA 981952350 jlo sparekh eggers levycswashingtonedu Dept of Computer Science and Engineering Univer A Weakest Precondition Model for Assembly Language Programs January 28, 20032SUM(N,X) = IF N0 SUM(N-1,X+N) ELSE XNotice that the arguments in the recursive call of SUM are computed by applying the Sumit Gulwani. (MSR Redmond). Ramarathnam. . Venkatesan. (MSR Redmond). Saurabh. . Srivastava. (. Univ. . of Maryland). TexPoint. fonts used in EMF. . Read the . TexPoint. manual before you delete this box.: . By Namita Dave. Overview. What are compiler optimizations?. Challenges with optimizations. Current Solutions. Machine learning techniques. Structure of Adaptive compilers. Introduction. O. ptimization . Prof. O. . Nierstrasz. Lecture notes by Marcus . Denker. © Marcus . Denker. Optimization. Roadmap. Introduction. Optimizations in the Back-end. The Optimizer. SSA Optimizations. Advanced Optimizations. Ross Tate. Michael Stepp. Sorin Lerner. University of California, San Diego. Optimizing by Hand. Original. for (i = 0; i < 50; i ). . for (j = 0; j < 50; j ). . img[i*50 j] = f(i, j);. Ross Tate. Michael Stepp. Sorin Lerner. University of California, San Diego. Optimizing by Hand. Original. for (i = 0; i < 50; i ). . for (j = 0; j < 50; j ). . img[i*50 j] = f(i, j);. Prof. Gennady . Pekhimenko. University of Toronto. Winter 2018. The content of this lecture is adapted from the lectures of . Todd Mowry and Phillip Gibbons. CSC D70: . Compiler Optimization. Introduction, Logistics. Ross Tate. Michael Stepp. Sorin Lerner. University of California, San Diego. Optimizing by Hand. Original. for (i = 0; i < 50; i ). . for (j = 0; j < 50; j ). . img[i*50 j] = f(i, j);. T. Chen, T. Moreau, Z. Jiang, L. Zheng, S. Jiao, E. Yan, H. Shen, M. Cowan, L. Wang, Y. Hu, L. . Ceze. , C. . Guestrin. , and A. Krishnamurthy . Presentation by Grzegorz . Preconditions . for . Compiler Optimizations. Nuno Lopes. Advisor. : José Monteiro. Automatic. . Synthesis. . of. . Weakest. . Preconditions. for . Compiler. . Optimizations. Expectations for Compilers. Nuno Lopes . and. José Monteiro. Deriving preconditions by hand is hard; WPs are often non-trivial. WPs derived by hand are often wrong!. Weaker preconditions expose more optimization opportunities. . Sagiv. Slides from . Zvonimir. . Rakamaric. . 2. First-Order Logic. A formal notation for mathematics, with expressions involving . Propositional symbols. Predicates. Functions and constant symbols. The Desired Brand Effect Stand Out in a Saturated Market with a Timeless Brand