| Year | Title | Authors |
|---|---|---|
| 2018 | Program synthesis using conflict-driven learning | Yu Feng, University of Texas at Austin Ruben Martins, Carnegie Mellon University Osbert Bastani, Massachusetts Institute of Technology Isil Dillig, University of Texas at Austin |
| 2018 | The semantics of transactions and weak memory in x86, Power, ARM, and C++ | Nathan Chong, ARM Tyler Sorensen, Imperial College London John Wickerson, Imperial College London |
| 2018 | A data-driven CHC solver | He Zhu, Galois Stephen Magill, Galois Suresh Jagannathan, Purdue University |
| 2017 | Low Overhead Dynamic Binary Translation on ARM | Amanieu D’Antras, University of Manchester Cosmin Gorgovan, University of Manchester Jim Garside, University of Manchester Mikel Luján, University of Manchester |
| 2017 | Repairing sequential consistency in C/C++11 | Ori Lahav, MPI-SWS Viktor Vafeiadis, MPI-SWS Jeehoon Kang, Seoul National University Chung-Kil Hur, Seoul National University Derek Dreyer, MPI-SWS |
| 2017 | Bringing the web up to speed with WebAssembly | Andreas Haas, Google Andreas Rossberg, Google Derek L. Schuff, Google Ben L. Titzer, Google Michael Holman, Microsoft Dan Gohman, Mozilla Luke Wagner, Mozilla Alon Zakai, Mozilla JF Bastien, Apple |
| 2017 | Compiling without continuations | Luke Maurer, University of Oregon Paul Downen, University of Oregon Zena M. Ariola, University of Oregon Simon Peyton Jones, Microsoft Research |
| 2016 | Assessing the limits of program-specific garbage collection performance | Nicholas Jacek, University of Massachusetts Amherst Meng-Chieh Chiu, University of Massachusetts Amherst Benjamin Marlin, University of Massachusetts Amherst Eliot Moss, University of Massachusetts Amherst |
| 2016 | Into the Depths of C: Elaborating the De Facto Standards | Kayvan Memarian, University of Cambridge Justus Matthiesen, University of Cambridge James Lingard, University of Cambridge Kyndylan Nienhuis, University of Cambridge David Chisnall, University of Cambridge Robert N. M. Watson, University of Cambridge Peter Sewell, University of Cambridge |
| 2016 | Transactional Data Structure Libraries | Alexander Spiegelman, Technion Guy Golan-Gueta, Yahoo! Research Idit Keidar, Technion |
| 2016 | Types from data: Making structured data first-class citizens in F# | Tomas Petricek, University of Cambridge Gustavo Guerra, Microsoft Don Syme, Microsoft Research |
| 2015 | Provably Correct Peephole Optimizations with Alive | Nuno P. Lopes, Microsoft Research David Menendez, Rutgers University Santosh Nagarakatte, Rutgers University John Regehr, University of Utah |
| 2015 | Diagnosing Type Errors with Class | Danfeng Zhang, Cornell University Andrew C. Myers, Cornell University Dimitrios Vytiniotis, Microsoft Research Simon Peyton-Jones, Microsoft Research |
| 2015 | Automatically Improving Accuracy for Floating Point Expressions | Pavel Panchekha, University of Washington Alex Sanchez-Stern, University of Washington James R. Wilcox, University of Washington Zachary Tatlock, University of Washington |
| 2014 | Improving JavaScript Performance by Deconstructing the Type System | Wonsun Ahn, University of Illinois at Urbana-Champaign Jiho Choi, University of Illinois at Urbana-Champaign Thomas Shull, University of Illinois at Urbana-Champaign María Garzarín, University of Illinois at Urbana-Champaign Josep Torrellas, University of Illinois at Urbana-Champaign |
| 2014 | Compiler validation via equivalence modulo inputs | Vu Le, University of California Davis Mehrdad Afshari, University of California Davis Zhendong Su, University of California Davis |
| 2014 | On Abstraction Refinement for Program Analyses in Datalog | Xin Zhang, Georgia Institute of Technology Ravi Mangal, Georgia Institute of Technology Radu Grigore, Oxford University Mayur Naik, Georgia Institute of Technology Hongseok Yang, Oxford University |
| 2013 | Static Analysis for Probabilistic Programs: Inferring Whole Program Properties from Finitely Many Path | Sriram Sankaranarayanan, University of Colorado Aleksandar Chakarov, University of Colorado Sumit Gulwani, Microsoft Research |
| 2013 | A General Constraint-centric Scheduling Framework for Spatial Architectures | Tony Nowatzki, University of Wisconsin Michael Sartin-Tarm, University of Wisconsin Lorenzo De Carli, University of Wisconsin Karthikeyan Sankaralingam, University of Wisconsin Cristian Estan, Broadcom Behnam Robatmili, Qualcomm Research |
| 2013 | Reconciling Exhaustive Pattern Matching with Objects | Chinawat Isradisaikul & Andrew C. Myers, Cornell University |
| 2013 | CLAP: Recording Local Executions to Reproduce Concurrency Failures | Jeff Huang, Hong Kong University of Science and Technology Charles Zhang, Hong Kong University of Science and Technology Julian Dolby, IBM Research |
| 2012 | Concurrent Data Representation Synthesis | Peter Hawkins, Stanford University Alex Aiken, Stanford University Kathleen Fisher, Tufts University Martin Rinard, Massachusetts Institute of Technology Mooly Sagiv, Tel-Aviv University |
| 2011 | Data Representation Synthesis | Peter Hawkins, Stanford University Alex Aiken, Stanford University Kathleen Fisher, Tufts University Martin Rinard, Massachusetts Institute of Technology Mooly Sagiv, Tel-Aviv University |
| 2010 | Safe to the Last Instruction: Automated Verification of a Type-Safe Operating System | Jean Yang, Massachusetts Institute of Technology Chris Hawblitzel, Microsoft Research |
| 2009 | Binary Analysis for Measurement and Attribution of Program Performance | Nathan Tallent, Rice University John Mellor-Crummey, Rice University Michael Fagan, Rice University |
| 2007 | Fault-tolerant Typed Assembly Language | Frances Perry, Princeton University Lester Mackey, Princeton University George A. Reis, Princeton University Jay Ligatti, University of South Florida David I. August, Princeton University David Walker, Princeton University |
| 2007 | The Ant and the Grasshopper: Fast and Accurate Pointer Analysis for Millions of Lines of Code | Ben Hardekopf & Calvin Lin, University of Texas at Austin |
| 2005 | Automatic Pool Allocation: Improving Performance by Controlling Data Structure Layout in the Heap | Chris Lattner & Vikram Adve, University of Illinois at Urbana-Champaign |
| 2005 | Programming by Sketching for Bit-Streaming Programs | Armando Solar-Lezama, University of California Berkeley Rodric Rabbah, Massachusetts Institute of Technology Rastislav Bodik, University of California Berkeley Kemal Ebcioğlu, IBM Research |
| 2004 | Cloning-Based Context-Sensitive Pointer Alias Analysis Using Binary Decision Diagrams | John Whaley & Monica S. Lam, Stanford University |
| 2003 | Automatically Proving the Correctness of Compiler Optimizations | Sorin Lerner, University of Washington Todd Millstein, University of Washington Craig Chambers, University of Washington |
| 2000 | Dynamo: a transparent dynamic optimization system | Vasanth Bala, Hewlett-Packard Labs Evelyn Duesterwald, Hewlett-Packard Labs Sanjeev Banerjia, InCert |
| 1999 | Whole program paths | James R. Larus, Microsoft Research |
