Abstract is missing.
- Checking race freedom via linear programmingTachio Terauchi. 1-10 [doi]
- Race directed random testing of concurrent programsKoushik Sen. 11-21 [doi]
- Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performanceStephen M. Blackburn, Kathryn S. McKinley. 22-32 [doi]
- A study of concurrent real-time garbage collectorsFilip Pizlo, Erez Petrank, Bjarne Steensgaard. 33-44 [doi]
- Conditional correlation analysis for safe region-based memory managementXi Wang, Zhilei Xu, Xuezheng Liu, Zhenyu Guo, Xiaoge Wang, Zheng Zhang. 45-55 [doi]
- Automatic volume management for programmable microfluidicsAhmed M. Amin, Mithuna Thottethodi, T. N. Vijaykumar, Steven Wereley, Stephen C. Jacobson. 56-67 [doi]
- Foundations of the C++ concurrency memory modelHans-Juergen Boehm, Sarita V. Adve. 68-78 [doi]
- Expressive and safe static reflection with MorphJShan Shan Huang, Yannis Smaragdakis. 79-89 [doi]
- Iterative optimization in the polyhedral model: part ii, multidimensional timeLouis-Noël Pouchet, Cédric Bastoul, Albert Cohen, John Cavazos. 90-100 [doi]
- A practical automatic polyhedral parallelizer and locality optimizerUday Bondhugula, Albert Hartono, J. Ramanujam, P. Sadayappan. 101-113 [doi]
- Orchestrating the execution of stream programs on multicore platformsManjunath Kudlur, Scott A. Mahlke. 114-124 [doi]
- Deriving linearizable fine-grained concurrent objectsMartin T. Vechev, Eran Yahav. 125-135 [doi]
- Sketching concurrent data structuresArmando Solar-Lezama, Christopher Grant Jones, Rastislav Bodík. 136-148 [doi]
- SharC: checking data sharing strategies for multithreaded CZachary R. Anderson, David Gay, Robert Ennals, Eric A. Brewer. 149-158 [doi]
- Liquid typesPatrick M. Rondon, Ming Kawaguchi, Ranjit Jhala. 159-169 [doi]
- Certifying low-level programs with hardware interrupts and preemptive threadsXinyu Feng, Zhong Shao, Yuan Dong, Yu Guo. 170-182 [doi]
- Type-preserving compilation for large-scale optimizing object-oriented compilersJuan Chen, Chris Hawblitzel, Frances Perry, Mike Emmi, Jeremy Condit, Derrick Coetzee, Polyvios Pratikaki. 183-192 [doi]
- Quantitative information flow as network flow capacityStephen McCamant, Michael D. Ernst. 193-205 [doi]
- Grammar-based whitebox fuzzingPatrice Godefroid, Adam Kiezun, Michael Y. Levin. 206-215 [doi]
- Register allocation by puzzle solvingFernando Magno Quintão Pereira, Jens Palsberg. 216-226 [doi]
- Copy coalescing by graph recoloringSebastian Hack, Gerhard Goos. 227-237 [doi]
- Efficient program execution indexingBin Xin, William N. Sumner, Xiangyu Zhang. 238-248 [doi]
- Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysisVineet Kahlon. 249-259 [doi]
- Explaining failures of program analysesDaniel von Dincklage, Amer Diwan. 260-269 [doi]
- Sound, complete and scalable path-sensitive analysisIsil Dillig, Thomas Dillig, Alex Aiken. 270-280 [doi]
- Program analysis as constraint solvingSumit Gulwani, Saurabh Srivastava, Ramarathnam Venkatesan. 281-292 [doi]
- Velodrome: a sound and complete dynamic atomicity checker for multithreaded programsCormac Flanagan, Stephen N. Freund, Jaeheon Yi. 293-303 [doi]
- Inferring locks for atomic sectionsSigmund Cherem, Trishul M. Chilimbi, Sumit Gulwani. 304-315 [doi]
- Dataflow analysis for concurrent programs using datarace detectionRavi Chugh, Jan Wen Voung, Ranjit Jhala, Sorin Lerner. 316-326 [doi]
- XMem: type-safe, transparent, shared memory for cross-runtime communication and coordinationMichal Wegiel, Chandra Krintz. 327-338 [doi]
- Discovering properties about arrays in simple programsNicolas Halbwachs, Mathias Péron. 339-348 [doi]
- Full functional verification of linked data structuresKaren Zee, Viktor Kuncak, Martin C. Rinard. 349-361 [doi]
- Fair stateless model checkingMadanlal Musuvathi, Shaz Qadeer. 362-371 [doi]
- Model checking transactional memoriesRachid Guerraoui, Thomas A. Henzinger, Barbara Jobstmann, Vasu Singh. 372-382 [doi]