SPLASH 2017 - OOPSLA - SPLASH 2017

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).

Time Zone

The program is currently displayed in (GMT-07:00) Tijuana, Baja California.

Use conference time zone: (GMT-07:00) Tijuana, Baja CaliforniaSelect other time zone

The GMT offsets shown reflect the offsets at the moment of the conference.

Time Band

By setting a time band, the program will dim events that are outside this time window. This is useful for (virtual) conferences with a continuous program (with repeated sessions).
The time band will also limit the events that are included in the personal iCalendar subscription service.

Display full programSpecify a time band

Save

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, CF 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, CF 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 Alastair Reid Arm Ltd 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 Binhang Yuan, Vijayaraghavan Murali, Chris Jermaine DOI
	Alpaca: Intermittent Execution without Checkpoints OOPSLA Kiwan Maeng, Alexei Colin, Brandon Lucia DOI
	A Model for Reasoning about JavaScript Promises OOPSLA Magnus Madsen, Ondřej Lhoták, Frank Tip DOI
	An Auditing Language for Preventing Correlated Failures in the Cloud OOPSLA Ennan Zhai, Ruzica Piskac, Ronghui Gu, Xun Lao, Xi Wang DOI
	A Simple Soundness Proof for Dependent Object Types OOPSLA Marianna Rapoport, Ifaz Kabir, Paul He, Ondřej Lhoták DOI
	A Solver-Aided Language for Test Input Generation OOPSLA Talia Ringer, Dan Grossman, Daniel Schwartz-Narbonne, Serdar Tasiran DOI
	Automated Testing of Graphics Shader Compilers OOPSLA Alastair F. Donaldson, Hugues Evrard, Andrei Lascu, Paul Thomson DOI
	Automatically Generating Features for Learning Program Analysis Heuristics for C-Like Languages OOPSLA Kwonsoo Chae, Hakjoo Oh, Kihong Heo, Hongseok Yang DOI
	A Verified Messaging System OOPSLA William Mansky, Andrew W. Appel, Aleksey Nogin DOI
	A Volatile-by-Default JVM for Server Applications OOPSLA Lun Liu, Todd Millstein, Madan Musuvathi DOI
	Bounded Exhaustive Test-Input Generation on GPUs OOPSLA Ahmet Celik, Sreepathi Pai, Sarfraz Khurshid, Milos Gligoric DOI
	Data-Driven Context-Sensitivity for Points-to Analysis OOPSLA Sehun Jeong, Minseok Jeon, Sungdeok (Steve) Cha, Hakjoo Oh DOI
	Deadlock Avoidance in Parallel Programs with Futures: Why Parallel Tasks Should Not Wait for Strangers OOPSLA Tiago Cogumbreiro, Rishi Surendran, Francisco Martins, Vivek Sarkar, Vasco T. Vasconcelos, Max Grossman DOI
	DéjàVu: A Map of Code Duplicates on GitHub OOPSLA Crista Lopes, Petr Maj, Pedro Martins, Vaibhav Saini, Di Yang, Jakub Zitny, Hitesh Sajnani, Jan Vitek DOI
	Detecting Argument Selection Defects OOPSLA Andrew Rice, Eddie Aftandilian, Ciera Jaspan, Emily Johnston, Michael Pradel, Yulissa Arroyo-Paredes DOI
	Effective Interactive Resolution of Static Analysis Alarms OOPSLA Xin Zhang, Radu Grigore, Xujie Si, Mayur Naik DOI
	Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols OOPSLA Nachshon Cohen, Michal Friedman, James Larus DOI
	Evaluating and Improving Semistructured Merge OOPSLA Guilherme Cavalcanti, Paulo Borba, Paola Accioly DOI
	Exploiting Implicit Beliefs to Resolve Sparse Usage Problem in Usage-Based Specification Mining OOPSLA Samantha Syeda Khairunnesa, Hoan Anh Nguyen, Tien N. Nguyen, Hridesh Rajan DOI
	FairSquare: Probabilistic Verification of Program Fairness OOPSLA Aws Albarghouthi, Loris D'Antoni, Samuel Drews, Aditya Nori DOI
	Familia: Unifying Interfaces, Type Classes, and Family Polymorphism OOPSLA Yizhou Zhang, Andrew Myers DOI
	Fast and Precise Type Checking for JavaScript OOPSLA Avik Chaudhuri, Panagiotis Vekris, Sam Goldman, Marshall Roch, Gabriel Levi DOI
	Geo-Distribution of Actor-Based Services OOPSLA Philip A. Bernstein, Sebastian Burckhardt, Sergey Bykov, Natacha Crooks, Jose Faleiro, Gabriel Kliot, Alok Kumbhare, Muntasir Raihan Rahman, Vivek Shah, Adriana Szekeres, Jorgen Thelin DOI
	GLORE: Generalized Loop Redundancy Elimination upon LER-Notation OOPSLA Yufei Ding, Xipeng Shen DOI
	Heaps Don't Lie: Countering Unsoundness with Heap Snapshots OOPSLA Neville Grech, George Fourtounis, Adrian Francalanza, Yannis Smaragdakis DOI
	How Type Errors Were Fixed and What Students Did? OOPSLA Baijun Wu, Sheng Chen DOI
	IDEal: Efficient and Precise Alias-Aware Dataflow Analysis OOPSLA Johannes Späth, Karim Ali, Eric Bodden DOI
	Instrumentation Bias for Dynamic Data Race Detection OOPSLA Benjamin P. Wood, Man Cao, Michael D. Bond, Dan Grossman DOI
	Learning to Blame: Localizing Novice Type Errors with Data-Driven Diagnosis OOPSLA Eric Seidel, Huma Sibghat, Kamalika Chaudhuri, Westley Weimer, Ranjit Jhala DOI
	Learning User Friendly Type-Error Messages OOPSLA Baijun Wu, John Peter Campora, Sheng Chen DOI
	Model-Assisted Machine-Code Synthesis OOPSLA Venkatesh Srinivasan, Ara Vartanian, Thomas Reps DOI
	Model Checking Copy Phases of Concurrent Copying Garbage Collection with Various Memory Models OOPSLA Tomoharu Ugawa, Tatsuya Abe, Toshiyuki Maeda DOI
	Monadic Composition for Deterministic, Parallel Batch Processing OOPSLA Ryan Scott, Omar Navarro-Leija, Ryan R. Newton, Joseph Devietti DOI
	Natural Synthesis of Provably-Correct Data-Structure Manipulations OOPSLA Xiaokang Qiu, Armando Solar-Lezama DOI
	Orca: GC and Type System Co-Design for Actor Languages OOPSLA Sylvan Clebsch, Juliana Franco, Sophia Drossopoulou, Albert Mingkun Yang, Tobias Wrigstad, Jan Vitek DOI
	Paxos Made EPR: Decidable Reasoning about Distributed Protocols OOPSLA Oded Padon, Giuliano Losa, Mooly Sagiv, Sharon Shoham DOI
	Practical Initialization Race Detection for JavaScript Web Applications OOPSLA Christoffer Quist Adamsen, Anders Møller, Frank Tip DOI
	Project Snowflake: Non-blocking Safe Manual Memory Management for .NET OOPSLA Matthew J. Parkinson, Dimitrios Vytiniotis, Kapil Vaswani, Manuel Costa, Pantazis Deligiannis, Dylan McDermott, Jonathan Balkind, Aaron Blankstein DOI
	P/Taint: Unified Points-to and Taint Analysis OOPSLA Neville Grech, Yannis Smaragdakis DOI
	Reasoning on Divergent Computations with Coaxioms OOPSLA Davide Ancona, Francesco Dagnino, Elena Zucca DOI
	Reliable and Automatic Composition of Language Extensions to C OOPSLA Ted Kaminski, Lucas Kramer, Travis Carlson, Eric Van Wyk DOI Pre-print
	Restricting Grammars with Tree Automata OOPSLA Michael D. Adams, Matthew Might DOI
	Robust and Compositional Verification of Object Capability Patterns OOPSLA David Swasey, Deepak Garg, Derek Dreyer DOI
	SAVI Objects: Sharing and Virtuality Incorporated OOPSLA Izzat El Hajj, Thomas B. Jablin, Dejan Milojicic, Wen-mei Hwu DOI
	Seam: Provably Safe Local Edits on Graphs OOPSLA Manolis Papadakis, Gilbert Louis Bernstein, Rahul Sharma, Alex Aiken, Pat Hanrahan DOI
	Skip Blocks: Reusing Execution History to Accelerate Web Scripts OOPSLA Sarah E. Chasins, Rastislav Bodík DOI
	Sound Gradual Typing Is Nominally Alive and Well OOPSLA Fabian Muehlboeck, Ross Tate DOI
	Sound Gradual Typing: Only Mostly Dead OOPSLA Spenser Andrew Bauman, Sam Tobin-Hochstadt, Jeremy G. Siek, CF Bolz-Tereick DOI
	SQLizer: Query Synthesis from Natural Language OOPSLA Navid Yaghmazadeh, Yuepeng Wang, Işıl Dillig, Thomas Dillig DOI
	Static Placement of Computation on Heterogeneous Devices OOPSLA Gabriel Poesia, Breno Campos Ferreira Guimarães, Fabrício Ferracioli, Fernando Magno Quintão Pereira DOI
	Static Stages for Heterogeneous Programming OOPSLA Adrian Sampson, Kathryn S McKinley, Todd Mytkowicz DOI Pre-print
	Synthesis of Data Completion Scripts using Finite Tree Automata OOPSLA Xinyu Wang, Işıl Dillig, Rishabh Singh DOI
	Synthesizing Configuration File Specifications with Association Rule Learning OOPSLA Mark Santolucito, Ennan Zhai, Rahul Dhodapkar, Aaron Shim, Ruzica Piskac DOI
	The Tensor Algebra Compiler OOPSLA Fredrik Kjolstad, Shoaib Kamil, Stephen Chou, David Lugato, Saman Amarasinghe DOI
	The VM Already Knew That: Leveraging Compile-Time Knowledge to Optimize Gradual Typing OOPSLA Gregor Richards, Ellen Arteca, Alexi Turcotte DOI
	TiML: A Functional Language for Practical Complexity Analysis with Invariants OOPSLA Peng Wang, Di Wang, Adam Chlipala DOI
	Transforming Programs and Tests in Tandem for Fault Localization OOPSLA Xia Li, Lingming Zhang DOI
	TreeFuser: A Framework for Analyzing and Fusing General Recursive Tree Traversals OOPSLA Laith Sakka, Kirshanthan Sundararajah, Milind Kulkarni DOI
	Type Test Scripts for TypeScript Testing OOPSLA Erik Krogh Kristensen, Anders Møller DOI
	Understanding the Use of Lambda Expressions in Java OOPSLA Davood Mazinanian, Ameya Ketkar, Nikolaos Tsantalis, Danny Dig DOI
	Unifying Typing and Subtyping OOPSLA Yanpeng Yang, Bruno C. d. S. Oliveira DOI
	Verifying Distributed Programs via Canonical Sequentialization OOPSLA Alexander Bakst, Klaus v. Gleissenthall, Ranjit Jhala, Rami Gökhan Kıcı DOI
	Verifying Spatial Properties of Array Computations OOPSLA Dominic Orchard, Mistral Contrastin, Matthew Danish, Andrew Rice DOI
	Verifying Strong Eventual Consistency in Distributed Systems OOPSLA Victor B. F. Gomes, Martin Kleppmann, Dominic P. Mulligan, Alastair R. Beresford DOI
	Virtual Machine Warmup Blows Hot and Cold OOPSLA Edd Barrett, CF Bolz-Tereick, Rebecca Killick, Sarah Mount, Laurence Tratt DOI
	Who Guards the Guards? Formal Validation of the ARM v8-M Architecture Specification OOPSLA Alastair Reid 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:

