Compiler Design
暂无分享,去创建一个
[1] Xavier Leroy,et al. Verified validation of lazy code motion , 2009, PLDI '09.
[2] Akihiko Takano,et al. Shortcut deforestation in calculational form , 1995, FPCA '95.
[3] Bjarne Steensgaard,et al. Points-to analysis in almost linear time , 1996, POPL '96.
[4] Helmut Seidl,et al. A Generic Framework for Interprocedural Analysis of Numerical Properties , 2005, SAS.
[5] Robert Paige,et al. Symbolic Finite Differencing - Part I , 1990, ESOP.
[6] Helmut Seidl,et al. Analysis of modular arithmetic , 2005, TOPL.
[7] Helmut Seidl,et al. Constraints to Stop Deforestation , 1998, Sci. Comput. Program..
[8] Jacob T. Schwartz,et al. Reduction in Strength of High Level Operations , 1977, POPL.
[9] Reinhard Wilhelm,et al. Parametric shape analysis via 3-valued logic , 1999, POPL '99.
[10] Steven S. Muchnick,et al. Advanced Compiler Design and Implementation , 1997 .
[11] Alan Mycroft,et al. The Theory and Practice of Transforming Call-by-need into Call-by-value , 1980, Symposium on Programming.
[12] G. Ramalingam,et al. On loops, dominators, and dominance frontiers , 2002, TOPL.
[13] Axel Simon. Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities , 2008 .
[14] Helmut Seidl,et al. Precise interprocedural analysis through linear algebra , 2004, POPL.
[15] Laurie J. Hendren,et al. Practical virtual method call resolution for Java , 2000, OOPSLA '00.
[16] Philip Wadler,et al. Deforestation: Transforming Programs to Eliminate Trees , 1988, Theoretical Computer Science.
[17] Saman P. Amarasinghe,et al. Strength Reduction of Integer Division and Modulo Operations , 2001, LCPC.
[18] I. V. Ramakrishnan,et al. Small domains spell fast strictness analysis , 1989, POPL '90.