Abstract is missing.
- An analysis of the dynamic behavior of JavaScript programsGregor Richards, Sylvain Lebresne, Brian Burg, Jan Vitek. 1-12 [doi]
- Breadcrumbs: efficient context sensitivity for dynamic bug detection analysesMichael D. Bond, Graham Z. Baker, Samuel Z. Guyer. 13-24 [doi]
- Decoupled lifeguards: enabling path optimizations for dynamic correctness checking toolsOlatunji Ruwase, Shimin Chen, Phillip B. Gibbons, Todd C. Mowry. 25-35 [doi]
- Jinn: synthesizing dynamic bug detectors for foreign language interfacesByeongcheol Lee, Ben Wiedermann, Martin Hirzel, Robert Grimm, Kathryn S. McKinley. 36-49 [doi]
- Safe programmable speculative parallelismPrakash Prabhu, Ganesan Ramalingam, Kapil Vaswani. 50-61 [doi]
- Supporting speculative parallelization in the presence of dynamic data structuresChen Tian, Min Feng, Rajiv Gupta. 62-73 [doi]
- Cache topology aware computation mapping for multicoresMahmut T. Kandemir, Taylan Yemliha, Sai Prashanth Muralidhara, Shekhar Srikantaiah, Mary Jane Irwin, Yuanrui Zhang. 74-85 [doi]
- A GPGPU compiler for memory optimization and parallelism managementYi Yang, Ping Xiang, Jingfei Kong, Huiyang Zhou. 86-97 [doi]
- 2010 Athena lectureSusan Eggers. 98 [doi]
- Safe to the last instruction: automated verification of a type-safe operating systemJean Yang, Chris Hawblitzel. 99-110 [doi]
- Bringing extensibility to verified compilersZachary Tatlock, Sorin Lerner. 111-121 [doi]
- Ur: statically-typed metaprogramming with type-level record computationAdam J. Chlipala. 122-133 [doi]
- Parameterized verification of transactional memoriesMichael Emmi, Rupak Majumdar, Roman Manevich. 134-145 [doi]
- Schism: fragmentation-tolerant real-time garbage collectionFilip Pizlo, Lukasz Ziarek, Petr Maj, Antony L. Hosking, Ethan Blanton, Jan Vitek. 146-159 [doi]
- Detecting inefficiently-used containers to avoid bloatGuoqing (Harry) Xu, Atanas Rountev. 160-173 [doi]
- Finding low-utility data structuresGuoqing (Harry) Xu, Nick Mitchell, Matthew Arnold, Atanas Rountev, Edith Schonberg, Gary Sevitsky. 174-186 [doi]
- Evaluating the accuracy of Java profilersTodd Mytkowicz, Amer Diwan, Matthias Hauswirth, Peter F. Sweeney. 187-197 [doi]
- Green: a framework for supporting energy-conscious programming using controlled approximationWoongki Baek, Trishul M. Chilimbi. 198-209 [doi]
- GUESSTIMATE: a programming model for collaborative distributed systemsKaushik Rajan, Sriram K. Rajamani, Shashank Yaduvanshi. 210-220 [doi]
- A context-free markup language for semi-structured textQian Xi, David Walker. 221-232 [doi]
- Printing floating-point numbers quickly and accurately with integersFlorian Loitsch. 233-243 [doi]
- Adversarial memory for detecting destructive racesCormac Flanagan, Stephen N. Freund. 244-254 [doi]
- PACER: proportional detection of data racesMichael D. Bond, Katherine E. Coons, Kathryn S. McKinley. 255-268 [doi]
- Lock elision for read-only critical sections in JavaTakuya Nakaike, Maged M. Michael. 269-278 [doi]
- Smooth interpretationSwarat Chaudhuri, Armando Solar-Lezama. 279-291 [doi]
- The reachability-bound problemSumit Gulwani, Florian Zuleger. 292-304 [doi]
- Resolving and exploiting the ::::k::::-CFA paradox: illuminating functional vs. object-oriented program analysisMatthew Might, Yannis Smaragdakis, David Van Horn. 305-315 [doi]
- Complete functional synthesisViktor Kuncak, Mikaël Mayer, Ruzica Piskac, Philippe Suter. 316-329 [doi]
- Line-up: a complete and automatic linearizability checkerSebastian Burckhardt, Chris Dern, Madanlal Musuvathi, Roy Tan. 330-340 [doi]
- MemSAT: checking axiomatic specifications of memory modelsEmina Torlak, Mandana Vaziri, Julian Dolby. 341-350 [doi]
- DRFX: a simple and efficient memory model for concurrent programming languagesDaniel Marino, Abhayendra Singh, Todd D. Millstein, Madanlal Musuvathi, Satish Narayanasamy. 351-362 [doi]
- FlumeJava: easy, efficient data-parallel pipelinesCraig Chambers, Ashish Raniwala, Frances Perry, Stephen Adams, Robert R. Henry, Robert Bradshaw, Nathan Weizenbaum. 363-375 [doi]
- Composing parallel software efficiently with litheHeidi Pan, Benjamin Hindman, Krste Asanovic. 376-387 [doi]
- Bamboo: a data-centric, object-oriented approach to many-core softwareJin Zhou, Brian Demsky. 388-399 [doi]
- Mint: Java multi-stage programming using weak separabilityEdwin Westbrook, Mathias Ricken, Jun Inoue, Yilong Yao, Tamer Abdelatif, Walid Taha. 400-411 [doi]
- Type-preserving compilation of end-to-end verification of security enforcementJuan Chen, Ravi Chugh, Nikhil Swamy. 412-423 [doi]
- Inferable object-oriented typed assembly languageRoss Tate, Juan Chen, Chris Hawblitzel. 424-435 [doi]
- Mixing type checking and symbolic executionYit Phang Khoo, Bor-Yuh Evan Chang, Jeffrey S. Foster. 436-447 [doi]
- Evaluating iterative optimization across 1000 datasetsYang Chen, Yuanjie Huang, Lieven Eeckhout, Grigori Fursin, Liang Peng, Olivier Temam, Chengyong Wu. 448-459 [doi]
- Software data spreading: leveraging distributed caches to improve single thread performanceMd Kamruzzaman, Steven Swanson, Dean M. Tullsen. 460-470 [doi]
- Z-rays: divide arrays and conquer speed and flexibilityJennifer B. Sartor, Stephen M. Blackburn, Daniel Frampton, Martin Hirzel, Kathryn S. McKinley. 471-482 [doi]
- Traceable data types for self-adjusting computationUmut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat Tangwongsan, Duru Türkoglu. 483-496 [doi]