Write a Blog >>
SPLASH 2017
Sun 22 - Fri 27 October 2017 Vancouver, Canada

OOPSLA seeks outstanding contributions on all aspects of programming languages and software engineering.

Papers may target any stage of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, and reuse of software systems. Contributions may include the development of new tools (such as language front-ends, program analyses, and runtime systems), new techniques (such as methodologies, design processes, and code organization approaches), new principles (such as formalisms, proofs, models, and paradigms), and new evaluations (such as experiments, corpora analyses, user studies, and surveys).

Dates
You're viewing the program in a time zone which is different from your device's time zone change time zone

Wed 25 Oct

Displayed time zone: Tijuana, Baja California change

10:30 - 12:00
TypesOOPSLA at Regency A
Chair(s): Kim Bruce Pomona College
10:30
22m
Talk
SAVI Objects: Sharing and Virtuality Incorporated
OOPSLA
Izzat El Hajj University of Illinois at Urbana-Champaign, USA, Thomas B. Jablin University of Illinois at Urbana-Champaign, USA / Multicoreware, USA, Dejan Milojicic Hewlett Packard Labs, USA, Wen-mei Hwu University of Illinois at Urbana-Champaign, USA
DOI
10:52
22m
Talk
A Simple Soundness Proof for Dependent Object Types
OOPSLA
Marianna Rapoport University of Waterloo, Canada, Ifaz Kabir University of Waterloo, Canada, Paul He University of Waterloo, Canada, Ondřej Lhoták University of Waterloo, Canada
DOI
11:15
22m
Talk
Unifying Typing and Subtyping
OOPSLA
Yanpeng Yang University of Hong Kong, China, Bruno C. d. S. Oliveira University of Hong Kong, China
DOI
11:37
22m
Talk
Fast and Precise Type Checking for JavaScript
OOPSLA
Avik Chaudhuri Facebook, USA, Panagiotis Vekris University of California at San Diego, USA, Sam Goldman Facebook, USA, Marshall Roch Facebook, USA, Gabriel Levi Facebook, USA
DOI
10:30 - 12:00
PerformanceOOPSLA at Regency C
Chair(s): Kathryn S McKinley Google
10:30
22m
Talk
A Volatile-by-Default JVM for Server Applications
OOPSLA
Lun Liu University of California at Los Angeles, USA, Todd Millstein University of California, Los Angeles, Madan Musuvathi Microsoft Research
DOI
10:52
22m
Talk
Static Placement of Computation on Heterogeneous Devices
OOPSLA
Gabriel Poesia Federal University of Minas Gerais, Brazil, Breno Campos Ferreira Guimarães Federal University of Minas Gerais, Brazil, Fabrício Ferracioli LG Electronics, Brazil, Fernando Magno Quintão Pereira UFMG
DOI
11:15
22m
Talk
Skip Blocks: Reusing Execution History to Accelerate Web Scripts
OOPSLA
Sarah E. Chasins University of California, Berkeley, Rastislav Bodík University of Washington
DOI
11:37
22m
Talk
Virtual Machine Warmup Blows Hot and Cold
OOPSLA
Edd Barrett King's College London, Carl Friedrich Bolz-Tereick , Rebecca Killick Department of Mathematics and Statistics, University of Lancaster, Sarah Mount King's College London, Laurence Tratt King's College London
DOI
13:30 - 15:00
Gradual Types and MemoryOOPSLA at Regency A
Chair(s): Jennifer B. Sartor Vrije Universiteit Brussel
13:30
22m
Talk
Sound Gradual Typing: Only Mostly Dead
OOPSLA
Spenser Andrew Bauman Indiana University, USA, Sam Tobin-Hochstadt Indiana University, Jeremy G. Siek Indiana University, USA, Carl Friedrich Bolz-Tereick
DOI
13:52
22m
Talk
Sound Gradual Typing Is Nominally Alive and Well
OOPSLA
Fabian Muehlboeck Cornell University, Ross Tate Cornell University
DOI
14:15
22m
Talk
The VM Already Knew That: Leveraging Compile-Time Knowledge to Optimize Gradual Typing
OOPSLA
Gregor Richards University of Waterloo, Ellen Arteca University of Waterloo, Canada, Alexi Turcotte University of Waterloo
DOI
14:37
22m
Talk
Model Checking Copy Phases of Concurrent Copying Garbage Collection with Various Memory Models
OOPSLA
Tomoharu Ugawa Kochi University of Technology, Japan, Tatsuya Abe Chiba Institute of Technology, Japan, Toshiyuki Maeda Chiba Institute of Technology, Japan
DOI
13:30 - 15:00
ToolsOOPSLA at Regency C
Chair(s): Joshua Sunshine Carnegie Mellon University
13:30
22m
Talk
Effective Interactive Resolution of Static Analysis Alarms
OOPSLA
Xin Zhang Massachusetts Institute of Technology, USA, Radu Grigore University of Kent, Xujie Si University of Pennsylvania, Mayur Naik University of Pennsylvania
DOI
13:52
22m
Talk
Learning to Blame: Localizing Novice Type Errors with Data-Driven Diagnosis
OOPSLA
Eric Seidel University of California at San Diego, USA, Huma Sibghat University of California at San Diego, USA, Kamalika Chaudhuri University of California at San Diego, USA, Westley Weimer University of Virginia, USA, Ranjit Jhala University of California at San Diego, USA
DOI
14:15
22m
Talk
Abridging Source Code
OOPSLA
Binhang Yuan Rice University, USA, Vijayaraghavan Murali Rice University, USA, Chris Jermaine Rice University
DOI
14:37
22m
Talk
Evaluating and Improving Semistructured Merge
OOPSLA
Guilherme Cavalcanti Federal University of Pernambuco, Brazil, Paulo Borba Federal University of Pernambuco, Brazil, Paola Accioly Federal University of Pernambuco, Brazil
DOI
15:30 - 17:22
SynthesisOOPSLA at Regency A
Chair(s): Jonathan Edwards
15:30
22m
Talk
Model-Assisted Machine-Code Synthesis
OOPSLA
Venkatesh Srinivasan University of Wisconsin - Madison, Ara Vartanian University of Wisconsin-Madison, USA, Thomas Reps University of Wisconsin - Madison and GrammaTech, Inc.
DOI
15:52
22m
Talk
Synthesis of Data Completion Scripts using Finite Tree Automata
OOPSLA
Xinyu Wang UT Austin, Işıl Dillig UT Austin, Rishabh Singh Microsoft Research
DOI
16:14
22m
Talk
SQLizer: Query Synthesis from Natural Language
OOPSLA
Navid Yaghmazadeh University of Texas, Austin, Yuepeng Wang University of Texas at Austin, Işıl Dillig UT Austin, Thomas Dillig
DOI
16:37
22m
Talk
Synthesizing Configuration File Specifications with Association Rule Learning
OOPSLA
Mark Santolucito Yale University, Ennan Zhai Yale University, USA, Rahul Dhodapkar MongoDB, USA, Aaron Shim Microsoft, USA, Ruzica Piskac Yale University
DOI
16:59
22m
Talk
Natural Synthesis of Provably-Correct Data-Structure Manipulations
OOPSLA
Xiaokang Qiu Purdue University, Armando Solar-Lezama MIT CSAIL
DOI
15:30 - 17:00
Dynamic AnalysisOOPSLA at Regency C
Chair(s): Jonathan Aldrich Carnegie Mellon University
15:30
22m
Talk
Practical Initialization Race Detection for JavaScript Web Applications
OOPSLA
Christoffer Quist Adamsen Aarhus University, Anders Møller Aarhus University, Frank Tip Northeastern University
DOI
15:52
22m
Talk
Instrumentation Bias for Dynamic Data Race Detection
OOPSLA
Benjamin P. Wood Wellesley College, Man Cao Ohio State University, Michael D. Bond Ohio State University, Dan Grossman University of Washington
DOI
16:15
22m
Talk
Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols
OOPSLA
Nachshon Cohen EPFL, Switzerland, Michal Friedman , James Larus EPFL
DOI
16:37
22m
Talk
Heaps Don't Lie: Countering Unsoundness with Heap Snapshots
OOPSLA
Neville Grech , George Fourtounis University of Athens, Adrian Francalanza University of Malta, Yannis Smaragdakis University of Athens
DOI

