This is the main track of POPL 2017, featuring research papers and invited talks. Please select a tab for more information.
News
The POPL 2017 program is available.
The full POPL 2017 proceedings are accessible.
Wed 18 JanDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
09:00 - 09:05 | OpeningPOPL at Auditorium Chair(s): Giuseppe Castagna Paris Diderot University & CNRS, Andrew D. Gordon Microsoft Research and University of Edinburgh | ||
09:00 5mDay opening | Opening POPL |
09:05 - 10:00 | Invited speakerPOPL at Auditorium Chair(s): Andrew D. Gordon Microsoft Research and University of Edinburgh | ||
09:05 55mTalk | The Influence of Dependent Types POPL Stephanie Weirich University of Pennsylvania |
10:30 - 12:10 | Abstract InterpretationPOPL at Amphitheater 44 Chair(s): Isabella Mastroeni University of Verona, Italy | ||
10:30 25mTalk | Ogre and Pythia, An invariance proof method for weak consistency models POPL | ||
10:55 25mTalk | A Posteriori Environment Analysis with Pushdown Delta CFA POPL Kimball Germane University of Utah, Matthew Might University of Utah; Harvard Medical School; The White House | ||
11:20 25mTalk | Semantic-Directed Clumping of Disjunctive Abstract States POPL Huisong Li INRIA/CNRS/ENS/PSL*, François Bérenger INRIA/CNRS/ENS/PSL*, Bor-Yuh Evan Chang University of Colorado Boulder, Xavier Rival INRIA/CNRS/ENS Paris | ||
11:45 25mTalk | Fast Polyhedra Abstract Domain POPL |
10:30 - 12:10 | |||
10:30 25mTalk | Polymorphism, subtyping and type inference in MLsub POPL | ||
10:55 25mTalk | Java generics are Turing complete POPL Radu Grigore University of Kent | ||
11:20 25mTalk | Hazelnut: A Bidirectionally Typed Structure Editor Calculus POPL Cyrus Omar Carnegie Mellon University, Ian Voysey Carnegie Mellon University, Michael Hilton Oregon State University, USA, Jonathan Aldrich Carnegie Mellon University, Matthew Hammer University of Colorado, Boulder | ||
11:45 25mTalk | Modules, Abstraction, and Parametric Polymorphism POPL Karl Crary Carnegie Mellon University |
14:20 - 16:00 | |||
14:20 25mTalk | Beginner's Luck: A Language for Property-Based Generators POPL Leonidas Lampropoulos University of Pennsylvania, Diane Gallois-Wong Inria Paris, ENS Paris, Cătălin Hriţcu Inria Paris, John Hughes Chalmers University of Technology, Benjamin C. Pierce University of Pennsylvania, Li-yao Xia ENS Paris Pre-print | ||
14:45 25mTalk | Exact Bayesian Inference by Symbolic Disintegration POPL Pre-print | ||
15:10 25mTalk | Stochastic Invariants for Probabilistic Termination POPL Krishnendu Chatterjee IST Austria, Petr Novotný IST Austria, Djordje Zikelic University of Cambridge | ||
15:35 25mTalk | Coupling proofs are probabilistic product programs POPL |
14:20 - 16:00 | |||
14:20 25mTalk | A Promising Semantics for Relaxed-Memory Concurrency POPL Jeehoon Kang Seoul National University, Chung-Kil Hur Seoul National University, Ori Lahav MPI-SWS, Viktor Vafeiadis MPI-SWS, Germany, Derek Dreyer MPI-SWS Link to publication Pre-print Media Attached | ||
14:45 25mTalk | Automatically Comparing Memory Consistency Models POPL John Wickerson Imperial College London, Mark Batty University of Kent, Tyler Sorensen Imperial College London, George A. Constantinides Imperial College London, UK Pre-print Media Attached File Attached | ||
15:10 25mTalk | Interactive Proofs in Higher-Order Concurrent Separation Logic POPL Robbert Krebbers Delft University of Technology, Netherlands, Amin Timany imec - Distrinet, KU Leuven, Lars Birkedal Aarhus University DOI Pre-print Media Attached | ||
15:35 25mTalk | A Relational Model of Types-and-Effects in Higher-Order Concurrent Separation Logic POPL Morten Krogh-Jespersen Aarhus University, Kasper Svendsen Aarhus University, Lars Birkedal Aarhus University |
16:30 - 17:45 | |||
16:30 25mTalk | Monadic second-order logic on finite sequences POPL | ||
16:55 25mTalk | On the Relationship Between Higher-Order Recursion Schemes and Higher-Order Fixpoint Logic POPL Naoki Kobayashi University of Tokyo, Japan, Etienne Lozes ENS Cachan, Florian Bruse University of Kassel | ||
17:20 25mTalk | Coming to Terms with Quantified Reasoning POPL Simon Robillard Chalmers University of Technology, Andrei Voronkov University of Manchester, Laura Kovacs Chalmers University of Technology |
16:30 - 17:45 | |||
16:30 25mTalk | A Program Optimization for Automatic Database Result Caching POPL | ||
16:55 25mTalk | Stream Fusion, to Completeness POPL Oleg Kiselyov , Aggelos Biboudis University of Athens, Nick Palladinos Nessos Information Technologies, SA, Yannis Smaragdakis University of Athens Pre-print Media Attached | ||
17:20 25mTalk | Rigorous Floating-point Mixed Precision Tuning POPL Wei-Fan Chiang School of Computing, University of Utah, Ganesh Gopalakrishnan University of Utah, Zvonimir Rakamaric University of Utah, Ian Briggs School of Computing, University of Utah, Marek S. Baranowski University of Utah, Alexey Solovyev School of Computing, University of Utah Pre-print |
Thu 19 JanDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
09:00 - 09:15 | |||
09:00 5mAwards | Turing Award Video POPL | ||
09:05 5mAwards | Most Influential Paper Award POPL | ||
09:10 5mAwards | Reynolds Doctoral Dissertation Award POPL |
09:15 - 10:00 | |||
09:15 45mTalk | 40 Years of Abstract Interpretation — An Interview with Patrick Cousot POPL |
10:30 - 12:10 | |||
10:30 25mTalk | Relational Cost Analysis POPL Ezgi Çiçek MPI-SWS, Germany, Gilles Barthe IMDEA, Marco Gaboardi SUNY Buffalo, USA, Deepak Garg MPI-SWS, Germany, Jan Hoffmann Carnegie Mellon University | ||
10:55 25mTalk | Contract-based Resource Verification for Higher-order Functions with Memoization POPL | ||
11:20 25mTalk | Context-sensitive data dependence analysis via Linear Conjunctive Language Reachability POPL | ||
11:45 25mTalk | Towards Automatic Resource Bound Analysis for OCaml POPL Jan Hoffmann Carnegie Mellon University, Ankush Das Carnegie Mellon University, Shu-chun Weng Yale University |
10:30 - 12:10 | Type Systems 2POPL at Auditorium Chair(s): Andrew D. Gordon Microsoft Research and University of Edinburgh | ||
10:30 25mTalk | Deciding equivalence with sums and the empty type POPL Gabriel Scherer Northeastern University | ||
10:55 25mTalk | The exp-log normal form of types: Decomposing extensional equality and representing terms compactly POPL Danko Ilik Trusted Labs | ||
11:20 25mTalk | Contextual isomorphisms POPL | ||
11:45 25mTalk | Typed Self-Evaluation via Intensional Type Functions POPL |
14:20 - 16:00 | |||
14:20 25mTalk | Mixed-size Concurrency: ARM, POWER, C/C++11, and SC POPL Shaked Flur University of Cambridge, Susmit Sarkar University of St. Andrews, UK, Christopher Pulte University of Cambridge, Kyndylan Nienhuis University of Cambridge, Luc Maranget INRIA Rocquencourt, Kathryn E. Gray University of Cambridge, Ali Sezgin University of Cambridge, Mark Batty University of Kent, Peter Sewell University of Cambridge | ||
14:45 25mTalk | Dynamic Race Detection For C++11 POPL | ||
15:10 25mTalk | Serializability for Eventual Consistency: Criterion, Analysis and Applications POPL Lucas Brutschy ETH Zurich, Dimitar Dimitrov ETH Zurich, Switzerland, Peter Müller ETH Zurich, Martin Vechev ETH Zurich Pre-print | ||
15:35 25mTalk | Thread Modularity at Many Levels: a Pearl in Compositional Verification POPL Jochen Hoenicke Universität Freiburg, Rupak Majumdar MPI-SWS, Andreas Podelski University of Freiburg, Germany |
14:20 - 16:00 | |||
14:20 25mTalk | Type Directed Compilation of Row-Typed Algebraic Effects POPL Daan Leijen Microsoft Research | ||
14:45 25mTalk | Do be do be do POPL | ||
15:10 25mTalk | Dijkstra Monads for Free POPL Danel Ahman University of Edinburgh, Cătălin Hriţcu Inria Paris, Kenji Maillard Inria Paris, ENS Paris, and Microsoft Research, Guido Martínez CIFASIS-CONICET, Argentina, Gordon Plotkin , Jonathan Protzenko Microsoft Research, Aseem Rastogi Microsoft Research India, Nikhil Swamy Microsoft Research Pre-print | ||
15:35 25mTalk | Stateful Manifest Contracts POPL |
16:30 - 17:20 | |||
16:30 25mTalk | A Semantic Account of Metric Preservation POPL Arthur Azevedo de Amorim University of Pennsylvania, USA, Ikram Cherigui ENS Paris, Marco Gaboardi SUNY Buffalo, USA, Justin Hsu , Shin-ya Katsumata Kyoto University | ||
16:55 25mTalk | Cantor Meets Scott: Semantic Foundations for Probabilistic Networks POPL Steffen Smolka Cornell University, Praveen Kumar Cornell University, Nate Foster Cornell University, Dexter Kozen Cornell University, Alexandra Silva University College London DOI File Attached |
16:30 - 17:20 | |||
16:30 25mTalk | Genesis: Synthesizing Forwarding Tables in Multi-tenant Networks POPL Kausik Subramanian University of Wisconsin-Madison, Loris D'Antoni University of Wisconsin–Madison, Aditya Akella University of Wisconsin-Madison | ||
16:55 25mTalk | LOIS: syntax and semantics POPL |
17:20 - 18:20 | Business meetingPOPL at Auditorium Chair(s): Andrew D. Gordon Microsoft Research and University of Edinburgh | ||
17:20 20mTalk | PC Chair report POPL Andrew D. Gordon Microsoft Research and University of Edinburgh | ||
17:40 10mTalk | POPL 2018 presentation POPL | ||
17:50 30mMeeting | SIGPLAN business meeting POPL |
Fri 20 JanDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
09:05 - 10:00 | |||
09:05 55mTalk | Rust: from POPL to practice POPL Aaron Turon MPI-SWS |
10:30 - 12:10 | |||
10:30 25mTalk | Component-Based Synthesis for Complex APIs POPL Yu Feng University of Texas at Austin, USA, Ruben Martins , Yuepeng Wang University of Texas at Austin, Işıl Dillig UT Austin, Thomas Reps University of Wisconsin - Madison and Grammatech Inc. | ||
10:55 25mTalk | Learning nominal automata POPL Joshua Moerman Radboud University, Matteo Sammartino University College London, Alexandra Silva University College London, Bartek Klin University of Warsaw, Michał Szynwelski University of Warsaw | ||
11:20 25mTalk | On Verifying Causal Consistency POPL Ahmed Bouajjani IRIF, Université Paris Diderot, Constantin Enea LIAFA, Université Paris Diderot, Rachid Guerraoui , Jad Hamza LIAFA, Université Paris Diderot | ||
11:45 25mTalk | Complexity Verification Using Guided Theorem Enumeration POPL Akhilesh Srikanth Georgia Institute of Technology, Burak Sahin Georgia Institute of Technology, William Harris |
10:30 - 12:10 | |||
10:30 25mTalk | Intersection Type Calculi of Bounded Dimension POPL | ||
10:55 25mTalk | Type Soundness Proofs with Definitional Interpreters POPL | ||
11:20 25mTalk | Computational Higher-Dimensional Type Theory POPL Carlo Angiuli Carnegie Mellon University, Robert Harper , Todd Wilson California State University Fresno | ||
11:45 25mTalk | Type Systems as Macros POPL Stephen Chang Northeastern University, Alex Knauth Northeastern University, Ben Greenman Northeastern University |
14:20 - 16:00 | |||
14:20 25mTalk | Parallel Functional Arrays POPL | ||
14:45 25mTalk | A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms POPL DOI Pre-print | ||
15:10 25mTalk | Analyzing divergence in bisimulation semantics POPL Xinxin Liu Institute of software, Chinese academy of sciences, Tingting Yu , Wenhui Zhang Institute of software, Chinese academy of sciences | ||
15:35 25mTalk | Fencing off Go: Liveness and Safety for Channel-Based Programming POPL Julien Lange Imperial College London, Nicholas Ng Imperial College London, Bernardo Toninho Imperial College London, Nobuko Yoshida Imperial College London, UK Pre-print |
14:20 - 16:00 | Gradual Typing and ContractsPOPL at Auditorium Chair(s): Ronald Garcia University of British Columbia | ||
14:20 25mTalk | Big Types in Little Runtime: Open World Soundness and Collaborative Blame for Gradual Type System POPL | ||
14:45 25mTalk | Gradual Refinement Types POPL Link to publication DOI Pre-print | ||
15:10 25mTalk | Automatically Generating the Dynamic Semantics of Gradually Typed Languages POPL | ||
15:35 25mTalk | Sums of Uncertainty: Refinements go gradual POPL |
16:30 - 17:45 | |||
16:30 25mTalk | Invariants of Quantum Programs: Characterisations and Generation POPL Mingsheng Ying University of Technology Sydney, Australia, Shenggang Ying University of Technology Sydney, Australia, Xiaodi Wu University of Oregon, USA | ||
16:55 25mTalk | The Geometry of Parallelism. Classical, Probabilistic, and Quantum Effects POPL Ugo Dal Lago University of Bologna, France, Claudia Faggian , Benoit Valiron LRI, CentraleSupelec, Univ. Paris Saclay, Akira Yoshimizu Univ.Tokyo | ||
17:20 25mTalk | QWIRE: A Core Language for Quantum Circuits POPL Jennifer Paykin , Robert Rand University of Pennsylvania, Steve Zdancewic University of Pennsylvania |
16:30 - 17:45 | |||
16:30 25mTalk | LMS-Verify: Abstraction Without Regret for Verified Systems Programming POPL | ||
16:55 25mTalk | Hypercollecting Semantics and its Application to Static Analysis of Information Flow POPL Mounir Assaf Stevens Institute of Technology, David Naumann Stevens Institute of Technology, Julien Signoles CEA LIST, Éric Totel CentraleSupélec, Frédéric Tronel CentraleSupélec | ||
17:20 25mTalk | LightDP: Towards Automating Differential Privacy Proofs POPL Danfeng Zhang Pennsylvania State University, Daniel Kifer Dept. of Computer Science and Engineering, Penn State University |
Accepted Papers
Call for Papers
Scope
The annual Symposium on Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and programming systems. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. Papers discussing new ideas and new areas are encouraged, as are papers (often called “pearls”) that elucidate existing concepts in ways that yield new insights. We are looking for any submission with the potential to make enduring contributions to the theory, design, implementation or application of programming languages.
The symposium is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG.
Evaluation
The Program Committee will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity.
Explaining a known idea in a new way may make as strong a contribution as inventing a new idea. Hence, we encourage the submission of pearls: elegant essays that explain an old idea, but do so in a new way that clarifies the idea and yields new insights. There is no formal separation of categories; pearls will be held to the same standards as any other paper.
Each paper should explain its contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Authors should strive to make their papers understandable to a broad audience. Advice on writing technical papers can be found on the SIGPLAN author information page.
A document that details principles underlying organizational and reviewing policies can be found here.
A document containing frequently asked questions about the reviewing and submission process, especially as it pertains to double-blind reviewing, can be found here.
The Program Committee, displayed to the right, meets face-to-face to make the final selection; the Program Committee is assisted by a larger External Review Committee, also displayed to the right. PC papers are reviewed and selected entirely by the ERC.
Submission guidelines
Prior to the registration deadline, the authors will register their paper by uploading information on the submission title, abstract (of at most 300 words), authors, topics, and conflicts to the conference web site. Papers that are not registered on time will be rejected.
Prior to the final paper submission deadline, the authors will upload their full paper in double blind format and formatted according to the ACM proceedings format. Each paper should have no more than 12 pages of text, excluding bibliography, in 9 pt format. Papers may be resubmitted multiple times up until the deadline. The last version submitted before the deadline will be the version that is reviewed. Papers that exceed the length requirement or deviate from the expected format or are submitted late will be rejected.
Deadlines expire at midnight anywhere on earth on the Important Dates displayed to the right.
Templates for ACM format are available for Microsoft Word and LaTeX at http://www.sigplan.org/Resources/Author (use the 9 pt preprint template). Submissions should be in PDF and printable on US Letter and A4 sized paper.
Submitted papers must adhere to the SIGPLAN Republication Policy and the ACM Policy on Plagiarism. Concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed.
POPL 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. A document answering frequently asked questions should address many common concerns.
The submission itself is the object of review and so it should strive to convince the reader of at least the plausibility of reported results. Still, we encourage authors to provide any supplementary material that is required to support the claims made in the paper, such as detailed proofs, proof scripts, or experimental data. These materials should be uploaded at submission time, as a single pdf or a tarball, not via a URL. Two forms of supplementary material may be submitted.
- Anonymous supplementary material is available to the reviewers before they submit their first-draft reviews.
- Non-anonymous supplementary material is available to the reviewers after they have submitted their first-draft reviews and learnt the identity of the authors.
Use the anonymous form if possible. Reviewers are under no obligation to look at the supplementary material but may refer to it if they have questions about the material in the body of the paper.
Artifact Evaluation
Authors of accepted papers will be invited to formally submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how the artifacts support the work described in the papers. 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
Final versions of accepted papers are allowed up to 12 pages excluding the bibliography. In addition, at most two additional pages may be purchased at $200 per page. This additional amount will be due at registration for the conference.
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 your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.)