PLDI 2011: San Jose, CA, USA

Parallel programming notations

• Prakash Prabhu, Soumyadeep Ghosh, Yun Zhang, Nick P. Johnson, David I. August:
  Commutative set: a language extension for implicit parallel programming. 1-11
  
• Keshav 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:
  The tao of parallelism in algorithms. 12-25
  
• Arun Raman, Hanjun Kim, Taewook Oh, Jae W. Lee, David I. August:
  Parallelism orchestration using DoPE: the degree of parallelism executive. 26-37
  

Program synthesis

• Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin C. Rinard, Mooly Sagiv:
  Data representation synthesis. 38-49
  
• Sumit Gulwani, Vijay Anand Korthikanti, Ashish Tiwari:
  Synthesizing geometry constructions. 50-61
  
• Sumit Gulwani, Susmit Jha, Ashish Tiwari, Ramarathnam Venkatesan:
  Synthesis of loop-free programs. 62-73
  

Program optimization I

• Igor Böhm, Tobias J. K. Edler von Koch, Stephen C. Kyle, Björn Franke, Nigel P. Topham:
  Generalized just-in-time trace compilation using a parallel task farm in a dynamic binary translator. 74-85
  
• Changhee Jung, Silvius Rus, Brian P. Railing, Nathan Clark, Santosh Pande:
  Brainy: effective selection of data structures. 86-97
  
• Hucheng Zhou, Wenguang Chen, Fred C. Chow:
  An SSA-based algorithm for optimal speculative code motion under an execution profile. 98-108
  

Domain specific languages and their compilers

• Xun Li, Mohit Tiwari, Jason Oberg, Vineeth Kashyap, Frederic T. Chong, Timothy Sherwood, Ben Hardekopf:
  Caisson: a hardware description language for secure information flow. 109-120
  
• Derek Gordon Murray, Michael Isard, Yuan Yu:
  Steno: automatic optimization of declarative queries. 121-131
  
• Sam Tobin-Hochstadt, Vincent St-Amour, Ryan Culpepper, Matthew Flatt, Matthias Felleisen:
  Languages as libraries. 132-141
  

Program optimization II

• Thomas B. Jablin, Prakash Prabhu, James A. Jablin, Nick P. Johnson, Stephen R. Beard, David I. August:
  Automatic CPU-GPU communication management and optimization. 142-151
  
• Ashwin Prasad, Jayvant Anantpur, R. Govindarajan:
  Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors. 152-163
  
• Adrian Sampson, Werner Dietl, Emily Fortuna, Danushen Gnanapragasam, Luis Ceze, Dan Grossman:
  EnerJ: approximate data types for safe and general low-power computation. 164-174
  

Memory models

• Susmit Sarkar, Peter Sewell, Jade Alglave, Luc Maranget, Derek Williams:
  Understanding POWER multiprocessors. 175-186
  
• Michael Kuperstein, Martin T. Vechev, Eran Yahav:
  Partial-coherence abstractions for relaxed memory models. 187-198
  
• Daniel Marino, Abhayendra Singh, Todd D. Millstein, Madanlal Musuvathi, Satish Narayanasamy:
  A case for an SC-preserving compiler. 199-210
  

Program verification I

• Nels E. Beckman, Aditya V. Nori:
  Probabilistic, modular and scalable inference of typestate specifications. 211-221
  
• Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno:
  Predicate abstraction and CEGAR for higher-order model checking. 222-233
  
• Adam Chlipala:
  Mostly-automated verification of low-level programs in computational separation logic. 234-245
  

Debugging I

• Kyu Hyung Lee, Yunhui Zheng, Nick Sumner, Xiangyu Zhang:
  Toward generating reducible replay logs. 246-257
  
• Patrice Godefroid:
  Higher-order test generation. 258-269
  
• Guoqing (Harry) Xu, Michael D. Bond, Feng Qin, Atanas Rountev:
  LeakChaser: helping programmers narrow down causes of memory leaks. 270-282
  

Compiler correctness

• Xuejun Yang, Yang Chen, Eric Eide, John Regehr:
  Finding and understanding bugs in C compilers. 283-294
  
• Jean-Baptiste Tristan, Paul Govereau, Greg Morrisett:
  Evaluating value-graph translation validation for LLVM. 295-305
  
• Jaroslav Sevcík:
  Safe optimisations for shared-memory concurrent programs. 306-316
  