Thu 26 Oct

Displayed time zone: Tijuana, Baja California change

10:30 - 12:00
Types and Language DesignOOPSLA at Regency A
Chair(s): Mario Wolczko Oracle Labs
10:30
22m
Talk
Familia: Unifying Interfaces, Type Classes, and Family Polymorphism
OOPSLA
Yizhou Zhang Cornell University, Andrew Myers
DOI
10:52
22m
Talk
Static Stages for Heterogeneous Programming
OOPSLA
Adrian Sampson Cornell University, Kathryn S McKinley Google, Todd Mytkowicz Microsoft Research
DOI Pre-print
11:15
22m
Talk
Orca: GC and Type System Co-Design for Actor Languages
OOPSLA
Sylvan Clebsch Imperial College London, Juliana Franco Imperial College London, Sophia Drossopoulou , Albert Mingkun Yang , Tobias Wrigstad Uppsala University, Jan Vitek Northeastern University, USA
DOI
11:37
22m
Talk
Monadic Composition for Deterministic, Parallel Batch Processing
OOPSLA
Ryan Scott Indiana University, Omar Navarro-Leija University of Pennsylvania, USA, Ryan R. Newton Indiana University, Joseph Devietti University of Pennsylvania
DOI
10:30 - 12:00
Optimizing Compilation and VerificationOOPSLA at Regency C
Chair(s): Gregor Richards University of Waterloo
10:30
22m
Talk
The Tensor Algebra Compiler
OOPSLA
Fredrik Kjolstad MIT CSAIL, Shoaib Kamil Adobe, Stephen Chou MIT CSAIL, David Lugato CEA, France, Saman Amarasinghe MIT
DOI
10:52
22m
Talk
TreeFuser: A Framework for Analyzing and Fusing General Recursive Tree Traversals
OOPSLA
Laith Sakka Purdue University, Kirshanthan Sundararajah Purdue University, Milind Kulkarni Purdue University
DOI
11:15
22m
Talk
Verifying Spatial Properties of Array Computations
OOPSLA
Dominic Orchard University of Kent, UK, Mistral Contrastin , Matthew Danish University of Cambridge, UK, Andrew Rice University of Cambridge, UK
DOI
11:37
22m
Talk
GLORE: Generalized Loop Redundancy Elimination upon LER-Notation
OOPSLA
Yufei Ding North Carolina State University, Xipeng Shen North Carolina State University
DOI
13:30 - 15:00
Mining Software Repositories and ParsingOOPSLA at Regency A
Chair(s): Wolfgang De Meuter Vrije Universiteit Brussel
13:30
22m
Talk
Exploiting Implicit Beliefs to Resolve Sparse Usage Problem in Usage-Based Specification Mining
OOPSLA
Samantha Syeda Khairunnesa Iowa State University, Hoan Anh Nguyen Iowa State University, USA, Tien N. Nguyen University of Texas at Dallas, Hridesh Rajan Iowa State University
DOI
13:52
22m
Talk
DéjàVu: A Map of Code Duplicates on GitHub
OOPSLA
Crista Lopes University of California, Irvine, Petr Maj ReactorLabs, Pedro Martins University of California at Irvine, USA, Vaibhav Saini University of California at Irvine, USA, Di Yang University of California at Irvine, USA, Jakub Zitny Czech Technical University, Czechia, Hitesh Sajnani Microsoft , Jan Vitek Northeastern University, USA
DOI
14:15
22m
Talk
Understanding the Use of Lambda Expressions in Java
OOPSLA
Davood Mazinanian Concordia University, Canada, Ameya Ketkar Oregon State University, USA, Nikolaos Tsantalis Concordia University, Canada, Danny Dig School of EECS at Oregon State University
DOI
14:37
22m
Talk
Restricting Grammars with Tree Automata
OOPSLA
Michael D. Adams University of Utah, USA, Matthew Might University of Utah, USA
DOI
13:30 - 15:00
VerificationOOPSLA at Regency C
Chair(s): Jonathan Edwards
13:30
22m
Talk
Seam: Provably Safe Local Edits on Graphs
OOPSLA
Manolis Papadakis Stanford University, USA, Gilbert Louis Bernstein Stanford University, USA, Rahul Sharma Microsoft Research, Alex Aiken Stanford University, Pat Hanrahan Stanford University, USA
DOI
13:52
22m
Talk
TiML: A Functional Language for Practical Complexity Analysis with Invariants
OOPSLA
Peng Wang Massachusetts Institute of Technology, USA, Di Wang Peking University, China, Adam Chlipala Massachusetts Institute of Technology, USA
DOI
14:15
22m
Talk
FairSquare: Probabilistic Verification of Program Fairness
OOPSLA
Aws Albarghouthi University of Wisconsin-Madison, Loris D'Antoni University of Wisconsin–Madison, Samuel Drews University of Wisconsin-Madison, Aditya Nori
DOI
14:37
22m
Talk
Reasoning on Divergent Computations with Coaxioms
OOPSLA
Davide Ancona University of Genova, Francesco Dagnino , Elena Zucca University of Genova
DOI
15:30 - 17:22
TestingOOPSLA at Regency A
Chair(s): Christian Hammer University of Potsdam
15:30
22m
Talk
A Solver-Aided Language for Test Input Generation
OOPSLA
Talia Ringer University of Washington, Dan Grossman University of Washington, Daniel Schwartz-Narbonne Amazon, n.n., Serdar Tasiran Amazon, n.n.
DOI
15:52
22m
Talk
Automated Testing of Graphics Shader Compilers
OOPSLA
Alastair F. Donaldson Imperial College London, Hugues Evrard Imperial College London, UK, Andrei Lascu Imperial College London, Paul Thomson Imperial College London
DOI
16:14
22m
Talk
Bounded Exhaustive Test-Input Generation on GPUs
OOPSLA
Ahmet Celik University of Texas at Austin, USA, Sreepathi Pai University of Rochester, Sarfraz Khurshid University of Texas at Austin, Milos Gligoric University of Texas at Austin
DOI
16:37
22m
Talk
Transforming Programs and Tests in Tandem for Fault Localization
OOPSLA
Xia Li University of Texas at Dallas, USA, Lingming Zhang
DOI
16:59
22m
Talk
Type Test Scripts for TypeScript Testing
OOPSLA
Erik Krogh Kristensen Aarhus University, Denmark, Anders Møller Aarhus University
DOI
15:30 - 17:00
Verification in PracticeOOPSLA at Regency C
Chair(s): Davide Ancona University of Genova
15:30
22m
Talk
A Model for Reasoning about JavaScript Promises
OOPSLA
Magnus Madsen University of Waterloo, Ondřej Lhoták University of Waterloo, Canada, Frank Tip Northeastern University
DOI
15:52
22m
Talk
Robust and Compositional Verification of Object Capability Patterns
OOPSLA
David Swasey MPI-SWS, Germany, Deepak Garg Max Planck Institute for Software Systems, Derek Dreyer MPI-SWS
DOI
16:15
22m
Talk
A Verified Messaging System
OOPSLA
William Mansky Princeton University, Andrew W. Appel Princeton, Aleksey Nogin HRL Laboratories, LLC
DOI
16:37
22m
Talk
Who Guards the Guards? Formal Validation of the ARM v8-M Architecture Specification
OOPSLA
DOI

