CC 2013

13 papers

1. An Incremental Points-to Analysis with CFL-Reachability · Yi Lu, Lei Shang, Xinwei Xie, Jingling Xue
2. Architecture-Independent Dynamic Information Flow Tracking · Ryan Whelan, Tim Leek, David R. Kaeli
3. Automatic Generation of Program Affinity Policies Using Machine Learning · Ryan W. Moore, Bruce R. Childers
4. Compiler-Guided Identification of Critical Sections in Parallel Code · Stefan Kempf, Ronald Veldema, Michael Philippsen
5. Efficient and Effective Handling of Exceptions in Java Points-to Analysis · George Kastrinis, Yannis Smaragdakis
6. FESA: Fold- and Expand-Based Shape Analysis · Holger Siegel, Axel Simon
7. On LR Parsing with Selective Delays · Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz
8. On the Determination of Inlining Vectors for Program Optimization · Rosario Cammarota, Alexandru Nicolau, Alexander V. Veidenbaum, Arun Kejariwal, Debora Donato, Mukund Madhugiri
9. Optimal Register Allocation in Polynomial Time · Philipp Klaus Krause
10. Optimal and Heuristic Global Code Motion for Minimal Spilling · Gergö Barany, Andreas Krall
11. PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language · Somashekaracharya G. Bhaskaracharya, Uday Bondhugula
12. Refactoring MATLAB · Soroush Radpour, Laurie J. Hendren, Max Schäfer
13. Simple and Efficient Construction of Static Single Assignment Form · Matthias Braun, Sebastian Buchwald, Sebastian Hack, Roland Leißa, Christoph Mallon, Andreas Zwinkau