Abstract is missing.
- Race checking by context inferenceThomas A. Henzinger, Ranjit Jhala, Rupak Majumdar. 1-13 [doi]
- KISS: keep it simple and sequentialShaz Qadeer, Dinghao Wu. 14-24 [doi]
- Verifying safety properties using separation and heterogeneous abstractionsEran Yahav, Ganesan Ramalingam. 25-34 [doi]
- Scalable lock-free dynamic memory allocationMaged M. Michael. 35-46 [doi]
- Kill-safe synchronization abstractionsMatthew Flatt, Robby Findler. 47-58 [doi]
- Min-cut program decomposition for thread-level speculationTroy A. Johnson, Rudolf Eigenmann, T. N. Vijaykumar. 59-70 [doi]
- A cost-driven compilation framework for speculative parallelization of sequential programsZhao-Hui Du, Chu-Cheow Lim, Xiao-Feng Li, Chen Yang, Qingyu Zhao, Tin-Fook Ngai. 71-81 [doi]
- Vectorization for SIMD architectures with alignment constraintsAlexandre E. Eichenberger, Peng Wu, Kevin O Brien. 82-93 [doi]
- Cost effective dynamic program slicingXiangyu Zhang, Rajiv Gupta. 94-106 [doi]
- Dynamic path-based software watermarkingChristian S. Collberg, Edward Carter, Saumya K. Debray, Andrew Huntwork, John D. Kececioglu, Cullen Linn, Michael Stepp. 107-118 [doi]
- Parametric analysis for adaptive computation offloadingCheng Wang, Zhiyuan Li. 119-130 [doi]
- Cloning-based context-sensitive pointer alias analysis using binary decision diagramsJohn Whaley, Monica S. Lam. 131-144 [doi]
- Symbolic pointer analysis revisitedJianwen Zhu, Silvian Calman. 145-157 [doi]
- Jedd: a BDD-based relational extension of JavaOndřej Lhoták, Laurie J. Hendren. 158-169 [doi]
- Social processes and proofs of theorems and programs, revisitedAndrew W. Appel. 170 [doi]
- Fast searches for effective optimization phase sequencesPrasad Kulkarni, Stephen Hines, Jason Hiser, David B. Whalley, Jack W. Davidson, Douglas L. Jones. 171-182 [doi]
- Inducing heuristics to decide whether to scheduleJohn Cavazos, J. Eliot B. Moss. 183-194 [doi]
- The liberty structural specification language: a high-level modeling language for component reuseManish Vachharajani, Neil Vachharajani, David I. August. 195-206 [doi]
- The set constraint/CFL reachability connection in practiceJohn Kodumal, Alexander Aiken. 207-218 [doi]
- Parametric regular path queriesYanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D. Stoller, Nanjun Hu. 219-230 [doi]
- Precise and efficient static array bound checking for large embedded C programsArnaud Venet, Guillaume P. Brat. 231-242 [doi]
- Region inference for an object-oriented languageWei-Ngan Chin, Florin Craciun, Shengchao Qin, Martin C. Rinard. 243-254 [doi]
- Array regrouping and structure splitting using whole-program reference affinityYutao Zhong, Maksim Orlovich, Xipeng Shen, Chen Ding. 255-266 [doi]
- Prefetch inection based on hardware monitoring and object metadataAli-Reza Adl-Tabatabai, Richard L. Hudson, Mauricio J. Serrano, Sreenivas Subramoney. 267-276 [doi]
- A generalized algorithm for graph-coloring register allocationMichael D. Smith, Norman Ramsey, Glenn H. Holloway. 277-288 [doi]
- Balancing register allocation across threads for a multithreaded network processorXiaotong Zhuang, Santosh Pande. 289-300 [doi]