Papers from Invited Talks

• 
  Michael I. Schwartzbach: Design Choices in a Compiler Course or How to Make Undergraduates Love Formal Notation. 1-15
• 
  Thomas W. Reps, Gogul Balakrishnan: Improved Memory-Access Analysis for x86 Executables. 16-35

Analyses and Transformations

• 
  Junghee Lim, Thomas W. Reps: A System for Generating Static Analyzers for Machine Instructions. 36-52
• 
  Atanas Rountev, Mariana Sharp, Guoqing (Harry) Xu: IDE Dataflow Analysis in the Presence of Large Object-Oriented Libraries. 53-68
• 
  Keith D. Cooper, Timothy J. Harvey, Todd Waterman: An Adaptive Strategy for Inline Substitution. 69-84
• 
  Marius Nita, Dan Grossman: Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts. 85-99

Compiling for Parallel Architectures

• 
  Ghulam Lashari, Ondrej Lhoták, Michael McCool: Control Flow Emulation on Tiled SIMD Architectures. 100-115
• 
  Franz Franchetti, Markus Püschel: Generating SIMD Vectorized Permutations. 116-131
• 
  Uday Bondhugula, Muthu Manikandan Baskaran, Sriram Krishnamoorthy, J. Ramanujam, Atanas Rountev, P. Sadayappan: Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model. 132-146

Runtime Techniques and Tools

• 
  Qin Zhao, Rodric M. Rabbah, Saman P. Amarasinghe, Larry Rudolph, Weng-Fai Wong: How to Do a Million Watchpoints: Efficient Debugging Using Dynamic Instrumentation. 147-162
• 
  Gregory B. Prokopski, Clark Verbrugge: Compiler-Guaranteed Safety in Code-Copying Virtual Machines. 163-177
• 
  Etienne Bergeron, Marc Feeley, Jean-Pierre David: Hardware JIT Compilation for Off-the-Shelf Dynamically Reconfigurable FPGAs. 178-192
• 
  Thomas Würthinger, Christian Wimmer, Hanspeter Mössenböck: Visualization of Program Dependence Graphs. 193-196

Analyses

• 
  Francesco Logozzo, Manuel Fähndrich: On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis. 197-212
• 
  Uday P. Khedker, Bageshri Karkare: Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method. 213-228
• 
  Chris Male, David J. Pearce, Alex Potanin, Constantine Dymnikov: Java Bytecode Verification for @NonNull Types. 229-244
• 
  Mark Marron, Manuel V. Hermenegildo, Deepak Kapur, Darko Stefanovic: Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models. 245-259

Atomicity and Transactions

• 
  Yu David Liu, Xiaoqi Lu, Scott F. Smith: Coqa: Concurrent Objects with Quantized Atomicity. 260-275
• 
  Dave Cunningham, Khilan Gudka, Susan Eisenbach: Keep Off the Grass: Locking the Right Path for Atomicity. 276-290
• 
  Cheng Wang, Victor Ying, Youfeng Wu: Supporting Legacy Binary Code in a Software Transaction Compiler with Dynamic Binary Translation and Optimization. 291-306

last updated on Sat May 25 04:46:47 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page