Abstract is missing.
- Commutative set: a language extension for implicit parallel programmingPrakash Prabhu, Soumyadeep Ghosh, Yun Zhang, Nick P. Johnson, David I. August. 1-11 [doi]
- The tao of parallelism in algorithmsKeshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, Muhammad Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui. 12-25 [doi]
- Parallelism orchestration using DoPE: the degree of parallelism executiveArun Raman, Hanjun Kim, Taewook Oh, Jae W. Lee, David I. August. 26-37 [doi]
- Data representation synthesisPeter Hawkins, Alex Aiken, Kathleen Fisher, Martin C. Rinard, Mooly Sagiv. 38-49 [doi]
- Synthesizing geometry constructionsSumit Gulwani, Vijay Anand Korthikanti, Ashish Tiwari. 50-61 [doi]
- Synthesis of loop-free programsSumit Gulwani, Susmit Jha, Ashish Tiwari, Ramarathnam Venkatesan. 62-73 [doi]
- Generalized just-in-time trace compilation using a parallel task farm in a dynamic binary translatorIgor Böhm, Tobias J. K. Edler von Koch, Stephen C. Kyle, Björn Franke, Nigel P. Topham. 74-85 [doi]
- Brainy: effective selection of data structuresChanghee Jung, Silvius Rus, Brian P. Railing, Nathan Clark, Santosh Pande. 86-97 [doi]
- An SSA-based algorithm for optimal speculative code motion under an execution profileHucheng Zhou, Wenguang Chen, Fred C. Chow. 98-108 [doi]
- Caisson: a hardware description language for secure information flowXun Li 0001, Mohit Tiwari, Jason Oberg, Vineeth Kashyap, Frederic T. Chong, Timothy Sherwood, Ben Hardekopf. 109-120 [doi]
- Steno: automatic optimization of declarative queriesDerek Gordon Murray, Michael Isard, Yuan Yu. 121-131 [doi]
- Languages as librariesSam Tobin-Hochstadt, Vincent St-Amour, Ryan Culpepper, Matthew Flatt, Matthias Felleisen. 132-141 [doi]
- Automatic CPU-GPU communication management and optimizationThomas B. Jablin, Prakash Prabhu, James A. Jablin, Nick P. Johnson, Stephen R. Beard, David I. August. 142-151 [doi]
- Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processorsAshwin Prasad, Jayvant Anantpur, R. Govindarajan. 152-163 [doi]
- EnerJ: approximate data types for safe and general low-power computationAdrian Sampson, Werner Dietl, Emily Fortuna, Danushen Gnanapragasam, Luis Ceze, Dan Grossman. 164-174 [doi]
- Understanding POWER multiprocessorsSusmit Sarkar, Peter Sewell, Jade Alglave, Luc Maranget, Derek Williams. 175-186 [doi]
- Partial-coherence abstractions for relaxed memory modelsMichael Kuperstein, Martin T. Vechev, Eran Yahav. 187-198 [doi]
- A case for an SC-preserving compilerDaniel Marino, Abhayendra Singh, Todd D. Millstein, Madanlal Musuvathi, Satish Narayanasamy. 199-210 [doi]
- Probabilistic, modular and scalable inference of typestate specificationsNels E. Beckman, Aditya V. Nori. 211-221 [doi]
- Predicate abstraction and CEGAR for higher-order model checkingNaoki Kobayashi, Ryosuke Sato, Hiroshi Unno. 222-233 [doi]
- Mostly-automated verification of low-level programs in computational separation logicAdam J. Chlipala. 234-245 [doi]
- Toward generating reducible replay logsKyu Hyung Lee, Yunhui Zheng, Nick Sumner, Xiangyu Zhang. 246-257 [doi]
- Higher-order test generationPatrice Godefroid. 258-269 [doi]
- LeakChaser: helping programmers narrow down causes of memory leaksGuoqing (Harry) Xu, Michael D. Bond, Feng Qin, Atanas Rountev. 270-282 [doi]
- Finding and understanding bugs in C compilersXuejun Yang, Yang Chen, Eric Eide, John Regehr. 283-294 [doi]
- Evaluating value-graph translation validation for LLVMJean-Baptiste Tristan, Paul Govereau, Greg Morrisett. 295-305 [doi]
- Safe optimisations for shared-memory concurrent programsJaroslav Sevcík. 306-316 [doi]
- Spreadsheet table transformations from examplesWilliam R. Harris, Sumit Gulwani. 317-328 [doi]
- Systematic editing: generating program transformations from an exampleNa Meng, Miryung Kim, Kathryn S. McKinley. 329-342 [doi]
- A security policy oracle: detecting security holes using multiple API implementationsVarun Srivastava, Michael D. Bond, Kathryn S. McKinley, Vitaly Shmatikov. 343-354 [doi]
- Language-independent sandboxing of just-in-time compilation and self-modifying codeJason Ansel, Petr Marchenko, Úlfar Erlingsson, Elijah Taylor, Brad Chen, Derek L. Schuff, David Sehr, Cliff Biffle, Bennet Yee. 355-366 [doi]
- Cruiser: concurrent heap buffer overflow monitoring using lock-free data structuresQiang Zeng, Dinghao Wu, Peng Liu. 367-377 [doi]
- Isolating and understanding concurrency errors using reconstructed execution fragmentsBrandon Lucia, Benjamin P. Wood, Luis Ceze. 378-388 [doi]
- Automated atomicity-violation fixingGuoliang Jin, Linhai Song, Wei Zhang, Shan Lu, Ben Liblit. 389-400 [doi]
- NDSeq: runtime checking for nondeterministic sequential specifications of parallel correctnessJacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen. 401-414 [doi]
- Garbage collection for monitoring parametric propertiesDongyun Jin, Patrick O Neil Meredith, Dennis Griffith, Grigore Rosu. 415-424 [doi]
- LL(*): the foundation of the ANTLR parser generatorTerence John Parr, Kathleen Fisher. 425-436 [doi]
- Cause clue clauses: error localization using maximum satisfiabilityManu Jose, Rupak Majumdar. 437-446 [doi]
- ::::kb::::-anonymity: a model for anonymized behaviour-preserving test and debugging dataAditya Budi, David Lo, Lingxiao Jiang, Lucia. 447-457 [doi]
- Kremlin: rethinking and rebooting gprof for the multicore ageSaturnino Garcia, Donghwan Jeon, Christopher M. Louie, Michael Bedford Taylor. 458-469 [doi]
- Automatic parallelization via matrix multiplicationShigeyuki Sato, Hideya Iwasaki. 470-479 [doi]
- ALTER: exploiting breakable dependences for parallelizationAbhishek Udupa, Kaushik Rajan, William Thies. 480-491 [doi]
- Path-based inductive synthesis for program inversionSaurabh Srivastava, Sumit Gulwani, Swarat Chaudhuri, Jeffrey S. Foster. 492-503 [doi]
- Directed incremental symbolic executionSuzette Person, Guowei Yang, Neha Rungta, Sarfraz Khurshid. 504-515 [doi]
- Mining hot calling contexts in small spaceDaniele Cono D Elia, Camil Demetrescu, Irene Finocchi. 516-527 [doi]
- Verification of semantic commutativity conditions and inverse operations on linked data structuresDeokhwan Kim, Martin C. Rinard. 528-541 [doi]
- Exploiting the commutativity latticeMilind Kulkarni, Donald Nguyen, Dimitrios Prountzos, Xin Sui, Keshav Pingali. 542-555 [doi]
- Separation logic + superposition calculus = heap theorem proverJuan Antonio Navarro Pérez, Andrey Rybalchenko. 556-566 [doi]
- Precise and compact modular procedure summaries for heap manipulating programsIsil Dillig, Thomas Dillig, Alex Aiken, Mooly Sagiv. 567-577 [doi]
- On inter-procedural analysis of programs with lists and dataAhmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu. 578-589 [doi]
- Scaling abstraction refinement via pruningPercy Liang, Mayur Naik. 590-601 [doi]
- Taming the wildcards: combining definition- and use-site varianceJohn Altidor, Shan Shan Huang, Yannis Smaragdakis. 602-613 [doi]
- Taming wildcards in Java s type systemRoss Tate, Alan Leung, Sorin Lerner. 614-627 [doi]
- Composable asynchronous eventsLukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jagannathan. 628-639 [doi]
- Synchronization via scheduling: techniques for efficiently managing shared stateMicah J. Best, Shane Mottishaw, Craig Mustard, Mark Roth, Alexandra Fedorova, Andrew Brownsword. 640-652 [doi]