ESOP 2015
Tue 14 - Thu 16 April 2015 London, United Kingdom

The ESOP 2015 Call for Paper is in the next tab.

A “frequently asked question” rubric list all sorts of important and mundane details about the reviewing process.

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

Tue 14 Apr

Displayed time zone: Azores change

10:30 - 12:30
Session 1ESOP at Skeel
Chair(s): Jan Vitek Northeastern University
10:30
30m
Talk
Probabilistic Programs as Spreadsheet Queries
ESOP
Andrew D. Gordon Microsoft Research and University of Edinburgh, Claudio Russo Microsoft Research, Marcin Szymczak University of Edinburgh, Johannes Borgström Uppsala University, Nicolas Rolland Microsoft Research, Thore Graepel Microsoft Research, Daniel Tarlow Microsoft Research
11:00
30m
Talk
Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection
ESOP
Tie Cheng CNRS, ENS, INRIA, Paris, France, Xavier Rival INRIA/CNRS/ENS Paris
11:30
30m
Talk
Running Probabilistic Programs Backwards
ESOP
Neil Toronto Brigham Young University, Jay McCarthy , David Van Horn
12:00
30m
Talk
A Verified Compiler for Probability Density Functions
ESOP
Manuel Eberl Technische Universität München, Johannes Hölzl Technische Universität München, Tobias Nipkow Technische Universität München
14:00 - 16:00
Session 2ESOP at Skeel
Chair(s): Gavin Bierman Oracle Labs
14:00
30m
Talk
Segment Abstraction for Worst-Case Execution Time Analysis
ESOP
Pavol Cerny University of Colorado Boulder, Thomas A. Henzinger IST Austria, Laura Kovacs Chalmers University of Technology, Arjun Radhakrishna Microsoft, Jakob Zwirchmayr IRIT Toulouse
14:30
30m
Talk
Automatic Static Cost Analysis for Parallel Programs
ESOP
Jan Hoffmann Yale University, Zhong Shao Yale University
15:00
30m
Talk
Sound, modular and compositional verification of the input/output behavior of programs
ESOP
Willem Penninckx KU Leuven, Bart Jacobs iMinds - Distrinet, KU Leuven, Frank Piessens iMinds - Distrinet, KU Leuven
15:30
30m
Talk
Unrestricted Termination and Non-Termination Arguments for Bit-Vector Programs
ESOP
Cristina David University of Oxford, Daniel Kroening University of Oxford, Matt Lewis University of Oxford
16:30 - 18:00
Session 3ESOP at Skeel
Chair(s): Dave Sands Chalmers University of Technology
16:30
30m
Talk
A Theory of Name Resolution
ESOP
Pierre Neron TU Delft, Andrew Tolmach Portland State University, Eelco Visser Delft University of Technology, Guido Wachsmuth Delft University of Technology
17:00
30m
Talk
A Core Calculus for XQuery 3.0: Combining Navigational and Pattern Matching Approaches
ESOP
Giuseppe Castagna Paris Diderot University & CNRS, Hyeonseung Im INRIA Grenoble Rhône-Alpes, Kim Nguyễn LRI, Université Paris-Sud, Véronique Benzaken LRI, Université Paris-Sud
17:30
30m
Talk
IsoLate: A Type System for Self-Recursion
ESOP
Ravi Chugh University of Chicago

Wed 15 Apr

Displayed time zone: Azores change