Transforming and editing by example

• William R. Harris, Sumit Gulwani:
  Spreadsheet table transformations from examples. 317-328
  
• Na Meng, Miryung Kim, Kathryn S. McKinley:
  Systematic editing: generating program transformations from an example. 329-342
  

Security

• Varun Srivastava, Michael D. Bond, Kathryn S. McKinley, Vitaly Shmatikov:
  A security policy oracle: detecting security holes using multiple API implementations. 343-354
  
• Jason Ansel, Petr Marchenko, Úlfar Erlingsson, Elijah Taylor, Brad Chen, Derek L. Schuff, David Sehr, Cliff Biffle, Bennet Yee:
  Language-independent sandboxing of just-in-time compilation and self-modifying code. 355-366
  
• Qiang Zeng, Dinghao Wu, Peng Liu:
  Cruiser: concurrent heap buffer overflow monitoring using lock-free data structures. 367-377
  

Concurrency defects

• Brandon Lucia, Benjamin P. Wood, Luis Ceze:
  Isolating and understanding concurrency errors using reconstructed execution fragments. 378-388
  
• Guoliang Jin, Linhai Song, Wei Zhang, Shan Lu, Ben Liblit:
  Automated atomicity-violation fixing. 389-400
  
• Jacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen:
  NDSeq: runtime checking for nondeterministic sequential specifications of parallel correctness. 401-414
  

Singular topics

• Dongyun Jin, Patrick O'Neil Meredith, Dennis Griffith, Grigore Rosu:
  Garbage collection for monitoring parametric properties. 415-424
  
• Terence Parr, Kathleen Fisher:
  LL(*): the foundation of the ANTLR parser generator. 425-436
  

Debugging II

• Manu Jose, Rupak Majumdar:
  Cause clue clauses: error localization using maximum satisfiability. 437-446
  
• Aditya Budi, David Lo, Lingxiao Jiang, Lucia:
  kb-anonymity: a model for anonymized behaviour-preserving test and debugging data. 447-457
  

Program parallelization

• Saturnino Garcia, Donghwan Jeon, Christopher M. Louie, Michael Bedford Taylor:
  Kremlin: rethinking and rebooting gprof for the multicore age. 458-469
  
• Shigeyuki Sato, Hideya Iwasaki:
  Automatic parallelization via matrix multiplication. 470-479
  
• Abhishek Udupa, Kaushik Rajan, William Thies:
  ALTER: exploiting breakable dependences for parallelization. 480-491
  

Program paths

• Saurabh Srivastava, Sumit Gulwani, Swarat Chaudhuri, Jeffrey S. Foster:
  Path-based inductive synthesis for program inversion. 492-503
  
• Suzette Person, Guowei Yang, Neha Rungta, Sarfraz Khurshid:
  Directed incremental symbolic execution. 504-515
  
• Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
  Mining hot calling contexts in small space. 516-527
  

Program verification II

• Deokhwan Kim, Martin C. Rinard:
  Verification of semantic commutativity conditions and inverse operations on linked data structures. 528-541
  
• Milind Kulkarni, Donald Nguyen, Dimitrios Prountzos, Xin Sui, Keshav Pingali:
  Exploiting the commutativity lattice. 542-555
  
• Juan Antonio Navarro Pérez, Andrey Rybalchenko:
  Separation logic + superposition calculus = heap theorem prover. 556-566
  

Program analysis

• Isil Dillig, Thomas Dillig, Alex Aiken, Mooly Sagiv:
  Precise and compact modular procedure summaries for heap manipulating programs. 567-577
  
• Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
  On inter-procedural analysis of programs with lists and data. 578-589
  
• Percy Liang, Mayur Naik:
  Scaling abstraction refinement via pruning. 590-601
  

Taming wildcards

• John Altidor, Shan Shan Huang, Yannis Smaragdakis:
  Taming the wildcards: combining definition- and use-site variance. 602-613
  
• Ross Tate, Alan Leung, Sorin Lerner:
  Taming wildcards in Java's type system. 614-627
  

Concurrent programming

• Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jagannathan:
  Composable asynchronous events. 628-639
  
• Micah J. Best, Shane Mottishaw, Craig Mustard, Mark Roth, Alexandra Fedorova, Andrew Brownsword:
  Synchronization via scheduling: techniques for efficiently managing shared state. 640-652
  

Last update Fri May 24 19:43:11 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page