PLDI 2004: Washington, DC, USA

Safety checking

• Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar:
  Race checking by context inference. 1-13
  
• Shaz Qadeer, Dinghao Wu:
  KISS: keep it simple and sequential. 14-24
  
• Eran Yahav, G. Ramalingam:
  Verifying safety properties using separation and heterogeneous abstractions. 25-34
  

Threads

• Maged M. Michael:
  Scalable lock-free dynamic memory allocation. 35-46
  
• Matthew Flatt, Robert Bruce Findler:
  Kill-safe synchronization abstractions. 47-58
  

Parallelization

• Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykumar:
  Min-cut program decomposition for thread-level speculation. 59-70
  
• Zhao-Hui Du, Chu-Cheow Lim, Xiao-Feng Li, Chen Yang, Qingyu Zhao, Tin-Fook Ngai:
  A cost-driven compilation framework for speculative parallelization of sequential programs. 71-81
  
• Alexandre E. Eichenberger, Peng Wu, Kevin O'Brien:
  Vectorization for SIMD architectures with alignment constraints. 82-93
  

Potpourri

• Xiangyu Zhang, Rajiv Gupta:
  Cost effective dynamic program slicing. 94-106
  
• Christian S. Collberg, Edward Carter, Saumya K. Debray, Andrew Huntwork, John D. Kececioglu, Cullen Linn, Michael Stepp:
  Dynamic path-based software watermarking. 107-118
  
• Cheng Wang, Zhiyuan Li:
  Parametric analysis for adaptive computation offloading. 119-130
  

Pointer analysis and BDDs

• John Whaley, Monica S. Lam:
  Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. 131-144
  
• Jianwen Zhu, Silvian Calman:
  Symbolic pointer analysis revisited. 145-157
  
• Ondrej Lhoták, Laurie J. Hendren:
  Jedd: a BDD-based relational extension of Java. 158-169
  
• Andrew W. Appel:
  Social processes and proofs of theorems and programs, revisited. 170
  

Compiler and simulator construction

• Prasad A. Kulkarni, Stephen Hines, Jason Hiser, David B. Whalley, Jack W. Davidson, Douglas L. Jones:
  Fast searches for effective optimization phase sequences. 171-182
  
• John Cavazos, J. Eliot B. Moss:
  Inducing heuristics to decide whether to schedule. 183-194
  
• Manish Vachharajani, Neil Vachharajani, David I. August:
  The liberty structural specification language: a high-level modeling language for component reuse. 195-206
  

Program analysis

• John Kodumal, Alexander Aiken:
  The set constraint/CFL reachability connection in practice. 207-218
  
• Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D. Stoller, Nanjun Hu:
  Parametric regular path queries. 219-230
  
• Arnaud Venet, Guillaume P. Brat:
  Precise and efficient static array bound checking for large embedded C programs. 231-242
  

Memory management

• Wei-Ngan Chin, Florin Craciun, Shengchao Qin, Martin C. Rinard:
  Region inference for an object-oriented language. 243-254
  
• Yutao Zhong, Maksim Orlovich, Xipeng Shen, Chen Ding:
  Array regrouping and structure splitting using whole-program reference affinity. 255-266
  
• Ali-Reza Adl-Tabatabai, Richard L. Hudson, Mauricio J. Serrano, Sreenivas Subramoney:
  Prefetch inection based on hardware monitoring and object metadata. 267-276
  

Register allocation

• Michael D. Smith, Norman Ramsey, Glenn H. Holloway:
  A generalized algorithm for graph-coloring register allocation. 277-288
  
• Xiaotong Zhuang, Santosh Pande:
  Balancing register allocation across threads for a multithreaded network processor. 289-300
  

Last update Fri May 25 08:32:26 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page