Abstract is missing.
- Dynamic software updates: a VM-centric approachSuriya Subramanian, Michael W. Hicks, Kathryn S. McKinley. 1-12 [doi]
- Safe and timely updates to multi-threaded programsIulian Neamtiu, Michael W. Hicks. 13-24 [doi]
- CEAL: a C-based language for self-adjusting computationMatthew Hammer, Umut A. Acar, Yan Chen. 25-37 [doi]
- PetaBricks: a language and compiler for algorithmic choiceJason Ansel, Cy P. Chan, Yee Lok Wong, Marek Olszewski, Qin Zhao, Alan Edelman, Saman P. Amarasinghe. 38-49 [doi]
- Staged information flow for javascriptRavi Chugh, Jeffrey A. Meister, Ranjit Jhala, Sorin Lerner. 50-62 [doi]
- Laminar: practical fine-grained decentralized information flow controlIndrajit Roy, Donald E. Porter, Michael D. Bond, Kathryn S. McKinley, Emmett Witchel. 63-74 [doi]
- Merlin: specification inference for explicit information flow problemsV. Benjamin Livshits, Aditya V. Nori, Sriram K. Rajamani, Anindya Banerjee. 75-86 [doi]
- TAJ: effective taint analysis of web applicationsOmer Tripp, Marco Pistoia, Stephen J. Fink, Manu Sridharan, Omri Weisman. 87-97 [doi]
- Lightweight annotations for controlling sharing in concurrent data structuresZachary R. Anderson, David Gay, Mayur Naik. 98-109 [doi]
- A randomized dynamic program analysis technique for detecting real deadlocksPallavi Joshi, Chang-Seo Park, Koushik Sen, Mayur Naik. 110-120 [doi]
- FastTrack: efficient and precise dynamic race detectionCormac Flanagan, Stephen N. Freund. 121-133 [doi]
- LiteRace: effective sampling for lightweight data-race detectionDaniel Marino, Madanlal Musuvathi, Satish Narayanasamy. 134-143 [doi]
- Progress guarantee for parallel programs via bounded lock-freedomErez Petrank, Madanlal Musuvathi, Bjarne Steensgaard. 144-154 [doi]
- Stretching transactional memoryAleksandar Dragojevic, Rachid Guerraoui, Michal Kapalka. 155-165 [doi]
- Parallelizing sequential applications on commodity hardware using a low-cost software transactional memoryMojtaba Mehrara, Jeff Hao, Po-Chun Hsu, Scott A. Mahlke. 166-176 [doi]
- Towards a holistic approach to auto-parallelization: integrating profile-driven parallelism detection and machine-learning based mappingGeorgios Tournavitis, Zheng Wang, Björn Franke, Michael F. P. O Boyle. 177-187 [doi]
- A decision procedure for subset constraints over regular languagesPieter Hooimeijer, Westley Weimer. 188-198 [doi]
- Verifiable composition of deterministic grammarsAugust Schwerdfeger, Eric {Van Wyk}. 199-210 [doi]
- Analyzing recursive programs using a fixed-point calculusSalvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato. 211-222 [doi]
- Program verification using templates over predicate abstractionSaurabh Srivastava, Sumit Gulwani. 223-234 [doi]
- GC assertions: using the garbage collector to check heap propertiesEdward Aftandilian, Samuel Z. Guyer. 235-244 [doi]
- SoftBound: highly compatible and complete spatial memory safety for cSantosh Nagarakatte, Jianzhou Zhao, Milo M. K. Martin, Steve Zdancewic. 245-258 [doi]
- Implementation of the memory-safe full ANSI-C compilerYutaka Oiwa. 259-269 [doi]
- Error propagation analysis for file systemsCindy Rubio-González, Haryadi S. Gunawi, Ben Liblit, Remzi H. Arpaci-Dusseau, Andrea C. Arpaci-Dusseau. 270-280 [doi]
- Sharing classes between familiesXin Qi, Andrew C. Myers. 281-292 [doi]
- Typed self-representationTillmann Rendel, Klaus Ostermann, Christian Hofer. 293-303 [doi]
- Type-based data structure verificationMing Kawaguchi, Patrick M. Rondon, Ranjit Jhala. 304-315 [doi]
- Verified validation of lazy code motionJean-Baptiste Tristan, Xavier Leroy. 316-326 [doi]
- Proving optimizations correct using parameterized program equivalenceSudipta Kundu, Zachary Tatlock, Sorin Lerner. 327-337 [doi]
- An integrated proof language for imperative programsKaren Zee, Viktor Kuncak, Martin C. Rinard. 338-351 [doi]
- Automatic generation of library bindings using static analysisTristan Ravitch, Steve Jackson, Eric Aderhold, Ben Liblit. 352-362 [doi]
- Snugglebug: a powerful approach to weakest preconditionsSatish Chandra, Stephen J. Fink, Manu Sridharan. 363-374 [doi]
- Control-flow refinement and progress invariants for bound analysisSumit Gulwani, Sagar Jain, Eric Koskinen. 375-385 [doi]
- A study of memory management for web-based applications on multicore processorsHiroshi Inoue, Hideaki Komatsu, Toshio Nakatani. 386-396 [doi]
- Efficiently and precisely locating memory leaks and bloatGene Novark, Emery D. Berger, Benjamin G. Zorn. 397-407 [doi]
- Chameleon: adaptive selection of collectionsOhad Shacham, Martin T. Vechev, Eran Yahav. 408-418 [doi]
- Go with the flow: profiling copies to find runtime bloatGuoqing Xu, Matthew Arnold, Nick Mitchell, Atanas Rountev, Gary Sevitsky. 419-430 [doi]
- Programming model for a heterogeneous x86 platformBratin Saha, Xiaocheng Zhou, Hu Chen, Ying Gao, Shoumeng Yan, Mohan Rajagopalan, Jesse Fang, Peinan Zhang, Ronny Ronen, Avi Mendelson. 431-440 [doi]
- Binary analysis for measurement and attribution of program performanceNathan R. Tallent, John M. Mellor-Crummey, Michael W. Fagan. 441-452 [doi]
- Semantics-aware trace analysisKevin J. Hoffman, Patrick Eugster, Suresh Jagannathan. 453-464 [doi]
- Trace-based just-in-time type specialization for dynamic languagesAndreas Gal, Brendan Eich, Mike Shaver, David Anderson, David Mandelin, Mohammad R. Haghighat, Blake Kaplan, Graydon Hoare, Boris Zbarsky, Jason Orendorff, Jesse Ruderman, Edwin W. Smith, Rick Reitmaier, Michael Bebenita, Mason Chang, Michael Franz. 465-478 [doi]