OOPSLASPLASH 2014
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).
Wed 22 Oct Times are displayed in time zone: Tijuana, Baja California change
10:30 - 12:00: Program Analysis and the WebOOPSLA at Salon E Chair(s): Stephen ChongHarvard University | |||
10:30 - 10:52 Talk | Checking Correctness of TypeScript Interfaces for JavaScript Libraries OOPSLA Link to publication | ||
10:52 - 11:15 Talk | Determinacy in Static Analysis for jQuery OOPSLA Link to publication | ||
11:15 - 11:37 Talk | EventBreak: Analyzing the Responsiveness of User Interfaces through Performance-Guided Test Generation OOPSLA Michael PradelUniversity of California, Berkeley, USA, Parker SchuhUniversity of California, Berkeley, George NeculaUniversity of California, Berkeley, Koushik SenUniversity of California, Berkeley Link to publication | ||
11:37 - 12:00 Talk | Using Web Corpus Statistics for Program Analysis OOPSLA Chun-Hung HsiaoUniversity of Michigan, Michael CafarellaUniversity of Michigan, Satish NarayanasamyUniversity of Michigan Link to publication |
10:30 - 10:52 Talk | Tardis: Affordable Time-Travel Debugging in Managed Runtimes OOPSLA Link to publication | ||
10:52 - 11:15 Talk | Phosphor: Illuminating Dynamic Data Flow in Commodity JVMs OOPSLA Link to publication Media Attached | ||
11:15 - 11:37 Talk | Rubah: DSU for Java on a stock JVM OOPSLA Luís PinaTechnical University of Lisbon / INESC-ID, Luís VeigaINESC-ID / Instituto Superior Técnico, Universidade de Lisboa, Michael HicksUniversity of Maryland, College Park Link to publication | ||
11:37 - 12:00 Talk | Fast Conservative Garbage Collection OOPSLA Rifat ShahriyarAustralian National University, Steve BlackburnAustralian National University , Kathryn S McKinleyMicrosoft Research Link to publication |
13:30 - 15:00: Domain Specific LanguagesOOPSLA at Salon E Chair(s): Yannis SmaragdakisUniversity of Athens | |||
13:30 - 13:52 Talk | Region-based memory management for GPU programming languages: Enabling rich data structures on a spartan host OOPSLA Eric HolkIndiana University, Ryan R. NewtonIndiana University, Jeremy G. Siek, Andrew LumsdaineIndiana University Link to publication | ||
13:52 - 14:15 Talk | Smten with Satisfiability-Based Search OOPSLA Link to publication | ||
14:15 - 14:37 Talk | StreamJIT: A Commensal Compiler for High-Performance Stream Programming OOPSLA Jeffrey BosboomMIT CSAIL, Sumanaruban RajaduraiNational University of Singapore, Weng-Fai WongNational University of Singapore, Saman AmarasingheMIT Link to publication | ||
14:37 - 15:00 Talk | SurveyMan: Programming and Automatically Debugging Surveys OOPSLA Link to publication File Attached |
Thu 23 Oct Times are displayed in time zone: Tijuana, Baja California change
10:30 - 10:52 Talk | Rate Types for Stream Programs OOPSLA Link to publication File Attached | ||
10:52 - 11:15 Talk | Foundations of Path-Dependent Types OOPSLA Nada AminEPFL, Tiark RompfPurdue & Oracle Labs, Martin OderskyEcole Polytechnique Federale de Lausanne Link to publication File Attached | ||
11:15 - 11:37 Talk | Confined Gradual Typing OOPSLA Esteban Allende, Johan FabryUniversity of Chile, Ronald GarciaUniversity of British Columbia, Éric TanterUniversity of Chile Link to publication | ||
11:37 - 12:00 Talk | Refactoring Java Generics by Inferring Wildcards, In Practice OOPSLA Link to publication File Attached |
10:30 - 10:52 Talk | Continuously Measuring Critical Section Pressure with the Free-Lunch Profiler OOPSLA Florian DavidLIP6-UPMC/INRIA, Gaël ThomasLIP6-UPMC/INRIA, Julia LawallLIP6, Gilles MullerLIP6-INRIA/UPMC Link to publication | ||
10:52 - 11:15 Talk | Chisel: Reliability-Aware Optimization of Approximate Computational Kernels OOPSLA Link to publication | ||
11:15 - 11:37 Talk | An Experimental Survey of Energy Management Across the Stack OOPSLA Link to publication | ||
11:37 - 12:00 Talk | Understanding Energy Behaviors of Thread Management Constructs OOPSLA Gustavo PintoFederal University of Pernambuco, Fernando CastorUFPE, Yu David LiuState University of New York (SUNY) Binghamton Link to publication |
13:30 - 13:52 Talk | Distributed REScala: An Update Algorithm for Distributed Reactive Programming OOPSLA Joscha DrechslerTechnische Universität Darmstadt, Guido SalvaneschiTU Darmstadt, A: Ragnar MogkTechnische Universität Darmstadt, A: Mira MeziniTechnical University of Darmstadt Link to publication | ||
13:52 - 14:15 Talk | From Object Algebras to Attribute Grammars OOPSLA Tillmann RendelUniversity of Marburg, Jonathan Immanuel BrachthäuserUniversity of Marburg, Klaus OstermannUniversity of Marburg Link to publication | ||
14:15 - 14:37 Talk | Late Data Layout: Unifying Data Representation Transformations OOPSLA Link to publication | ||
14:37 - 15:00 Talk | i3QL: Language-Integrated Live Data Views OOPSLA Ralf MitschkeTechnical University of Darmstadt, Sebastian ErdwegTU Darmstadt, Mirko KöhlerTechnical University of Darmstadt, Mira MeziniTechnical University of Darmstadt, Guido SalvaneschiTU Darmstadt Link to publication |
13:30 - 13:52 Talk | Atlas: Leveraging Locks for Non-volatile Memory Consistency OOPSLA Link to publication | ||
13:52 - 14:15 Talk | Fast Splittable Pseudorandom Number Generators OOPSLA Guy L. Steele Jr.Oracle Labs, Doug LeaState University of New York (SUNY) Oswego, Christine H. FloodRed Hat Link to publication | ||
14:15 - 14:37 Talk | Multithreaded Test Synthesis for Deadlock Detection OOPSLA Malavika SamakIndian Institute of Science, Bangalore, Murali Krishna RamanathanIndian Institute of Science, Bangalore Link to publication | ||
14:37 - 15:00 Talk | Symbolic Execution of Multithreaded Programs from Arbitrary Program Contexts OOPSLA Tom BerganUniversity of Washington, Dan GrossmanUniversity of Washington, Luis CezeUniversity of Washington Link to publication |
15:30 - 15:52 Talk | CheckCell: Data Debugging for Spreadsheets OOPSLA Dan BarowyUniversity of Massachusetts, Amherst, Dimitar GochevUniversity of Massachusetts, Amherst, Emery D. BergerUniversity of Massachusetts, Amherst Link to publication | ||
15:52 - 16:15 Talk | Finding Minimum Type Error Sources OOPSLA Link to publication File Attached | ||
16:15 - 16:37 Talk | Flint: Fixing Linearizability Violations OOPSLA Peng LiuPurdue University, Omer TrippIBM Thomas J. Watson Research Center, Xiangyu ZhangPurdue University Link to publication | ||
16:37 - 17:00 Talk | Statistical Debugging for Real-World Performance Problems OOPSLA Link to publication |
15:30 - 15:52 Talk | Adaptive LL(*) Parsing: The Power of Dynamic Analysis OOPSLA Terence ParrUniversity of San Francisco, Sam HarwellUniversity of Texas at Austin, Kathleen FisherTufts University Link to publication File Attached | ||
15:52 - 16:15 Talk | Automated Migration of Build Scripts using Dynamic Analysis and Search-Based Refactoring OOPSLA Milos GligoricUniversity of Illinois at Urbana-Champaign, Wolfram SchulteMicrosoft, Chandra PrasadMicrosoft, Danny van VelzenMicrosoft, Iman NarasamdyaMicrosoft, Ben LivshitsMicrosoft Research Link to publication | ||
16:15 - 16:37 Talk | Mix10: Compiling MATLAB to X10 for High Performance OOPSLA Link to publication | ||
16:37 - 17:00 Talk | Staged Parser Combinators for Efficient Data Processing OOPSLA Manohar JonnalageddaEPFL, Switzerland, Thierry CoppeyEPFL, Switzerland; Google, Sandro StuckiEPFL, Switzerland, Tiark RompfPurdue & Oracle Labs, Martin OderskyEcole Polytechnique Federale de Lausanne Link to publication |
Fri 24 Oct Times are displayed in time zone: Tijuana, Baja California change
10:30 - 12:00: Specification and VerificationOOPSLA at Salon E Chair(s): Gary Leavens University of Central Florida | |||
10:30 - 10:52 Talk | Bounded Exhaustive Test Input Generation from Hybrid Invariants OOPSLA Nico RosnerDept. of Computer Science FCEyN, University of Buenos Aires, Valeria BengoleaDept. of Computer Science FCEFQyN, University of Rio Cuarto, Pablo PonzioDept. of Computer Science FCEFQyN, University of Rio Cuarto, Shadi Abdul KhalekGoogle, Nazareno AguirreDept. of Computer Science FCEFQyN, University of Rio Cuarto, Marcelo F. FriasDept. of Software Engineering Instituto Tecnológico de Buenos Aires, Sarfraz KhurshidUniversity of Texas at Austin Link to publication | ||
10:52 - 11:15 Talk | Compiler Verification Meets Cross-Language Linking via Data Abstraction OOPSLA Link to publication | ||
11:15 - 11:37 Talk | GPS: Navigating Weak Memory with Ghosts, Protocols, and Separation OOPSLA Link to publication | ||
11:37 - 12:00 Talk | Natural Proofs for Asynchronous Programs using Almost-Synchronous Invariants OOPSLA Ankush DesaiUniversity of California, Berkeley, Pranav GargUniversity of Illinois at Urbana-Champaign, P. MadhusudanUniversity of Illinois at Urbana-Champaign Link to publication |
10:30 - 12:00: Dynamic OptimizationOOPSLA at Salon F Chair(s): Zachary TatlockUniversity of Washington, Seattle | |||
10:30 - 10:52 Talk | Accelerating Iterators in Optimizing AST Interpreters OOPSLA Wei ZhangUniversity of California, Irvine, Per LarsenUniversity of California, Irvine, Stefan BrunthalerUniversity of California, Irvine, Michael FranzUniversity of California, Irvine Link to publication | ||
10:52 - 11:15 Talk | Call Sequence Prediction through Probabilistic Calling Automata OOPSLA Zhijia ZhaoCollege of William and Mary / North Carolina State University, Bo WuCollege of William and Mary, Mingzhou ZhouCollege of William and Mary, Yufei DingCollege of William and Mary, Jianhua SunCollege of William and Mary, Xipeng ShenNorth Carolina State University, Youfeng WuIntel Corporation Link to publication | ||
11:15 - 11:37 Talk | Space-Efficient Multi-Versioning for Input-Adaptive Feedback-Driven Program Optimizations OOPSLA Mingzhou ZhouCollege of William and Mary, Xipeng ShenNorth Carolina State University, Yaoqing GaoIBM Toronto Labs, Graham YiuIBM Toronto Labs Link to publication | ||
11:37 - 12:00 Talk | The HipHop Virtual Machine OOPSLA Keith AdamsFacebook, Jason EvansFacebook, Bertrand MaherFacebook, Guilherme OttoniFacebook, Drew ParoskiFacebook, Brett SimmersFacebook, Edwin SmithFacebook, Owen YamauchiFacebook Link to publication |
13:30 - 13:52 Talk | Validation of Memory Accesses Through Symbolic Analyses OOPSLA Henrique Nazaré SantosUFMG, Izabela Karennina Travizani MaffraUFMG, Willer Fernandes SantosUFMG, Leonardo Barbosa OliveiraUFMG, Laure GonnordUniversity of Lyon & LIP, France, Fernando Magno Quintão PereiraUFMG Link to publication | ||
13:52 - 14:15 Talk | Abstract Semantic Differencing via Speculative Correlation OOPSLA Link to publication | ||
14:15 - 14:37 Talk | Efficient Subcubic Alias Analysis for C OOPSLA Qirun ZhangThe Hong Kong University of Science and Technology, A: Xiao XiaoThe Hong Kong University of Science and Technology, A: Charles ZhangHong Kong University of Science and Technology, A: Hao YuanBOPU Technologies, A: Zhendong SuUniversity of California, Davis Link to publication | ||
14:37 - 15:00 Talk | Static Analysis for Independent App Developers OOPSLA Lucas BrutschyETH Zurich, Pietro FerraraIBM Thomas J. Watson Research Center, Peter MüllerETH Zurich Link to publication |
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.
Accepted Papers
Proceedings
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 EventBreak: analyzing the responsiveness of user interfaces through performance-guided test generation Using web corpus statistics for program analysisSession: Runtime systems
Chair: Martin Hirzel
Tardis: affordable time-travel debugging in managed runtimes Phosphor: illuminating dynamic data flow in commodity jvms Rubah: DSU for Java on a stock JVM Fast conservative garbage collectionSession: Domain Specific Languages
Chair: Yannis Smaragdakis
Region-based memory management for GPU programming languages: enabling rich data structures on a spartan host Smten with satisfiability-based search StreamJIT: a commensal compiler for high-performance stream programming SurveyMan: programming and automatically debugging surveysSession: Type Systems
Chair: Ravi Chugh
Rate types for stream programs Foundations of path-dependent types Confined gradual typing Refactoring Java generics by inferring wildcards, in practiceSession: Energy and Performance
Chair: Shan Lu
Continuously measuring critical section pressure with the free-lunch profiler Chisel: reliability- and accuracy-aware optimization of approximate computational kernels An experimental survey of energy management across the stack Understanding energy behaviors of thread management constructsSession: Languages
Chair: Cristina V. Lopes
Distributed REScala: an update algorithm for distributed reactive programming From object algebras to attribute grammars Late data layout: unifying data representation transformations i3QL: language-integrated live data viewsSession: Concurrency
Chair: David Grove
Atlas: leveraging locks for non-volatile memory consistency Fast splittable pseudorandom number generators Multithreaded test synthesis for deadlock detection Symbolic execution of multithreaded programs from arbitrary program contextsSession: Debugging
Chair: Caitlin Sadowski
CheckCell: data debugging for spreadsheets Finding minimum type error sources Flint: fixing linearizability violations Statistical debugging for real-world performance problemsSession: Compilation tools
Chair: Robert Grimm
Adaptive LL(*) parsing: the power of dynamic analysis Automated migration of build scripts using dynamic analysis and search-based refactoring MIX10: compiling MATLAB to X10 for high performance Staged parser combinators for efficient data processingSession: Specification and verification
Chair: Gary T. Leavens
Bounded exhaustive test input generation from hybrid invariants Compiler verification meets cross-language linking via data abstraction GPS: navigating weak memory with ghosts, protocols, and separation Natural proofs for asynchronous programs using almost-synchronous reductionsSession: Dynamic optimization
Chair: Zach Tatlock
Accelerating iterators in optimizing AST interpreters Call sequence prediction through probabilistic calling automata Space-efficient multi-versioning for input-adaptive feedback-driven program optimizations The hiphop virtual machineSession: Static analysis
Chair: Anders Moeller
Validation of memory accesses through symbolic analyses Abstract semantic differencing via speculative correlation Efficient subcubic alias analysis for C Static analysis for independent app developersSession: Distributed computing
Chair: Madanlal Musuvathi
ASPIRE: exploiting asynchronous parallelism in iterative algorithms using a relaxed consistency based DSM Alembic: automatic locality extraction via migration Cybertron: pushing the limit on I/O reduction in data-parallel programs Translating imperative code to MapReduce