author names and institutions must be omitted, and
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.

OOPSLASPLASH 2017

Program Display Configuration

Wed 25 OctDisplayed time zone: Tijuana, Baja California change

Thu 26 OctDisplayed time zone: Tijuana, Baja California change

Fri 27 OctDisplayed time zone: Tijuana, Baja California change

Accepted Papers

Call for Papers

Instructions for Authors

FAQ on Double Blind Reviewing

Jonathan AldrichProgram Chair

Carnegie Mellon University

United States

Suparna Bhattacharya

Hewlett-Packard Enterprise

India

Hans-J. Boehm

Google

United States

Viviana Bono

University of Torino

Italy

Kim Bruce

Pomona College

United States

Jens Dietrich

Massey University

New Zealand

Gabriel Dos Reis

Texas A&M University and Microsoft

Irene Finocchi

Sapienza University of Rome, Italy

Italy

Elisa Gonzalez Boix

Vrije Universiteit Brussel

Belgium

Kathryn E. Gray

University of Cambridge

Atsushi Igarashi

Kyoto University, Japan

Japan

Ciera Jaspan

Google

Rezwana Karim

Samsung Research America

Doug Lea

State University of New York (SUNY) Oswego

United States

Shane McIntosh

McGill University

Canada

Kathryn S McKinley

Google

Mira Mezini

TU Darmstadt

Germany

Ana Milanova

Rensselaer Polytechnic Institute

United States

Heather Miller

Ecole Polytechnique Federale de Lausanne

Sasa Misailovic

University of Illinois at Urbana-Champaign, USA

Sarah Nadi

University of Alberta

Canada

Erez Petrank

Technion

Israel

Gregor Richards

University of Waterloo

Canada

Romain Robbes

Free University of Bozen-Bolzano

Italy

Jennifer B. Sartor

Vrije Universiteit Brussel

Belgium

Joshua Sunshine

Carnegie Mellon University

Tom Van Cutsem

Wed 25 Oct
Displayed time zone: Tijuana, Baja California change

Thu 26 Oct
Displayed time zone: Tijuana, Baja California change

Fri 27 Oct
Displayed time zone: Tijuana, Baja California change