SPLASH 2022
Mon 5 - Sat 10 December 2022 Auckland, New Zealand

PACMPL Issue OOPSLA 2022 seeks contributions on all aspects of programming languages and software engineering. Authors of papers published in PACMPL Issue OOPSLA 2022 will be invited to present their work in the OOPSLA track of the SPLASH conference in December.

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

Accepted Papers

Title
A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency
OOPSLA
Pre-print
A case for DOT: Theoretical Foundations for Objects With Pattern Matching and GADT-style Reasoning
OOPSLA
A Conceptual Framework for Safe Object Initialization
OOPSLA
A Concurrent Program Logic with a Future and History
OOPSLA
A fast in-place interpreter for WebAssembly
OOPSLA
A General Construction for Abstract Interpretation of Higher-Order Automatic Differentiation
OOPSLA
AnICA: Analyzing Inconsistencies in Microarchitectural Code Analyzers
OOPSLA
Applying cognitive principles to model-finding output: the positive value of negative information
OOPSLA
DOI
A Study of Inline Assembly in Solidity Smart Contracts
OOPSLA
Automated transpilation of imperative to functional code using neural-guided program synthesis
OOPSLA
DOI
BFF: Foundational and Automated Verification of Bitfield-Manipulating Programs
OOPSLA
Bridging the Semantic Gap between Qualitative and Quantitative Models of Distributed Systems
OOPSLA
Bugs in Quantum computing platforms: an empirical study
OOPSLA
DOI
C4: verified transactional objects
OOPSLA
DOI
CAAT: Consistency as a Theory
OOPSLA
Checking Equivalence in a Non-Strict Language
OOPSLA
Coeffects for sharing and mutation
OOPSLA
Compilation of Dynamic Sparse Tensor Algebra
OOPSLA
Complexity-guided container replacement synthesis
OOPSLA
DOI
Compositional Embeddings of Domain-Specific Languages
OOPSLA
DOI Pre-print
Compositional Virtual Timelines: Verifying Dynamic-Priority Partitions with Algorithmic Temporal Isolation
OOPSLA
Concurrent size
OOPSLA
Consistency-Preserving Propagation for SMT Solving of Concurrent Program Verification
OOPSLA
Coverage-guided tensor compiler fuzzing with joint IR-pass mutation
OOPSLA
DOI
C to checked C by 3c
OOPSLA
DOI
Data-Driven Lemma Synthesis for Interactive Proofs
OOPSLA
Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back
OOPSLA
DOI
Elipmoc: advanced decompilation of Ethereum smart contracts
OOPSLA
DOI
Enabling End-Users to Create Larger Block-Based Programs by Supporting Scaffolded Function Decomposition
OOPSLA
End-to-end translation validation for the halide language
OOPSLA
DOI
Fast Shadow Execution for Debugging Numerical Errors using Error Free Transformations
OOPSLA
Pre-print
Finding real bugs in big programs with incorrectness logic
OOPSLA
DOI
First-class Names for Effect Handlers
OOPSLA
Fractional Resources in Unbounded Separation Logic
OOPSLA
Functional collection programming with semi-ring dictionaries
OOPSLA
DOI
Generic Go to Go: Dictionary-Passing, Monomorphisation, and Hybrid
OOPSLA
Pre-print
High-Level Effect Handlers in C++
OOPSLA
Highly Illogical, Kirk: Spotting Type Mismatches in the Large Despite Broken Contracts, Unsound Types, and Too Many Linters
OOPSLA
Implementing and Verifying Release-Acquire Transactional Memory in C11
OOPSLA
Incremental Analysis for Free: Using Scope Graphs to Derive Incremental Type-Checkers
OOPSLA
Indexing the Extended Dyck-CFL Reachability for Context-Sensitive Program Analysis
OOPSLA
Intrinsically-Typed Definitional Interpreters à la Carte
OOPSLA
Language-parametric static semantic code completion
OOPSLA
DOI
Le Temps des Cerises: Efficient Temporal Stack Safety on Capability Machines using Directed Capabilities
OOPSLA
DOI
Linear types for large-scale systems verification
OOPSLA
DOI
MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types
OOPSLA
Model Checking on Multi-Execution Memory Models
OOPSLA
Model-Guided Synthesis of Inductive Lemmas for FOL with Least Fixpoints
OOPSLA
Modular Verification of Op-Based CRDTs in Separation Logic
OOPSLA
Monadic and Comonadic Aspects of Dependency Analysis
OOPSLA
αNAS: Neural Architecture Search using Property Guided Synthesis
OOPSLA
Necessity Specifications are Necessary for Robustness
OOPSLA
Neurosymbolic Repair for Low-Code Formula Languages
OOPSLA
On incorrectness logic for Quantum programs
OOPSLA
DOI
Optimal Heap Limits for Reducing Browser Memory Use
OOPSLA
Oracle-Free Repair Synthesis for Floating-Point Programs
OOPSLA
Overwatch: Learning Patterns in Code Edit Sequences
OOPSLA
Parsing Randomness
OOPSLA
Plausible sealing for gradual parametricity
OOPSLA
DOI
Proof transfer for fast certification of multiple approximate neural networks
OOPSLA
DOI
Proving Hypersafety Compositionally
OOPSLA
Pre-print
Purity of an ST monad: full abstraction by semantically typed back-translation
OOPSLA
DOI
Quantitative strongest post: a calculus for reasoning about the flow of quantitative information
OOPSLA
DOI
Reasoning about Reconfigurations of Distributed Systems
OOPSLA
Satisfiability Modulo Fuzzing: A Synergistic Combination of SMT Solving and Fuzzing
OOPSLA
Scalable Linear Invariant Generation with Farkas' Lemma
OOPSLA
Scalable Verification of GNN-based Job Schedulers
OOPSLA
Semi-Symbolic Inference for Efficient Streaming Probabilistic Programming
OOPSLA
Seq2Parse: Neurosymbolic Parse Error Repair
OOPSLA
SHARP: fast incremental context-sensitive pointer analysis for Java
OOPSLA
DOI
SigVM: Enabling Event-Driven Execution for Truly Decentralized Smart Contracts
OOPSLA
Solo: A Lightweight Static Analysis for Differential Privacy
OOPSLA
Specification-Guided Component-Based Synthesis from Effectful Libraries
OOPSLA
Symbolic Execution for Randomized Programs
OOPSLA
Synthesis-Powered Optimization of Smart Contracts via Data Type Refactoring
OOPSLA
Synthesizing Abstract Transformers
OOPSLA
Synthesizing Axiomatizations using Logic Learning
OOPSLA
Synthesizing Code Quality Rules from Examples
OOPSLA
Synthesizing CRDTs from Sequential Data Types with Verified Lifting
OOPSLA
Pre-print
Synthesizing fine-grained synchronization protocols for implicit monitors
OOPSLA
DOI
Taming Transitive Redundancy for Context-Free Language Reachability
OOPSLA
The Essence of Online Data Processing
OOPSLA
The Road Not Taken: Exploring Alias Analysis Based Optimizations Missed by the Compiler
OOPSLA
This is the Moment for Probabilistic Loops
OOPSLA
Tower: Data Structures in Quantum Superposition
OOPSLA
Translating canonical SQL to imperative code in Coq
OOPSLA
DOI
Type-Directed Synthesis of Visualizations from Natural Language Queries
OOPSLA
UniRec: A Unimodular-like Framework for Nested Recursions and Loops
OOPSLA
Veracity: Declarative Multicore Programming with Commutativity
OOPSLA
Verified Compilation of Quantum Oracles
OOPSLA
Weighted programming: a programming paradigm for specifying mathematical models
OOPSLA
DOI
Wildcards Need Witness Protection
OOPSLA