10:30 - 12:30
Session 4ESOP at Skeel
Chair(s): Lars Birkedal Aarhus University
10:30
30m
Talk
The Problem of Programming Language Concurrency Semantics
ESOP
Mark Batty University of Cambridge, Kayvan Memarian University of Cambridge, Kyndylan Nienhuis University of Cambridge, Jean Pichon-Pharabod University of Cambridge, Peter Sewell University of Cambridge
11:00
30m
Talk
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO
ESOP
Parosh Aziz Abdulla , Mohamed Faouzi Atig Uppsala University, Tuan Phong Ngo Uppsala University
11:30
30m
Talk
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
ESOP
Ilya Sergey IMDEA Software Institute, Aleksandar Nanevski IMDEA Software Institute, Anindya Banerjee IMDEA Software Institute
12:00
30m
Talk
Witnessing (Co)datatypes
ESOP
Jasmin Blanchette TU Munich, Andrei Popescu Middlesex University, London, Dmitriy Traytel TU Munich
14:00 - 16:00
Session 5ESOP at Skeel
Chair(s): Jan Vitek Northeastern University
14:00
30m
Talk
Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System
ESOP
Burke Fetscher Northwestern University, Koen Claessen Chalmers University of Technology, Michał Pałka Chalmers University of Technology, John Hughes Chalmers University of Technology, Robby Findler Northwestern University
14:30
30m
Talk
Refinement Types for Incremental Computational Complexity
ESOP
Ezgi Çiçek MPI-SWS, Deepak Garg MPI-SWS, Umut A. Acar Carnegie Mellon University
15:00
30m
Talk
Monotonic References for Efficient Gradual Typing
ESOP
Jeremy G. Siek Indiana University, Michael M. Vitousek Indiana University, Matteo Cimini Indiana University, Sam Tobin-Hochstadt Indiana University, Ronald Garcia University of British Columbia
15:30
30m
Talk
Inter-procedural Two-Variable Herbrand Equalities
ESOP
Stefan Schulze Frielinghaus Technische Universität München, Michael Petter Technische Universität München, Helmut Seidl Technische Universität München
16:30 - 18:00
Session 6ESOP at Skeel
Chair(s): Helmut Seidl Technische Universität München
16:30
30m
Talk
Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages
ESOP
Arlen Cox University of Colorado Boulder, Bor-Yuh Evan Chang University of Colorado Boulder, Xavier Rival INRIA/CNRS/ENS Paris
17:00
30m
Talk
Fine-grained Detection of Privilege Escalation Attacks on Browser Extensions
ESOP
Stefano Calzavara Università Ca' Foscari Venezia, Michele Bugliesi Università Ca' Foscari Venezia, Silvia Crafa University of Padova, Enrico Steffinlongo Università Ca' Foscari Venezia
17:30
30m
Talk
Analysis of Asynchronous Programs with Event-Based Synchronization
ESOP
Michael Emmi IMDEA Software Institute, Pierre Ganty IMDEA Software Institute, Rupak Majumdar MPI-SWS, Fernando Rosa-Velardo Universidad Complutense de Madrid

Thu 16 Apr

Displayed time zone: Azores change

10:30 - 12:30
Session 7ESOP at Skeel
Chair(s): Delphine Demange IRISA / University of Rennes 1
10:30
30m
Talk
A Semantics for Propositions as Sessions
ESOP
Sam Lindley University of Edinburgh, J. Garrett Morris The University of Edinburgh
11:00
30m
Talk
Composite Replicated Data Types
ESOP
Alexey Gotsman IMDEA, Hongseok Yang University of Oxford
11:30
30m
Talk
Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement
ESOP
Tachio Terauchi JAIST, Hiroshi Unno University of Tsukuba
12:00
30m
Talk
Spatial Interpolants
ESOP
Aws Albarghouthi University of Wisconsin - Madison, Josh Berdine Microsoft Research, Byron Cook Microsoft Research, Zachary Kincaid University of Toronto
14:00 - 16:00
Session 8ESOP at Skeel
Chair(s): Jan Vitek Northeastern University
14:00
30m
Talk
Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs
ESOP
Cristina David University of Oxford, Daniel Kroening University of Oxford, Matt Lewis University of Oxford
14:30
30m
Talk
Full reduction in the face of absurdity
ESOP
15:00
30m
Talk
CoLoSL: Concurrent Local Subjective Logic
ESOP
Azalea Raad Imperial College London, Jules Villard Imperial College London, Philippa Gardner Imperial College London
15:30
30m
Talk
A Separation Logic for Fictional Sequential Consistency
ESOP
Filip Sieczkowski Aarhus University, Kasper Svendsen Aarhus University, Lars Birkedal Aarhus University, Jean Pichon-Pharabod University of Cambridge
16:30 - 18:00
Session 9ESOP at Skeel
Chair(s): Jan Vitek Northeastern University
16:30
30m
Talk
Binding Structures as an Abstract Data Type
ESOP
Wilmer Ricciotti University of Toulouse
17:00
30m
Talk
Type-based Allocation Analysis for Co-Recursion in Lazy Functional Languages
ESOP
Pedro Vasconcelos LIACC, Universidade do Porto, Porto, Portugal, Steffen Jost LMU, Munich, Germany, Mario Florido FCUP, Universidade do Porto, Portugal, Kevin Hammond University of St Andrews, St Andrews, UK
17:30
30m
Talk
Type Targeted Testing
ESOP
Eric Seidel , Niki Vazou UC San Diego, Ranjit Jhala University of California, San Diego

