SPLASH 2014 - OOPSLA - SPLASH 2014 (original) (raw)
The scope of OOPSLA includes all aspects of programming languages and software engineering, broadly construed.
Papers that address any aspect of software development are welcome, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, reuse, replacement, and retirement of software systems. Papers may address these topics in a variety of ways, including new tools (such as languages, program analyses, and runtime systems), new techniques (such as methodologies, design processes, code organization approaches, and management techniques), and new evaluations (such as formalisms and proofs, corpora analyses, user studies, and surveys).
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.
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
-
You're viewing the program in a time zone which is different from your device's time zone change time zone
| 10:30 - 12:00 | Program Analysis and the WebOOPSLA at Salon E Chair(s): Stephen Chong Harvard University |
|---|---|
| 10:3022mTalk | **Checking Correctness of TypeScript Interfaces for JavaScript Libraries**OOPSLAAsger Feldthaus Aarhus University, Anders Møller Aarhus University Link to publication |
| 10:5222mTalk | **Determinacy in Static Analysis for jQuery**OOPSLAEsben Andreasen Aarhus University, Anders Møller Aarhus University Link to publication |
| 11:1522mTalk | **EventBreak: Analyzing the Responsiveness of User Interfaces through Performance-Guided Test Generation**OOPSLAMichael Pradel University of California, Berkeley, USA, Parker Schuh University of California, Berkeley, George Necula University of California, Berkeley, Koushik Sen University of California, Berkeley Link to publication |
| 11:3722mTalk | **Using Web Corpus Statistics for Program Analysis**OOPSLAChun-Hung Hsiao University of Michigan, Michael Cafarella University of Michigan, Satish Narayanasamy University of Michigan Link to publication |
| 13:30 - 15:00 | Domain Specific LanguagesOOPSLA at Salon E Chair(s): Yannis Smaragdakis University of Athens |
|---|---|
| 13:3022mTalk | **Region-based memory management for GPU programming languages: Enabling rich data structures on a spartan host**OOPSLAEric Holk Indiana University, Ryan R. Newton Indiana University, Jeremy G. Siek , Andrew Lumsdaine Indiana University Link to publication |
| 13:5222mTalk | **Smten with Satisfiability-Based Search**OOPSLARichard Uhler MIT-CSAIL, Nirav Dave SRI International Link to publication |
| 14:1522mTalk | **StreamJIT: A Commensal Compiler for High-Performance Stream Programming**OOPSLAJeffrey Bosboom MIT CSAIL, Sumanaruban Rajadurai National University of Singapore, Weng-Fai Wong National University of Singapore, Saman Amarasinghe MIT Link to publication |
| 14:3722mTalk | **SurveyMan: Programming and Automatically Debugging Surveys**OOPSLAEmma Tosch University of Massachusetts, Amherst, Emery D. Berger University of Massachusetts, Amherst Link to publication File Attached |
| 10:30 - 12:00 | Energy and PerformanceOOPSLA at Salon F Chair(s): Shan Lu University of Chicago |
|---|---|
| 10:3022mTalk | **Continuously Measuring Critical Section Pressure with the Free-Lunch Profiler**OOPSLAFlorian David LIP6-UPMC/INRIA, Gaël Thomas LIP6-UPMC/INRIA, Julia Lawall LIP6, Gilles Muller LIP6-INRIA/UPMC Link to publication |
| 10:5222mTalk | **Chisel: Reliability-Aware Optimization of Approximate Computational Kernels**OOPSLASasa Misailovic MIT, Michael Carbin MIT, Sara Achour MIT, Zichao Qi MIT, Martin C. Rinard MIT Link to publication |
| 11:1522mTalk | **An Experimental Survey of Energy Management Across the Stack**OOPSLAMelanie Kambadur Columbia University, Martha A. Kim Columbia University Link to publication |
| 11:3722mTalk | **Understanding Energy Behaviors of Thread Management Constructs**OOPSLAGustavo Pinto Federal University of Pernambuco, Fernando Castor UFPE, Yu David Liu State University of New York (SUNY) Binghamton Link to publication |
| 13:30 - 15:00 | LanguagesOOPSLA at Salon E Chair(s): Crista Lopes University of California, Irvine |
|---|---|
| 13:3022mTalk | **Distributed REScala: An Update Algorithm for Distributed Reactive Programming**OOPSLAJoscha Drechsler Technische Universität Darmstadt, Guido Salvaneschi TU Darmstadt, A: Ragnar Mogk Technische Universität Darmstadt, A: Mira Mezini Technical University of Darmstadt Link to publication |
| 13:5222mTalk | **From Object Algebras to Attribute Grammars**OOPSLATillmann Rendel University of Marburg, Jonathan Immanuel Brachthäuser University of Marburg, Klaus Ostermann University of Marburg Link to publication |
| 14:1522mTalk | **Late Data Layout: Unifying Data Representation Transformations**OOPSLAVlad Ureche EPFL, Eugene Burmako EPFL, Martin Odersky Ecole Polytechnique Federale de Lausanne Link to publication |
| 14:3722mTalk | **i3QL: Language-Integrated Live Data Views**OOPSLARalf Mitschke Technical University of Darmstadt, Sebastian Erdweg TU Darmstadt, Mirko Köhler Technical University of Darmstadt, Mira Mezini Technical University of Darmstadt, Guido Salvaneschi TU Darmstadt Link to publication |
| 15:30 - 17:00 | DebuggingOOPSLA at Salon E Chair(s): Caitlin Sadowski Google |
|---|---|
| 15:3022mTalk | **CheckCell: Data Debugging for Spreadsheets**OOPSLADan Barowy University of Massachusetts, Amherst, Dimitar Gochev University of Massachusetts, Amherst, Emery D. Berger University of Massachusetts, Amherst Link to publication |
| 15:5222mTalk | **Finding Minimum Type Error Sources**OOPSLAZvonimir Pavlinovic New York University, Tim King New York University, Thomas Wies New York University Link to publication File Attached |
| 16:1522mTalk | **Flint: Fixing Linearizability Violations**OOPSLAPeng Liu Purdue University, Omer Tripp IBM Thomas J. Watson Research Center, Xiangyu Zhang Purdue University Link to publication |
| 16:3722mTalk | **Statistical Debugging for Real-World Performance Problems**OOPSLALinhai Song University of Wisconsin–Madison, Shan Lu University of Chicago Link to publication |
| 10:30 - 12:00 | Specification and VerificationOOPSLA at Salon E Chair(s): Gary T. Leavens University of Central Florida |
|---|---|
| 10:3022mTalk | **Bounded Exhaustive Test Input Generation from Hybrid Invariants**OOPSLANico Rosner Dept. of Computer Science FCEyN, University of Buenos Aires, Valeria Bengolea Dept. of Computer Science FCEFQyN, University of Rio Cuarto, Pablo Ponzio Dept. of Computer Science FCEFQyN, University of Rio Cuarto, Shadi Abdul Khalek Google, Nazareno Aguirre Dept. of Computer Science FCEFQyN, University of Rio Cuarto, Marcelo F. Frias Dept. of Software Engineering Instituto Tecnológico de Buenos Aires, Sarfraz Khurshid University of Texas at Austin Link to publication |
| 10:5222mTalk | **Compiler Verification Meets Cross-Language Linking via Data Abstraction**OOPSLAPeng Wang MIT CSAIL, Santiago Cuellar Princeton, Adam Chlipala MIT Link to publication |
| 11:1522mTalk | **GPS: Navigating Weak Memory with Ghosts, Protocols, and Separation**OOPSLAAaron Turon MPI-SWS, Viktor Vafeiadis MPI-SWS, Germany, Derek Dreyer MPI-SWS Link to publication |
| 11:3722mTalk | **Natural Proofs for Asynchronous Programs using Almost-Synchronous Invariants**OOPSLAAnkush Desai University of California, Berkeley, Pranav Garg University of Illinois at Urbana-Champaign, P. Madhusudan University of Illinois at Urbana-Champaign Link to publication |
| 10:30 - 12:00 | Dynamic OptimizationOOPSLA at Salon F Chair(s): Zachary Tatlock University of Washington, Seattle |
|---|---|
| 10:3022mTalk | **Accelerating Iterators in Optimizing AST Interpreters**OOPSLAWei Zhang University of California, Irvine, Per Larsen University of California, Irvine, Stefan Brunthaler University of California, Irvine, Michael Franz University of California, Irvine Link to publication |
| 10:5222mTalk | **Call Sequence Prediction through Probabilistic Calling Automata**OOPSLAZhijia Zhao College of William and Mary / North Carolina State University, Bo Wu College of William and Mary, Mingzhou Zhou College of William and Mary, Yufei Ding College of William and Mary, Jianhua Sun College of William and Mary, Xipeng Shen North Carolina State University, Youfeng Wu Intel Corporation Link to publication |
| 11:1522mTalk | **Space-Efficient Multi-Versioning for Input-Adaptive Feedback-Driven Program Optimizations**OOPSLAMingzhou Zhou College of William and Mary, Xipeng Shen North Carolina State University, Yaoqing Gao IBM Toronto Labs, Graham Yiu IBM Toronto Labs Link to publication |
| 11:3722mTalk | **The HipHop Virtual Machine**OOPSLAKeith Adams Facebook, Jason Evans Facebook, Bertrand Maher Facebook, Guilherme Ottoni Facebook, Drew Paroski Facebook, Brett Simmers Facebook, Edwin Smith Facebook, Owen Yamauchi Facebook Link to publication |
Accepted Papers
Call for Papers
PAPER SELECTION
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 or challenge the existing value system.
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.
Selection Process
OOPSLA 2014 will follow a two-phase review process that was initiated in OOPSLA 2013, with the goal of improving the quality of accepted papers. The first reviewing phase assesses the papers using the criteria stated above. At the PC meeting a set of papers will be conditionally accepted and all other papers will be rejected.
Authors of conditionally accepted papers will be provided with the usual committee reviews along with a set of mandatory revisions. After two months, the authors will provide a second submission. The second and final reviewing phase assesses how well the mandatory revisions have been performed 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 adequately addressed within two months and hence that conditionally accepted papers will 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 absence of this cover letter is grounds for the paper’s rejection.
SUBMISSION
OOPSLA 2014 submissions must conform to both the ACM Policy on Prior Publication and Simultaneous Submissions and the SIGPLAN Re-publication Policy. Submissions are single-blind (i.e., authors are not anonymous).
Format
Submissions should use the SIGPLAN Proceedings Format, 10 point font. Note that by default the SIGPLAN Proceedings Format produces papers in 9 point font. If you are formatting your paper using LaTeX, you will need to set the 10pt option in the \documentclass command. If you are formatting your paper using Word, you may wish to use the provided Word template that supports this font size. Please include page numbers in your submission. Setting the preprint option in the LaTeX \documentclass command generates page numbers. Please also ensure that your submission is legible when printed on a black and white printer. In particular, please check that colors remain distinct and font sizes are legible.
Page Limit
To ensure that papers stay focused on their core contributions, the main part of the paper (including bibliographic references) should be no longer than 14 pages. There is no page limit for 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. If the paper is accepted, the final submission will be limited to 20 pages, including appendices.
Artifact Evaluation
Authors of papers that are conditionally accepted in the first phase will be invited to formally submit supporting materials to the Artifact Evaluation process. This submission is voluntary and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves.
Authors of accepted papers are encouraged to make these materials publicly available upon publication of the proceedings, by including them as “source materials” in the ACM Digital Library.
Publication
AUTHORS TAKE NOTE: All accepted papers will be available in the ACM Digital Library as early as October 3, 2014. The official publication date is the date the proceedings are made available in the ACM Digital Library. The official publication date affects the deadline for any patent filings related to published work.
More Information
For additional information, clarification, or answers to questions please contact the OOPSLA Chair (Todd Millstein) at oopsla@splashcon.org.
Full Citation in the ACM Digital Library
Session: Program Analysis and the Web
Chair: Stephen Chong
Checking correctness of TypeScript interfaces for JavaScript libraries
Determinacy in static analysis for jQuery
- Esben Andreasen, Anders Møller
- Michael Pradel, Parker Schuh, George Necula, Koushik Sen
Using web corpus statistics for program analysis
- Chun-Hung Hsiao, Michael Cafarella, Satish Narayanasamy
Session: Runtime systems
Chair: Martin Hirzel
Tardis: affordable time-travel debugging in managed runtimes
- Earl T. Barr, Mark Marron
Phosphor: illuminating dynamic data flow in commodity jvms
- Jonathan Bell, Gail Kaiser
Rubah: DSU for Java on a stock JVM
- Luís Pina, Luís Veiga, Michael Hicks
Fast conservative garbage collection
- Rifat Shahriyar, Stephen M. Blackburn, Kathryn S. McKinley
Session: Domain Specific Languages
Chair: Yannis Smaragdakis
- Eric Holk, Ryan Newton, Jeremy Siek, Andrew Lumsdaine
Smten with satisfiability-based search
- Richard Uhler, Nirav Dave
StreamJIT: a commensal compiler for high-performance stream programming
- Jeffrey Bosboom, Sumanaruban Rajadurai, Weng-Fai Wong, Saman Amarasinghe
SurveyMan: programming and automatically debugging surveys
- Emma Tosch, Emery D. Berger
Session: Type Systems
Chair: Ravi Chugh
Rate types for stream programs
- Thomas W. Bartenstein, Yu David Liu
Foundations of path-dependent types
- Nada Amin, Tiark Rompf, Martin Odersky
- Esteban Allende, Johan Fabry, Ronald Garcia, Éric Tanter
Refactoring Java generics by inferring wildcards, in practice
- John Altidor, Yannis Smaragdakis
Session: Energy and Performance
Chair: Shan Lu
Continuously measuring critical section pressure with the free-lunch profiler
- Florian David, Gael Thomas, Julia Lawall, Gilles Muller
Chisel: reliability- and accuracy-aware optimization of approximate computational kernels
- Sasa Misailovic, Michael Carbin, Sara Achour, Zichao Qi, Martin C. Rinard
An experimental survey of energy management across the stack
- Melanie Kambadur, Martha A. Kim
Understanding energy behaviors of thread management constructs
- Gustavo Pinto, Fernando Castor, Yu David Liu
Session: Languages
Chair: Cristina V. Lopes
Distributed REScala: an update algorithm for distributed reactive programming
- Joscha Drechsler, Guido Salvaneschi, Ragnar Mogk, Mira Mezini
From object algebras to attribute grammars
- Tillmann Rendel, Jonathan Immanuel Brachthäuser, Klaus Ostermann
Late data layout: unifying data representation transformations
- Vlad Ureche, Eugene Burmako, Martin Odersky
i3QL: language-integrated live data views
- Ralf Mitschke, Sebastian Erdweg, Mirko Köhler, Mira Mezin, >Guido Salvaneschi
Session: Concurrency
Chair: David Grove
Atlas: leveraging locks for non-volatile memory consistency
- Dhruva R. Chakrabarti, Hans-J. Boehm, Kumud Bhandari
Fast splittable pseudorandom number generators
- Guy L. Steele, Jr., Doug Lea, Christine H. Flood
Multithreaded test synthesis for deadlock detection
- Malavika Samak, Murali Krishna Ramanathan
Symbolic execution of multithreaded programs from arbitrary program contexts
- Tom Bergan, Dan Grossman, Luis Ceze
Session: Debugging
Chair: Caitlin Sadowski
CheckCell: data debugging for spreadsheets
- Daniel W. Barowy, Dimitar Gochev, Emery D. Berger
Finding minimum type error sources
- Zvonimir Pavlinovic, Tim King, Thomas Wies
Flint: fixing linearizability violations
- Peng Liu, Omer Tripp, Xiangyu Zhang
Statistical debugging for real-world performance problems
- Linhai Song, Shan Lu
Session: Compilation tools
Chair: Robert Grimm
Adaptive LL(*) parsing: the power of dynamic analysis
- Terence Parr, Sam Harwell, Kathleen Fisher
Automated migration of build scripts using dynamic analysis and search-based refactoring
- Milos Gligoric, Wolfram Schulte, Chandra Prasad, Danny van Velzen, Iman Narasamdya, Benjamin Livshits
MIX10: compiling MATLAB to X10 for high performance
- Vineet Kumar, Laurie Hendren
Staged parser combinators for efficient data processing
- Manohar Jonnalagedda, Thierry Coppey, Sandro Stucki, Tiark Rompf, Martin Odersky
Session: Specification and verification
Chair: Gary T. Leavens
Bounded exhaustive test input generation from hybrid invariants
- Nicolás Rosner, Valeria Bengolea, Pablo Ponzio, Shadi Abdul Khalek, Nazareno Aguirre, Marcelo F. Frias, Sarfraz Khurshid
Compiler verification meets cross-language linking via data abstraction
- Peng Wang, Santiago Cuellar, Adam Chlipala
GPS: navigating weak memory with ghosts, protocols, and separation
- Aaron Turon, Viktor Vafeiadis, Derek Dreyer
Natural proofs for asynchronous programs using almost-synchronous reductions
- Ankush Desai, Pranav Garg, P. Madhusudan
Session: Dynamic optimization
Chair: Zach Tatlock
Accelerating iterators in optimizing AST interpreters
- Wei Zhang, Per Larsen, Stefan Brunthaler, Michael Franz
Call sequence prediction through probabilistic calling automata
- Zhijia Zhao, Bo Wu, Mingzhou Zhou, Yufei Ding, Jianhua Sun, Xipeng Shen, Youfeng Wu
Space-efficient multi-versioning for input-adaptive feedback-driven program optimizations
- Mingzhou Zhou, Xipeng Shen, Yaoqing Gao, Graham Yiu
- Keith Adams, Jason Evans, Bertrand Maher, Guilherme Ottoni, Andrew Paroski, Brett Simmers, Edwin Smith, Owen Yamauchi
Session: Static analysis
Chair: Anders Moeller
Validation of memory accesses through symbolic analyses
- Henrique Nazaré, Izabela Maffra, Willer Santos, Leonardo Barbosa, Laure Gonnord, Fernando Magno Quintão Pereira
Abstract semantic differencing via speculative correlation
- Nimrod Partush, Eran Yahav
Efficient subcubic alias analysis for C
- Qirun Zhang, Xiao Xiao, Charles Zhang, Hao Yuan, Zhendong Su
Static analysis for independent app developers
- Lucas Brutschy, Pietro Ferrara, Peter Müller
Session: Distributed computing
Chair: Madanlal Musuvathi
- Keval Vora, Sai Charan Koduru, Rajiv Gupta
Alembic: automatic locality extraction via migration
- Brandon Holt, Preston Briggs, Luis Ceze, Mark Oskin
Cybertron: pushing the limit on I/O reduction in data-parallel programs
- Tian Xiao, Zhenyu Hucheng Zhou, Jiaxing Zhang, Xu Zhao, Chencheng Ye, Xi Wang, Wei Lin, Wenguang Chen, Lidong Zhou
Translating imperative code to MapReduce
- Cosmin Radoi, Stephen J. Fink, Rodric Rabbah, Manu Sridharan