Fri 27 Oct

Displayed time zone: Tijuana, Baja California change

10:30 - 12:00
Language DesignOOPSLA at Regency A
Chair(s): Gregor Richards University of Waterloo
10:30
22m
Talk
Project Snowflake: Non-blocking Safe Manual Memory Management for .NET
OOPSLA
Matthew J. Parkinson Microsoft Research, UK, Dimitrios Vytiniotis Microsoft Research, Cambridge, Kapil Vaswani Microsoft Research, Manuel Costa Microsoft Research, Pantazis Deligiannis Microsoft Research, Dylan McDermott University of Cambridge, Jonathan Balkind Princeton, USA, Aaron Blankstein Princeton, USA
DOI
10:52
22m
Talk
Alpaca: Intermittent Execution without Checkpoints
OOPSLA
Kiwan Maeng Carnegie Mellon University, USA, Alexei Colin Carnegie Mellon University, Brandon Lucia Carnegie Mellon University
DOI
11:15
22m
Talk
An Auditing Language for Preventing Correlated Failures in the Cloud
OOPSLA
Ennan Zhai Yale University, USA, Ruzica Piskac Yale University, Ronghui Gu Columbia University, USA, Xun Lao Yale University, USA, Xi Wang Yale University, USA
DOI
11:37
22m
Talk
Reliable and Automatic Composition of Language Extensions to C
OOPSLA
Ted Kaminski University of Minnesota, Lucas Kramer University of Minnesota, Travis Carlson University of Minnesota, USA, Eric Van Wyk University of Minnesota, USA
DOI Pre-print
10:30 - 12:00
Static AnalysisOOPSLA at Regency C
Chair(s): Christian Hammer University of Potsdam
10:30
22m
Talk
IDEal: Efficient and Precise Alias-Aware Dataflow Analysis
OOPSLA
Johannes Späth Fraunhofer IEM, Karim Ali University of Alberta, Eric Bodden Heinz Nixdorf Institut, Paderborn University and Fraunhofer IEM
DOI
10:52
22m
Talk
P/Taint: Unified Points-to and Taint Analysis
OOPSLA
Neville Grech , Yannis Smaragdakis University of Athens
DOI
11:15
22m
Talk
Data-Driven Context-Sensitivity for Points-to Analysis
OOPSLA
Sehun Jeong Korea University, South Korea, Minseok Jeon Korea University, South Korea, Sungdeok (Steve) Cha Korea University, South Korea, Hakjoo Oh Korea University
DOI
11:37
22m
Talk
Automatically Generating Features for Learning Program Analysis Heuristics for C-Like Languages
OOPSLA
Kwonsoo Chae Korea University, Hakjoo Oh Korea University, Kihong Heo University of Pennsylvania, USA, Hongseok Yang University of Oxford
DOI
13:30 - 15:00
Usability and DeadlockOOPSLA at Regency A
Chair(s): Jonathan Aldrich Carnegie Mellon University
13:30
22m
Talk
Deadlock Avoidance in Parallel Programs with Futures: Why Parallel Tasks Should Not Wait for Strangers
OOPSLA
Tiago Cogumbreiro Rice University, Rishi Surendran Rice University, USA, Francisco Martins LaSIGE, University of Lisbon, Vivek Sarkar Rice University, USA, Vasco T. Vasconcelos University of Lisbon, Portugal, Max Grossman Rice University, USA
DOI
13:52
22m
Talk
Detecting Argument Selection Defects
OOPSLA
Andrew Rice University of Cambridge, UK, Eddie Aftandilian Google, Ciera Jaspan Google, Emily Johnston Google, Michael Pradel TU Darmstadt, Yulissa Arroyo-Paredes Columbia University, USA
DOI
14:15
22m
Talk
How Type Errors Were Fixed and What Students Did?
OOPSLA
Baijun Wu University of Louisiana at Lafayette, USA, Sheng Chen ULL Lafayette
DOI
14:37
22m
Talk
Learning User Friendly Type-Error Messages
OOPSLA
Baijun Wu University of Louisiana at Lafayette, USA, John Peter Campora ULL Lafayette, Sheng Chen ULL Lafayette
DOI
13:30 - 15:00
Distributed SystemsOOPSLA at Regency C
Chair(s): Wolfgang De Meuter Vrije Universiteit Brussel
13:30
22m
Talk
Geo-Distribution of Actor-Based Services
OOPSLA
Philip A. Bernstein Microsoft Research, Sebastian Burckhardt Microsoft Research, Sergey Bykov Microsoft, n.n., Natacha Crooks University of Texas at Austin, USA, Jose Faleiro Yale University, USA, Gabriel Kliot Google, n.n., Alok Kumbhare Microsoft Research, n.n., Muntasir Raihan Rahman Microsoft, Vivek Shah University of Copenhagen, Denmark, Adriana Szekeres University of Washington, USA, Jorgen Thelin Microsoft Research, Redmond
DOI
13:52
22m
Talk
Paxos Made EPR: Decidable Reasoning about Distributed Protocols
OOPSLA
Oded Padon Tel Aviv University, Giuliano Losa University of California at Los Angeles, USA, Mooly Sagiv Tel Aviv University, Sharon Shoham Tel Aviv university
DOI
14:15
22m
Talk
Verifying Strong Eventual Consistency in Distributed Systems
OOPSLA
Victor B. F. Gomes University of Cambridge, UK, Martin Kleppmann University of Cambridge, Dominic P. Mulligan University of Cambridge, Alastair R. Beresford University of Cambridge, UK
DOI
14:37
22m
Talk
Verifying Distributed Programs via Canonical Sequentialization
OOPSLA
Alexander Bakst , Klaus v. Gleissenthall University of California at San Diego, USA, Ranjit Jhala University of California at San Diego, USA, Rami Gökhan Kıcı University of California at San Diego, USA
DOI