Call for Papers

ESOP is devoted to fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. ESOP seeks contributions on all aspects of programming language research; theoretical and/or practical advances are welcome. ESOP also seeks to encourage repeatable research; papers describing reproduction studies and experimental methodologies will be considered. Authors concerned about the appropriaeness of a topic should consult with the program chair prior to submission.

Submissions

Papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer’s Lecture Notes in Computer Science series.

Papers must follow the formatting guidelines specified by Springer and be submitted electronically in PDF through the HotCRP author interface. ESOP has a page limit of 25 pages. Additional material intended for reviewers but not for publication in the final version may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. Submissions not adhering to the specified format and length may be rejected immediately.

https://esop15.hotcrp.com

Reviewing

The following is a short overview of how ESOP’15 papers will be reviewed. Before the rebuttal phase authors will receive at least three reviews consisting of an overall score (1: Strong reject, to 4: Strong accept), a reviewer expertise (1: No familiarity, to 4: Expert), and authors comments. When writing their rebuttals, authors are encouraged to focus on factual errors in the reviews and reviewer questions (if any). As a rule of thumb, papers without sufficient expertise (i.e. no reviewer with an expertise of 3 or 4) or all reject reviews (overall scores of 1 or 2) are likely to be rejected. Papers out of scope may be rejected without review. Each paper will be assigned a guardian during reviewing, the role of the guardian is to ensure that sufficient expertise is available to properly review the paper, to ensure quality of the reviews, and to write a summary which will be returned to the authors. The summary will contain the consensus opinion and recommendations following PC discussions. Authors may use the reviews in any which way they see fit.

ESOP does not require the submission of abstracts.

See the FAQ for more information about how to submit.

Accepted Papers

Title
A Core Calculus for XQuery 3.0: Combining Navigational and Pattern Matching Approaches
ESOP
A Semantics for Propositions as Sessions
ESOP
A Separation Logic for Fictional Sequential Consistency
ESOP
A Theory of Name Resolution
ESOP
A Verified Compiler for Probability Density Functions
ESOP
Analysis of Asynchronous Programs with Event-Based Synchronization
ESOP
Automatic Static Cost Analysis for Parallel Programs
ESOP
Binding Structures as an Abstract Data Type
ESOP
CoLoSL: Concurrent Local Subjective Logic
ESOP
Composite Replicated Data Types
ESOP
Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages
ESOP
Fine-grained Detection of Privilege Escalation Attacks on Browser Extensions
ESOP
Full reduction in the face of absurdity
ESOP
Inter-procedural Two-Variable Herbrand Equalities
ESOP
IsoLate: A Type System for Self-Recursion
ESOP
Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System
ESOP
Monotonic References for Efficient Gradual Typing
ESOP
Probabilistic Programs as Spreadsheet Queries
ESOP
Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs
ESOP
Refinement Types for Incremental Computational Complexity
ESOP
Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement
ESOP
Running Probabilistic Programs Backwards
ESOP
Segment Abstraction for Worst-Case Execution Time Analysis
ESOP
Sound, modular and compositional verification of the input/output behavior of programs
ESOP
Spatial Interpolants
ESOP
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
ESOP
Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection
ESOP
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO
ESOP
The Problem of Programming Language Concurrency Semantics
ESOP
Type Targeted Testing
ESOP
Type-based Allocation Analysis for Co-Recursion in Lazy Functional Languages
ESOP
Unrestricted Termination and Non-Termination Arguments for Bit-Vector Programs
ESOP
Witnessing (Co)datatypes
ESOP