Call for Papers

The OOPSLA issue of the Proceedings of the ACM on Programming Languages (PACMPL) welcomes papers focusing on all practical and theoretical investigations of programming languages, systems and environments. 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, techniques, principles, and evaluations.

NEW this year

  • OOPSLA 2022 will have two separate rounds of reviewing, with Round 1 submission deadline: October 12, 2021
  • In each round, papers will have a final outcome of Accept, Revise, or Reject—see Review Process for details.

Papers accepted at either of the rounds will be published in the 2022 volume of PACMPL(OOPSLA) and invited to be presented at the SPLASH conference in December 2022. In person attendance is not required; SPLASH will provide remote presentation options.

Review Process

PACMPL(OOPSLA) has two rounds of reviewing. The final outcome of each round can be one of Accept, Revise or Reject.

Accept: Accepted papers will appear in the 2022 volume of PACMPL(OOPSLA).

Revise: Papers in this category are invited to submit a revision to the next round of submissions with a specific set of expectations to be met. When authors resubmit, they should clearly explain how the revisions address the comments of the reviewers. The revised paper will be re-evaluated, and either accepted or rejected. Resubmitted papers will retain the same reviewers throughout the process. Papers with a Revise outcome in Round 2 and an Accept outcome in the subsequent Round 1 will appear in the 2023 volume of PACMPL(OOPSLA).

Reject: Rejected papers will not be included in the 2022 volume of PACMPL(OOPSLA). Papers in this category are not guaranteed a review if resubmitted less than one year from the date of original submission. A paper will be judged to be a resubmission if it is substantially similar to the original submission. The judgment that a paper is a resubmission of the same work is at the discretion of the Chairs.