Accepted Papers

Title
Abridging Source Code
OOPSLA
DOI
Alpaca: Intermittent Execution without Checkpoints
OOPSLA
DOI
A Model for Reasoning about JavaScript Promises
OOPSLA
DOI
An Auditing Language for Preventing Correlated Failures in the Cloud
OOPSLA
DOI
A Simple Soundness Proof for Dependent Object Types
OOPSLA
DOI
A Solver-Aided Language for Test Input Generation
OOPSLA
DOI
Automated Testing of Graphics Shader Compilers
OOPSLA
DOI
Automatically Generating Features for Learning Program Analysis Heuristics for C-Like Languages
OOPSLA
DOI
A Verified Messaging System
OOPSLA
DOI
A Volatile-by-Default JVM for Server Applications
OOPSLA
DOI
Bounded Exhaustive Test-Input Generation on GPUs
OOPSLA
DOI
Data-Driven Context-Sensitivity for Points-to Analysis
OOPSLA
DOI
Deadlock Avoidance in Parallel Programs with Futures: Why Parallel Tasks Should Not Wait for Strangers
OOPSLA
DOI
DéjàVu: A Map of Code Duplicates on GitHub
OOPSLA
DOI
Detecting Argument Selection Defects
OOPSLA
DOI
Effective Interactive Resolution of Static Analysis Alarms
OOPSLA
DOI
Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols
OOPSLA
DOI
Evaluating and Improving Semistructured Merge
OOPSLA
DOI
Exploiting Implicit Beliefs to Resolve Sparse Usage Problem in Usage-Based Specification Mining
OOPSLA
DOI
FairSquare: Probabilistic Verification of Program Fairness
OOPSLA
DOI
Familia: Unifying Interfaces, Type Classes, and Family Polymorphism
OOPSLA
DOI
Fast and Precise Type Checking for JavaScript
OOPSLA
DOI
Geo-Distribution of Actor-Based Services
OOPSLA
DOI
GLORE: Generalized Loop Redundancy Elimination upon LER-Notation
OOPSLA
DOI
Heaps Don't Lie: Countering Unsoundness with Heap Snapshots
OOPSLA
DOI
How Type Errors Were Fixed and What Students Did?
OOPSLA
DOI
IDEal: Efficient and Precise Alias-Aware Dataflow Analysis
OOPSLA
DOI
Instrumentation Bias for Dynamic Data Race Detection
OOPSLA
DOI
Learning to Blame: Localizing Novice Type Errors with Data-Driven Diagnosis
OOPSLA
DOI
Learning User Friendly Type-Error Messages
OOPSLA
DOI
Model-Assisted Machine-Code Synthesis
OOPSLA
DOI
Model Checking Copy Phases of Concurrent Copying Garbage Collection with Various Memory Models
OOPSLA
DOI
Monadic Composition for Deterministic, Parallel Batch Processing
OOPSLA
DOI
Natural Synthesis of Provably-Correct Data-Structure Manipulations
OOPSLA
DOI
Orca: GC and Type System Co-Design for Actor Languages
OOPSLA
DOI
Paxos Made EPR: Decidable Reasoning about Distributed Protocols
OOPSLA
DOI
Practical Initialization Race Detection for JavaScript Web Applications
OOPSLA
DOI
Project Snowflake: Non-blocking Safe Manual Memory Management for .NET
OOPSLA
DOI
P/Taint: Unified Points-to and Taint Analysis
OOPSLA
DOI
Reasoning on Divergent Computations with Coaxioms
OOPSLA
DOI
Reliable and Automatic Composition of Language Extensions to C
OOPSLA
DOI Pre-print
Restricting Grammars with Tree Automata
OOPSLA
DOI
Robust and Compositional Verification of Object Capability Patterns
OOPSLA
DOI
SAVI Objects: Sharing and Virtuality Incorporated
OOPSLA
DOI
Seam: Provably Safe Local Edits on Graphs
OOPSLA
DOI
Skip Blocks: Reusing Execution History to Accelerate Web Scripts
OOPSLA
DOI
Sound Gradual Typing Is Nominally Alive and Well
OOPSLA
DOI
Sound Gradual Typing: Only Mostly Dead
OOPSLA
DOI
SQLizer: Query Synthesis from Natural Language
OOPSLA
DOI
Static Placement of Computation on Heterogeneous Devices
OOPSLA
DOI
Static Stages for Heterogeneous Programming
OOPSLA
DOI Pre-print
Synthesis of Data Completion Scripts using Finite Tree Automata
OOPSLA
DOI
Synthesizing Configuration File Specifications with Association Rule Learning
OOPSLA
DOI
The Tensor Algebra Compiler
OOPSLA
DOI
The VM Already Knew That: Leveraging Compile-Time Knowledge to Optimize Gradual Typing
OOPSLA
DOI
TiML: A Functional Language for Practical Complexity Analysis with Invariants
OOPSLA
DOI
Transforming Programs and Tests in Tandem for Fault Localization
OOPSLA
DOI
TreeFuser: A Framework for Analyzing and Fusing General Recursive Tree Traversals
OOPSLA
DOI
Type Test Scripts for TypeScript Testing
OOPSLA
DOI
Understanding the Use of Lambda Expressions in Java
OOPSLA
DOI
Unifying Typing and Subtyping
OOPSLA
DOI
Verifying Distributed Programs via Canonical Sequentialization
OOPSLA
DOI
Verifying Spatial Properties of Array Computations
OOPSLA
DOI
Verifying Strong Eventual Consistency in Distributed Systems
OOPSLA
DOI
Virtual Machine Warmup Blows Hot and Cold
OOPSLA
DOI
Who Guards the Guards? Formal Validation of the ARM v8-M Architecture Specification
OOPSLA
DOI