ESOP 2015 strives for transparency, we will be posting as much as information about the conference as possible. This page focuses on the issues related to submissions.

  • Page limit: The 25 LNCS-format page limit is new this year. It includes all elements of your paper including references. Any material above and beyond the limit may be ignored.

  • Appendices: There are no limits on appendices. But reviewers don’t have to read them.

  • Can a paper be rejected if a reviewer has not read the appendix: Yes. In case the appendix contains a critical piece of information, and the reviewer chose not to read it, the paper may be rejected.

  • Must abstracts be registered ahead of time: No.

  • Blindness: Submission are “single-blind”, i.e. authors may use their own names to their heart’s content.

  • Rebuttals: Authors will be provided an opportunity to respond to questions from reviewers during a rebuttal phase. Rebuttals should answer all questions marked as “Questions for Authors” in the reviews. Rebuttals may respond to factual errors in reviews. Rebuttals should not introduce new information (such as results of experiments run after submission). Rebuttals are not mandatory – it is fine to not rebut.

  • When are authors notified: As soon as the PC meeting ends.

  • Are scores released: Yes. Authors will get both the overall score and the reviewer expertise.

  • What is the schedule for the PC: Monday Oct 20 — Assignments released; Monday Nov 10 — Guardians submit reviews of their papers; Monday Dec 1 — All reviews are due; Wednesday Dec 3 — Rebuttal starts; Friday Dec 5 — Rebuttal ends; Thursday Dec 11 — PC Meeting start; Friday Dec 12 — PC Meeting ends & notification.

  • What are the instructions given to the reviewers:

    • Out of scope papers will be pre-rejected.
    • No quotas: if a paper makes a contribution it should be accepted.
    • Write reviews as if the paper was accepted and your role was to help authors improve it. Avoid lists of defects, have lists of suggestions instead. Be constructive. The quality and tone of reviews is just as important as the outcome.
    • If clarifications are required, add a section “Questions for the Authors”.
    • All reviews are your own. Ask the GUARDIAN to add a sub-reviewer.
    • If a paper is outside your area of expertise: do your best.
    • A score of 1 means you’ll argue against a paper, a 4 you’ll speak in favor.
    • You’ll get between 10-12 papers, and you’ll be a GUARDIAN on 4 of them.
    • Enter your reviews AS SOON AS POSSIBLE to allow GUARDIANS to spot issues early.
    • PC Summaries and scores will be released to the authors.
    • Anything after page 25 of a paper is an appendix. Read what you feel like.
    • A paper may be rejected if crucial material is only in appendix.
  • What are the instruction for Guardians: Each paper has a guardian. As a GUARDIAN you should:

    • Review guarded papers first;
    • Check expertise of reviewers (if necessary ask them), if there’s a chance the paper may not have an expert, ask for a sub-reviewer;
    • Read the reviews before the rebuttal and make sure they are clear, encourage other reviewers to be constructive if necessary;
    • Read the rebuttals. Check with other reviewers about the points raised;
    • Write the PC SUMMARY. Sum up reasons for the decision and convey relevant PC discussions.
  • What are the instructions for the PC Meeting:

    • All papers will be discussed
    • GUARDIANs introduce their papers
    • Papers without at least one expert or with only scores of 1 & 2 are likely rejects
    • PC papers with one or more review with a score of 1 are likely rejects
    • PC summaries are written during the meeting, notifications will be on the same day
  • Conflicts of Interest:

    • We use the SIGPLAN policy: Conflicts typically exist between advisor and students, employer and employees (for up to 2 years), author and co-authors (for up to 2 years after publication), people in the same institution (for up to 2 years; branches of large companies or different location of research institutes are considered to be the same institution). If a reviewer feels unable to render an objective judgement for any reason, he or she should notify the PC chair.
    • COI PC members will not take part in the discussions of the paper in question.
    • The PC chair is aware all reviewers assignments, but will not see the reviews or be present for discussions of COI papers.
    • Peter Thiemann will act as stand in PC Chair.