Each round of reviewing consists of two phases. The first phase evaluates the papers and results in an early notification of Reject, Revise, or Conditional Accept. During the first phase, authors will be able to read their reviews and respond to them. The second phase is restricted to conditionally accepted papers. Authors must make a set of mandatory revisions. The second phase assesses whether the required revisions have been addressed. The outcome can be Accept, Revise or Reject.

Submissions

Submitted papers must be at most 23 pages in 10 point font. There is no page limit on references. No appendices are allowed on the main paper, instead authors can upload supplementary material with no page or content restrictions, but reviewers may choose to ignore it. The PACMPL templates used for SPLASH (Microsoft Word and LaTeX) can be found at the SIGPLAN author information page. In particular, authors using LaTeX should use the acmart-pacmpl-template.tex file (with the acmsmall option). Papers are expected to use author-year citations. 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”.

PACMPL uses double-blind reviewing. Authors’ identities are only revealed if a paper is accepted. Papers must

  1. omit author names and institutions,
  2. use the third person when referencing your work,
  3. anonymise supplementary material.

Nothing should be done in the name of anonymity that weakens the submission; see the DBR FAQ. When in doubt, contact the Review Committee Chairs.

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. Submissions are expected to comply with the ACM Policies for Authorship.

Artifacts

Authors should indicate with their initial submission if an artifact exists, describe its nature and limitations, and indicate if it will be submitted for evaluation. Accepted papers that fail to provide an artifact will be requested to explain the reason they cannot support replication. It is understood that some papers have no artifacts.

Publication

PACMPL is a Gold Open Access journal, all papers will be freely available to the public. Authors can voluntarily cover the article processing charge ($400), but payment is not required. The official publication date is the date the journal are made available in the ACM Digital Library. The journal issue and associated papers for Round 1 will be published in April 2022 and those for Round 2 in October 2022.

FAQ

Selection Criteria

We consider the following criteria when evaluating papers:

Novelty: The paper presents new ideas and results and places them appropriately within the context established by previous research.

Importance: The paper contributes to the advancement of knowledge in the field. We also welcome papers that diverge from the dominant trajectory of the field.

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

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

Artifacts

Q: Are artifacts required?

No! It is understood that some papers have no artifacts. But if an artifact is not provided when the claims in the paper refer to an artifact, the authors must explain why their work is not available for repetition.

Q: Can a paper be accepted if the artifact is rejected?

Yes! The reasons for rejecting an artifact are multiple and often stem from the quality of the packaging.

Double-Blinding Submissions (Authors)

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

Use common sense. Your job is not to make your identity undiscoverable but simply to make it possible for reviewers to evaluate your submission without having to know who you are. The specific guidelines stated in the call for papers are simple: omit authors’ names from your title page, 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: Should I change the name of my system?

No.

Q: My submission is based on code available in a public repository. How do I deal with this?

Cite the code in your paper, but remove the URL and, instead say “link to repository removed for double blind review”. If you believe reviewer access to your code would help during author response, contact the Review Committee Chairs.

Q: I am submitting an extension of my workshop paper, should I anonymize reference to that work?

No. But we recommend you do not use the same title, so that it is clearly distinguishes the papers.

Q: Am I allowed to post my paper on my web page or arXiv? send it to colleagues? give a talk about it? on social media?

We have developed guidelines to help navigate the tension between the normal communication of scientific results and actions that essentially force potential reviewers to learn the identity of authors. Roughly speaking, you may discuss work under submission, but you should not broadly advertise your work through media that is likely to reach your reviewers. We acknowledge there are gray areas and trade-offs. Things you may do:

  • Put your submission on your home page.
  • Discuss your work with anyone not on the review committees or reviewers with whom you already have a conflict.
  • Present your work at professional meetings, job interviews, etc.
  • Submit work previously discussed at an informal workshop, previously posted on arXiv or a similar site, previously submitted to a conference not using double-blind reviewing, etc.

Things you should not do:

  • Contact members of the review committee about your work, or deliberately present your work where you expect them to be.
  • Publicize your work on social media if wide public [re-]propagation is common (e.g., Twitter) and therefore likely to reach potential reviewers. For example, on Facebook, a post with a broad privacy setting (public or all friends) saying, “Whew, OOPSLA paper in, time to sleep” is okay, but one describing the work or giving its title is not appropriate. Alternately, a post to a group including only the colleagues at your institution is fine.

Reviewers 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 are unsure about what constitutes “going out of your way”, please contact the Review Committee Chairs.

Double-Blind (Reviewers)

Q: What should I do if I if I learn the authors’ identity?

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 Review Committee Chairs. 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 provided a URL to supplemental material, what should I do?

Contact the chairs.

Q: Can I seek an outside review?

No.

(based on the PLDI’20 DBR FAQ.)