Call for Papers

New this year

Those familiar with previous OOPSLA conferences should be aware that this year, papers selected for OOPSLA 2017 will be published as the OOPSLA 2017 issue of a new journal, Proceedings of the ACM on Programming Languages (PACMPL), which replaces the previous OOPSLA conference proceedings. The move to PACMPL will have two noticeable impacts on authors:

  • PACMPL is a Gold Open Access journal, so all OOPSLA papers will be freely available to the public. PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge (currently 400 USD), but payment is not required or expected for publication. Authors are encouraged to support libre open access by licensing their work with the Creative Commons Attribution 4.0 International (CC-BY) license, which grants readers liberal (re-)use rights.

  • Submitted papers will use PACMPL’s new, single-column format, described in the Instructions for Authors.

Paper Selection Criteria

The program committee will consider the following criteria when evaluating submitted papers:

Novelty: The paper presents new ideas and/or results and places these ideas and results appropriately within the context established by previous research in the field.

Importance: The paper contributes significantly to the advancement of knowledge in the field. In addition to more traditional contributions, OOPSLA welcomes papers that diverge from the dominant trajectory of the field.

Evidence: The paper presents sufficient evidence supporting its claims. Examples of evidence include proofs, implemented systems, experimental results, statistical analyses, case studies, and anecdotes.

Clarity: The paper presents its contributions, methodology and results clearly.

Review Process

This section outlines the two-stage process with lightweight double-blind reviewing that will be used to select papers for presentation at OOPSLA 2017. A list of frequently asked questions and answers that address common concerns is available and will be updated as necessary to clarify and expand on this process.

OOPSLA 2017 will employ a two-stage review process. The first stage in the review process will assess submitted papers using the criteria stated above and will allow for feedback and input on initial reviews through the author response period discussed in the Instructions for Authors. At the PC meeting, a set of papers will be conditionally accepted and all other papers will be rejected. Authors will be notified of these decisions on June 21, 2017.

Authors of conditionally accepted papers will be provided with committee reviews along with a set of mandatory revisions. After five weeks (July 27, 2017), the authors will provide a second submission. The second and final reviewing phase assesses whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. The intent and expectation is that the mandatory revisions can be addressed within five weeks and hence that conditionally accepted papers will in general be accepted in the second phase.

The second submission should clearly identify how the mandatory revisions were addressed. To that end, the second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper. The cover letter will facilitate a quick second review, allowing for confirmation of final acceptance within two weeks. Conversely, the absence of a cover letter will be grounds for the paper’s rejection.

OOPSLA 2017 will employ a lightweight double-blind reviewing process. To facilitate this, submitted papers must adhere to two rules:

  1. author names and institutions must be omitted, and
  2. references to authors’ own related work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”).

The purpose of this process is to help the PC and external reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.

Submission Requirements

Details on formatting and other submission requirements can be found in the Instructions for Authors. In addition to the requirements for double-blind submission, submissions must conform to both the ACM Policies for Authorship and SIGPLAN’s Republication Policy. Authors of accepted papers will be required to sign a license or copyright release.

AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.

Artifact Evaluation

Authors of papers that are conditionally accepted in the first phase of the review process will be encouraged (but not required) to submit supporting materials for Artifact Evaluation. These items will then be reviewed by a committee, separate from the program committee, whose task is to assess how the artifacts support the work described in the associated paper. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers will be encouraged to make the supporting materials publicly available upon publication of the proceedings, for example, by including them as “source materials” in the ACM Digital Library. An additional seal will mark papers whose artifacts are made available, as outlined in the ACM guidelines for artifact badging.

Participation in Artifact Evaluation is voluntary and will not influence the final decision regarding paper acceptance.

Further information about the motivations and expectations for Artifact Evaluation can be found at https://2017.splashcon.org/track/splash-2017-OOPSLA-Artifacts.

More Information

For additional information, clarification, or answers to questions please contact the OOPSLA Chair (Jonathan Aldrich) at oopsla@splashcon.org.

NEW THIS YEAR:

  • Formatting requirements have changed; because OOPSLA is being published in the PACM PL journal, authors must now use the ACM Small template. This also affects the page limit. See below for details. Note that the required format was ACM Large at the time of submission, but PACM PL has switched to use the ACM Small format and this will be used for final submissions.

  • Rules governing the use of social media in the double-blind submission process have also changed to better balance double-blind reviewing with open research practices.

Submission Preparation Instructions

OOSPLA 2017 will employ a two-stage, lightweight double-blind reviewing process, so papers must be anonymized as described in the call for papers.

Deadlines: The deadline for abstract submission is Thursday, April 13, 2017, Anywhere on Earth (https://en.wikipedia.org/wiki/Anywhere_on_Earth). All OOPSLA 2017 submissions must include an abstract by this date. A full paper submission must be added by Monday, April 17, 2017, Anywhere on Earth. These deadlines will be strictly enforced.

Formatting: (NOTE: NEW FORMAT REQUIREMENTS FOR OOPSLA 2017) Submissions must be in PDF format, printable in black and white on US Letter sized paper, and interpretable by common PDF tools. All submissions must adhere to the “ACM Small” template that is available (in both LaTeX and Word formats) from http://www.acm.org/publications/authors/submissions.

For authors using LaTeX, a lighter-weight package, including only the essential files, is available from http://sigplan.org/Resources/Author/#acmart-format; the appropriate template for OOPSLA 2017 authors is in the file acmart-pacmpl-template.tex. As documented in the template, submissions should be prepared using the acmsmall and anonymous options. The use of the review option is also strongly encouraged but not required. (The review option will add line numbers, which will make it easier for reviewers to reference specific parts of your paper in their comments, but should have absolutely no other effect on the typesetting.) Details of available technical support for LaTeX-specific questions is available at http://www.acm.org/publications/authors/submissions#h-technical-support.

Submitted papers may be at most 20 pages long in 10 point font, excluding bibliographic references and appendices, in the new PACM PL format. This page limit was chosen to allow essentially the same amount of content with the new single-column format as was possible with the two-column format used in past OOPSLA conferences.

There is no page limit for bibliographic references and appendices, and, therefore, for the overall submission. However, reviewers are not obligated to read the appendices, so the main part of the paper should be self-contained.

Submissions that exceed the page limits or, for other reasons, do not meet the requirements for formatting, will be rejected without review.

Citations: As part of PACMPL, OOPSLA 2017 papers are expected to use author-year citations for references to other work. Author-year citations may be used as either a noun phrase, such as “The lambda calculus was originally conceived by Church (1932)”, or a parenthetic phase, such as “The lambda calculus (Church 1932) was intended as a foundation for mathematics”. A useful test for correct usage it to make sure that the text still reads correctly when the parenthesized portions of any references are omitted. Take care with prepositions; in the first example above, “by” is more appropriate than “in” because it allows the text to be read correctly as a reference to the author. Sometimes, readability may be improved by putting parenthetic citations at the end of a clause or a sentence, such as “A foundation for mathematics was provided by the lambda calculus (Church 1932)”. In LaTeX, use \citet{Church-1932} for citations as a noun phrase, “Church (1932)”, and \citep{Church-1932} for citations as a parenthetic phrase, “(Church 1932)”; for details, see Sections 2.3–2.5 of the natbib documentation (http://ctan.org/pkg/natbib).

Submission: Submissions are accepted at https://oopsla17.hotcrp.com/.

Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface.

Author Response Period: During the period of June 8-10, 2017, Anywhere On Earth, authors will be able to read reviews and respond to them.

Supplementary Materials: In addition to the anonymized appendix, authors have the option to attach non-anonymous supplementary material to a submission, on the understanding that reviewers may choose not to look at it. The material should be uploaded at submission time, as a single pdf or a tarball, not via a URL. This supplementary material need not be anonymized; it will only be revealed to reviewers after they have submitted their review of the paper and learned the identity of the author(s).

Authorship Policies: All submissions are expected to comply with the ACM Policies for Authorship that are detailed at https://www.acm.org/publications/authors/information-for-authors.

Republication Policies: Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by SIGPLAN’s Republication Policy. Submitters should also be aware of ACM’s Policy and Procedures on Plagiarism.

Resubmitted Papers: Authors who submit a revised version of a paper that has previously been rejected by another conference have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews.

Information for Authors of Accepted Papers

  • As a condition of acceptance, final versions of all papers must adhere to the new ACM Small format. The page limit for final versions of papers will be increased to 28 pages to ensure that authors have space to respond to reviewer comments and mandatory revisions, and because the ACM Small format uses slightly more pages than the ACM Large format used for submissions.

  • PACMPL is a Gold Open Access journal, so all OOPSLA papers will be freely available to the public. PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge (currently 400 USD), but paymentis not required or expected for publication.

  • Authors are encouraged to support libre open access by licensing their work with the Creative Commons Attribution 4.0 International (CC-BY) license, which grants readers liberal (re-)use rights. Alternatively, authors can use other licenses approved by the ACM or transfer the copyright to ACM. Further information about ACM author rights is available from http://authors.acm.org.

  • At least one author of each accepted submission will be expected to attend and present their paper at the conference (OOPSLA welcomes all authors, regardless of nationality. If any author of an accepted submission has visa-related difficulties in travelling to the conference, we will make arrangements to enable remote participation, and not require them to attend the conference in order to present their talk). The schedule for presentations will be determined and shared with authors after the full program has been selected. Presentations will be videotaped and released online if the presenter consents.

  • AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.

The following content is strongly based on Mike Hicks’s guidelines for POPL 2012, and has been honed by a number of authors including Frank Tip, Keshav Pingali, Richard Jones, John Boyland, Yannis Smaragdakis, and Jonathan Aldrich.

General

Q: Why are you using double-blind reviewing?

A: Our goal is to give each a reviewer an unbiased “first look” at each paper. Studies have shown that a reviewer’s attitude toward a submission may be affected, even unconsciously, by the identity of the author (see link below to more details). We want reviewers to be able to approach each submission without such involuntary reactions as “Barnaby; he writes a good paper” or “Who are these people? I have never heard of them.” For this reason, we ask that authors to omit their names from their submissions, and that they avoid revealing their identity through citation. Note that many systems and security conferences use double-blind reviewing and have done so for years (e.g., PLDI, ASPLOS, SIGCOMM, OSDI, IEEE Security and Privacy, SIGMOD, ISMM).

A key principle to keep in mind is that we intend this process to be cooperative, not adversarial. If a reviewer does discover an author’s identity though a subtle clue or oversight the author will not be penalized.

For those wanting more information, see the list of studies about gender bias in other fields and links to CS-related articles that cover this and other forms of bias below.

Q: Do you really think blinding actually works? I suspect reviewers can often guess who the authors are anyway.

A: Studies of blinding with the flavor we are using show that author identities remain unknown 53% to 79% of the time (see Snodgrass, linked below, for details). Moreover, about 5-10% of the time (again, see Snodgrass), a reviewer is certain of the authors, but then turns out to be at least partially mistaken. Yannis Smaragdakis’s survey of the OOPSLA 2016 PC showed that any given reviewer or a paper guessed at least one author correctly only 26-34% of the time, depending on whether you count a non-response to the survey as failure to guess or failure to answer. An additional 4-5% of reviewers guessed but did not correctly identify any author. So, while sometimes authorship can be guessed correctly, the question is, is imperfect blinding better than no blinding at all? If author names are not explicitly in front of the reviewer on the front page, does that help at all even for the remaining submissions where it would be possible to guess? Our conjecture is that on balance the answer is “yes”.

Q: Couldn’t blind submission create an injustice where a paper is inappropriately rejected based upon supposedly-prior work which was actually by the same authors and not previously published?

A: In the approach we are taking for OOPSLA, author names are revealed to reviewers after they have submitted their review and before final decisions are made. Therefore, a reviewer can correct their review if they indeed have penalized the authors inappropriately. Unblinding prior to (or at) the PC meeting also avoids abuses in which committee members end up advancing the cause of a paper with which they have a conflict.

For Authors

Q: What exactly do I have to do to anonymize my paper?

A: Your job is not to make your identity undiscoverable but simply to make it possible for our reviewers to evaluate your submission without having to know who you are. The main guidelines are simple: omit authors’ names from your title page (or list them as “omitted for submission”), and when you cite your own work, refer to it in the third person. For example, if your name is Smith and you have worked on amphibious type systems, instead of saying “We extend our earlier work on statically typed toads (Smith 2004),” you might say “We extend Smith’s (2004) earlier work on statically typed toads.” Also, be sure not to include any acknowledgements that would give away your identity.

Q: I would like to provide supplementary material for consideration, e.g., the code of my implementation or proofs of theorems. How do I do this?

A: On the submission site there will be an option to submit supplementary material along with your main paper. This supplementary material need not be anonymized, although this is strongly encouraged. Reviewers are under no obligation to look at this material. The submission itself is the object of review and so it should strive to convince the reader of at least the plausibility of reported results; supplemental material only serves to confirm, in more detail, the idea argued in the paper. Of course, reviewers are free to change their review upon viewing supplemental material (or for any other reason). For those authors who wish to supplement, we encourage them to mention the supplement in the body of the paper and to make clear whether the supplementary material is anonymized or not. E.g., “The proof of Lemma 1 is included in the non-anonymous supplemental material submitted with this paper.”

Q: I am building on my own past work on the WizWoz system. Do I need to rename this system in my paper for purposes of anonymity, or perhaps even avoid citing past work, so as to remove the implied connection between my authorship of past work on this system and my present submission?

A: No, you must not change the name and you should certainly cite your published past work! The relationship between systems and authors changes over time, so there will be at least some doubt about authorship. Increasing this doubt by changing the system name would help with anonymity, but it would compromise the research process. In particular, changing the name requires explaining a lot about the system again because you can’t just refer to the existing papers, which use the proper name. Not citing these papers runs the risk of the reviewers who know about the existing system thinking you are replicating earlier work. It is also confusing for the reviewers to read about the paper under Name X and then have the name be changed to Name Y. Will all the reviewers go and re-read the final version with the correct name? If not, they have the wrong name in their heads, which could be harmful in the long run.

Q: I am submitting a paper that extends my own work that previously appeared at a workshop. Should I anonymize any reference to that prior work?

A: Generally no, but the ideal course of action depends on the degree of similarity and on publication status. On one extreme, if your workshop paper is a publication (i.e., the workshop has published a proceedings, with your paper in it) and your current submission improves on that work, then you should cite the (non-anonymized) workshop paper as if it were written by someone else. On the other extreme, if your submission is effectively a longer, more complete version of an unpublished workshop paper (e.g., no formal proceedings), then you should include a (preferably anonymous) version of the workshop paper as supplementary material. In general, there is rarely a good reason to anonymize a citation. One possibility is for work that is tightly related to the present submission and is also under review. But such works may often be non-anonymous. When in doubt, contact the PC Chair.

Q: Am I allowed to post my (non-blinded) paper on my web page? Can I advertise the unblinded version of my paper on mailing lists or send it to colleagues? May I give a talk about my work while it is under review?

A: As far as the authors’ publicity actions are concerned, a paper under double-blind review is largely the same as a paper under regular (single-blind) review. Double-blind reviewing should not hinder the usual communication of results.

That said, we do ask that you not attempt to deliberately subvert the double-blind reviewing process by announcing the names of the authors of your paper to the potential reviewers of your paper. It is difficult to define exactly what counts as “subversion” here, but a blatant example would include sending individual e-mail to members of the PC about your work (unless they are conflicted with you anyway). On the other hand, it is perfectly fine, for example, to visit other institutions and give talks about your work, to present your submitted work during job interviews, to present your work at professional meetings (e.g. Dagstuhl), or to post your work on your web page. PC members will not be asked to recuse themselves from reviewing your paper unless they feel you have gone out of your way to advertise your authorship information to them. If you’re not sure about what constitutes “going out of your way”, please consult directly with the Program Chair.

We recognize that some researchers practice an open research style in which work is shared on mailing lists or social media as it is produced, and we think this style of research can coexist with double-blind reviewing if authors follow simple guidelines. Therefore, you may post to mailing lists (e.g., TYPES), social media, or another publicity channel about your submitted work, but you may not mention where the paper is submitted in such a posting, and you must not use the exact, as-submitted title in the posting while the paper is under review. The purpose of these rules is to ensure that reviewers can give most papers a first read without immediately knowing who the authors are; statistics from previous reviewing processes suggest that this is practicable in most cases.

Q: Will the fact that OOPSLA is double-blind have an impact on handling conflicts-of interest? When I am asked by the submission system to identify conflicts of interest, what criteria should I use?

A: Using DBR does not change the principle that reviewers should not review papers with which they have a conflict of interest, even if they do not immediately know who the authors are.

As an author, you should list PC members (and any others, since others may be asked for outside reviewers) who you believe have a conflict with you.

For Reviewers

Q: What should I do if I if I learn the authors’ identity? What should I do if a prospective OOPSLA author contacts me and asks to visit my institution?

A: If at any point you feel that the authors’ actions are largely aimed at ensuring that potential reviewers know their identity, you should contact the Program Chair. Otherwise you should not treat double-blind reviewing differently from regular blind reviewing. In particular, you should refrain from seeking out information on the authors’ identity, but if you discover it accidentally this will not automatically disqualify you as a reviewer. Use your best judgment.

Q: The authors have provided a URL to supplemental material. I would like to see the material but I worry they will snoop my IP address and learn my identity. What should I do?

A: Contact the Program Chair, who will download the material on your behalf and make it available to you.

Q: If I am assigned a paper for which I feel I am not an expert, how do I seek an outside review?

A: PC members should do their own reviews, not delegate them to someone else. If doing so is problematic for some papers, e.g., you don’t feel completely qualified, then consider the following options. First, submit a review for your paper that is as careful as possible, outlining areas where you think your knowledge is lacking. Assuming we have sufficient expert reviews, that could be the end of it: non-expert reviews are valuable too, since conference attendees are by-and-large not experts for any given paper. Second, the review form provides a mechanism for suggesting additional expert reviewers to the PC Chair, who may contact them if additional expertise is needed. Please do NOT contact outside reviewers yourself. As a last resort, if you feel like your review would be extremely uninformed and you’d rather not even submit a first cut, contact the PC Chair, and another reviewer will be assigned.

Q: How do we handle potential conflicts of interest since I cannot see the author names?

A: The conference review system will ask that you identify conflicts of interest when you get an account on the submission system. Please see the related question applied to authors to decide how to identify conflicts. Feel free to also identify additional authors whose papers you feel you could not review fairly for reasons other than those given (e.g., strong personal friendship).

More information about bias in merit reviewing

Kathryn McKinley’s editorial makes the case for double-blind reviewing from a computer science perspective. Her article cites Richard Snodgrass’s SIGMOD record editorial which collects many studies of the effects of potential bias in peer review. Mike Hicks’s Chair’s Report describes how POPL’12 used double-blind reviewing and analyzes its effectiveness.

Here are a few studies on the potential effects of bias manifesting in a merit review process, focusing on bias against women. (These were collected by David Wagner.)

There’s the famous story of gender bias in orchestra try-outs, where moving to blind auditions seems to have increased the hiring of female musicians by up to 33% or so. Today some orchestras even go so far as to ask musicians to remove their shoes (or roll out thick carpets) before auditioning, to try to prevent gender-revealing cues from the sound of the auditioner’s shoes.

One study found bias in assessment of identical CVs but with names and genders changed. In particular, the researchers mailed out c.v.’s for a faculty position, but randomly swapped the gender of the name on some of them. They found that both men and women reviewers ranked supposedly-male job applicants higher than supposedly-female applicants – even though the contents of the c.v. were identical. Presumably, none of the reviewers thought of themselves as biased, yet their evaluations in fact exhibited gender bias. (However: in contrast to the gender bias at hiring time, if the reviewers were instead asked to evaluate whether a candidate should be granted tenure, the big gender differences disappeared. For whatever that’s worth.)

The Implicit Association Test illustrates how factors can bias our decision-making, without us realising it. For instance, a large fraction of the population has a tendency to associate men with career (professional life) and women with family (home life), without realizing it. The claim is that we have certain gender stereotypes and schemas which unconsciously influence the way we think. The interesting thing about the IAT is that you can take it yourself. If you want to give it a try, select the Gender-Career IAT or the Gender-Science IAT from here. There’s evidence that these unconscious biases affect our behavior. For instance, one study of recommendation letters written for 300 applicants (looking only at the ones who were eventually hired) found that, when writing about men, letter-writers were more likely to highlight the applicant’s research and technical skills, while when writing about women, letter-writers were more likely to mention the applicant’s teaching and interpersonal skills.

This study reports experience from an ecology journal that switched from non-blind to blind reviewing. After the switch, they found a significant (~8%) increase in the acceptance rate for female-first-authored submissions. To put it another way, they saw a 33% increase in the fraction of published papers whose first author is female (28% -> 37%). Keep in mind that this is not a controlled experiment, so it proves correlation but not causation, and there appears to be controversy in the literature about the work. So it as at most a plausibility result that gender bias could be present in the sciences, but far from definitive.

Snodgrass’ studies includes some of these, and more.