POPL 2017
Sun 15 - Sat 21 January 2017

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.

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

Wed 18 Jan
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

09:00 - 09:05
OpeningPOPL at Auditorium
Chair(s): Giuseppe CastagnaParis Diderot University & CNRS, Andrew D. GordonMicrosoft Research and University of Edinburgh
09:00
5m
Day opening
Opening
POPL
09:05 - 10:00
Invited speakerPOPL at Auditorium
Chair(s): Andrew D. GordonMicrosoft Research and University of Edinburgh
09:05
55m
Talk
The Influence of Dependent Types
POPL
Stephanie WeirichUniversity of Pennsylvania
10:30 - 12:10
Abstract InterpretationPOPL at Amphitheater 44
Chair(s): Isabella MastroeniUniversity of Verona, Italy
10:30
25m
Talk
Ogre and Pythia, An invariance proof method for weak consistency models
POPL
Jade AlglaveUniversity College London, Patrick CousotNew York University
10:55
25m
Talk
A Posteriori Environment Analysis with Pushdown Delta CFA
POPL
Kimball GermaneUniversity of Utah, Matthew MightUniversity of Utah; Harvard Medical School; The White House
11:20
25m
Talk
Semantic-Directed Clumping of Disjunctive Abstract States
POPL
Huisong LiINRIA/CNRS/ENS/PSL*, François BérengerINRIA/CNRS/ENS/PSL*, Bor-Yuh Evan ChangUniversity of Colorado Boulder, Xavier RivalINRIA/CNRS/ENS Paris
11:45
25m
Talk
Fast Polyhedra Abstract Domain
POPL
Gagandeep SinghETH Zurich, Switzerland, Markus PüschelETH Zurich, Martin VechevETH Zurich
10:30 - 12:10
Type Systems 1POPL at Auditorium
Chair(s): Avik ChaudhuriFacebook
10:30
25m
Talk
Polymorphism, subtyping and type inference in MLsub
POPL
Stephen Dolan, Alan MycroftUniversity of Cambridge
10:55
25m
Talk
Java generics are Turing complete
POPL
Radu GrigoreUniversity of Kent
11:20
25m
Talk
Hazelnut: A Bidirectionally Typed Structure Editor Calculus
POPL
Cyrus OmarCarnegie Mellon University, Ian VoyseyCarnegie Mellon University, Michael HiltonOregon State University, USA, Jonathan AldrichCarnegie Mellon University, Matthew HammerUniversity of Colorado, Boulder
11:45
25m
Talk
Modules, Abstraction, and Parametric Polymorphism
POPL
Karl CraryCarnegie Mellon University
14:20 - 16:00
Probabilistic ProgrammingPOPL at Amphitheater 44
Chair(s): Marco GaboardiSUNY Buffalo, USA
14:20
25m
Talk
Beginner's Luck: A Language for Property-Based Generators
POPL
Leonidas LampropoulosUniversity of Pennsylvania, Diane Gallois-WongInria Paris, ENS Paris, Cătălin HriţcuInria Paris, John HughesChalmers University of Technology, Benjamin C. PierceUniversity of Pennsylvania, Li-yao XiaENS Paris
Pre-print
14:45
25m
Talk
Exact Bayesian Inference by Symbolic Disintegration
POPL
Chung-chieh ShanIndiana University, USA, Norman Ramsey
Pre-print
15:10
25m
Talk
Stochastic Invariants for Probabilistic Termination
POPL
Krishnendu ChatterjeeIST Austria, Petr NovotnýIST Austria, Djordje ZikelicUniversity of Cambridge
15:35
25m
Talk
Coupling proofs are probabilistic product programs
POPL
14:20 - 16:00
Concurrency 1POPL at Auditorium
Chair(s): Ilya SergeyUniversity College London
14:20
25m
Talk
A Promising Semantics for Relaxed-Memory Concurrency
POPL
Jeehoon KangSeoul National University, Chung-Kil HurSeoul National University, Ori LahavMPI-SWS, Viktor VafeiadisMPI-SWS, Germany, Derek DreyerMPI-SWS
Link to publication Pre-print Media Attached
14:45
25m
Talk
Automatically Comparing Memory Consistency Models
POPL
John WickersonImperial College London, Mark BattyUniversity of Kent, Tyler SorensenImperial College London, George A. ConstantinidesImperial College London, UK
Pre-print Media Attached File Attached
15:10
25m
Talk
Interactive Proofs in Higher-Order Concurrent Separation Logic
POPL
Robbert KrebbersDelft University of Technology, Netherlands, Amin Timanyimec - Distrinet, KU Leuven, Lars BirkedalAarhus University
DOI Pre-print Media Attached
15:35
25m
Talk
A Relational Model of Types-and-Effects in Higher-Order Concurrent Separation Logic
POPL
Morten Krogh-JespersenAarhus University, Kasper SvendsenAarhus University, Lars BirkedalAarhus University
16:30 - 17:45
LogicPOPL at Amphitheater 44
Chair(s): Alexandra SilvaUniversity College London
16:30
25m
Talk
Monadic second-order logic on finite sequences
POPL
Loris D'AntoniUniversity of Wisconsin–Madison, Margus VeanesMicrosoft Research
16:55
25m
Talk
On the Relationship Between Higher-Order Recursion Schemes and Higher-Order Fixpoint Logic
POPL
Naoki KobayashiUniversity of Tokyo, Japan, Etienne LozesENS Cachan, Florian BruseUniversity of Kassel
17:20
25m
Talk
Coming to Terms with Quantified Reasoning
POPL
Simon RobillardChalmers University of Technology, Andrei VoronkovUniversity of Manchester, Laura KovacsChalmers University of Technology
16:30 - 17:45
Compiler OptimisationPOPL at Auditorium
Chair(s): Andrew C. MyersCornell University
16:30
25m
Talk
A Program Optimization for Automatic Database Result Caching
POPL
Ziv ScullyCarnegie Mellon University, Adam ChlipalaMIT
16:55
25m
Talk
Stream Fusion, to Completeness
POPL
Oleg Kiselyov, Aggelos BiboudisUniversity of Athens, Nick PalladinosNessos Information Technologies, SA, Yannis SmaragdakisUniversity of Athens
Pre-print Media Attached
17:20
25m
Talk
Rigorous Floating-point Mixed Precision Tuning
POPL
Wei-Fan ChiangSchool of Computing, University of Utah, Ganesh GopalakrishnanUniversity of Utah, Zvonimir RakamaricUniversity of Utah, Ian BriggsSchool of Computing, University of Utah, Marek S. BaranowskiUniversity of Utah, Alexey SolovyevSchool of Computing, University of Utah
Pre-print

Thu 19 Jan
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

09:00 - 09:15
ACM and SIGPLAN AwardsPOPL at Auditorium
Chair(s): Satnam SinghFacebook
09:00
5m
Awards
Turing Award Video
POPL
09:05
5m
Awards
Most Influential Paper Award
POPL
09:10
5m
Awards
Reynolds Doctoral Dissertation Award
POPL
09:15 - 10:00
Invited speakerPOPL at Auditorium
Chair(s): Roberto GiacobazziUniversity of Verona, Italy
09:15
45m
Talk
40 Years of Abstract Interpretation — An Interview with Patrick Cousot
POPL
Patrick CousotNew York University, Roberto GiacobazziUniversity of Verona, Italy
10:30 - 12:10
Program AnalysisPOPL at Amphitheater 44
Chair(s): Francesco LogozzoFacebook
10:30
25m
Talk
Relational Cost Analysis
POPL
Ezgi ÇiçekMPI-SWS, Germany, Gilles BartheIMDEA, Marco GaboardiSUNY Buffalo, USA, Deepak GargMPI-SWS, Germany, Jan HoffmannCarnegie Mellon University
10:55
25m
Talk
Contract-based Resource Verification for Higher-order Functions with Memoization
POPL
Ravichandhran MadhavanEPFL, Sumith KulalIIT Bombay, Viktor KunčakEPFL, Switzerland
11:20
25m
Talk
Context-sensitive data dependence analysis via Linear Conjunctive Language Reachability
POPL
Qirun ZhangUniversity of California, Davis, Zhendong SuUniversity of California, Davis
11:45
25m
Talk
Towards Automatic Resource Bound Analysis for OCaml
POPL
Jan HoffmannCarnegie Mellon University, Ankush DasCarnegie Mellon University, Shu-chun WengYale University
10:30 - 12:10
Type Systems 2POPL at Auditorium
Chair(s): Andrew D. GordonMicrosoft Research and University of Edinburgh
10:30
25m
Talk
Deciding equivalence with sums and the empty type
POPL
Gabriel SchererNortheastern University
10:55
25m
Talk
The exp-log normal form of types: Decomposing extensional equality and representing terms compactly
POPL
Danko IlikTrusted Labs
11:20
25m
Talk
Contextual isomorphisms
POPL
11:45
25m
Talk
Typed Self-Evaluation via Intensional Type Functions
POPL
Matt BrownUCLA, Jens PalsbergUniversity of California, Los Angeles
14:20 - 16:00
Concurrency 2POPL at Amphitheater 44
Chair(s): Nobuko YoshidaImperial College London, UK
14:20
25m
Talk
Mixed-size Concurrency: ARM, POWER, C/C++11, and SC
POPL
Shaked FlurUniversity of Cambridge, Susmit SarkarUniversity of St. Andrews, UK, Christopher PulteUniversity of Cambridge, Kyndylan NienhuisUniversity of Cambridge, Luc MarangetINRIA Rocquencourt, Kathryn E. GrayUniversity of Cambridge, Ali SezginUniversity of Cambridge, Mark BattyUniversity of Kent, Peter SewellUniversity of Cambridge
14:45
25m
Talk
Dynamic Race Detection For C++11
POPL
Christopher LidburyImperial College London, Alastair F. DonaldsonImperial College London
15:10
25m
Talk
Serializability for Eventual Consistency: Criterion, Analysis and Applications
POPL
Lucas BrutschyETH Zurich, Dimitar DimitrovETH Zurich, Switzerland, Peter MüllerETH Zurich, Martin VechevETH Zurich
Pre-print
15:35
25m
Talk
Thread Modularity at Many Levels: a Pearl in Compositional Verification
POPL
Jochen HoenickeUniversität Freiburg, Rupak MajumdarMPI-SWS, Andreas PodelskiUniversity of Freiburg, Germany
14:20 - 16:00
Functional Programming with EffectsPOPL at Auditorium
Chair(s): Kathleen FisherTufts University
14:20
25m
Talk
Type Directed Compilation of Row-Typed Algebraic Effects
POPL
Daan LeijenMicrosoft Research
14:45
25m
Talk
Do be do be do
POPL
Sam LindleyUniversity of Edinburgh, Conor McBride, Craig McLaughlinThe University of Edinburgh
15:10
25m
Talk
Dijkstra Monads for Free
POPL
Danel AhmanUniversity of Edinburgh, Cătălin HriţcuInria Paris, Kenji MaillardInria Paris, ENS Paris, and Microsoft Research, Guido MartínezCIFASIS-CONICET, Argentina, Gordon Plotkin, Jonathan ProtzenkoMicrosoft Research, Aseem RastogiMicrosoft Research India, Nikhil SwamyMicrosoft Research
Pre-print
15:35
25m
Talk
Stateful Manifest Contracts
POPL
16:30 - 17:20
Semantic FoundationsPOPL at Amphitheater 44
Chair(s): Lars BirkedalAarhus University
16:30
25m
Talk
A Semantic Account of Metric Preservation
POPL
Arthur Azevedo de AmorimUniversity of Pennsylvania, USA, Ikram CheriguiENS Paris, Marco GaboardiSUNY Buffalo, USA, Justin Hsu, Shin-ya KatsumataKyoto University
16:55
25m
Talk
Cantor Meets Scott: Semantic Foundations for Probabilistic Networks
POPL
Steffen SmolkaCornell University, Praveen KumarCornell University, Nate FosterCornell University, Dexter KozenCornell University, Alexandra SilvaUniversity College London
DOI File Attached
16:30 - 17:20
Logic and ProgrammingPOPL at Auditorium
Chair(s): Nada AminEPFL
16:30
25m
Talk
Genesis: Synthesizing Forwarding Tables in Multi-tenant Networks
POPL
Kausik SubramanianUniversity of Wisconsin-Madison, Loris D'AntoniUniversity of Wisconsin–Madison, Aditya AkellaUniversity of Wisconsin-Madison
16:55
25m
Talk
LOIS: syntax and semantics
POPL
17:20 - 18:20
Business meetingPOPL at Auditorium
Chair(s): Andrew D. GordonMicrosoft Research and University of Edinburgh
17:20
20m
Talk
PC Chair report
POPL
Andrew D. GordonMicrosoft Research and University of Edinburgh
17:40
10m
Talk
POPL 2018 presentation
POPL
Andrew C. MyersCornell University, Ranjit JhalaUniversity of California, San Diego
17:50
30m
Meeting
SIGPLAN business meeting
POPL
C: Andrew D. GordonMicrosoft Research and University of Edinburgh

Fri 20 Jan
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

09:05 - 10:00
Invited speakerPOPL at Auditorium
Chair(s): Giuseppe CastagnaParis Diderot University & CNRS
09:05
55m
Talk
Rust: from POPL to practice
POPL
10:30 - 12:10
Verification and SynthesisPOPL at Amphitheater 44
Chair(s): Benjamin DelawarePurdue University
10:30
25m
Talk
Component-Based Synthesis for Complex APIs
POPL
Yu FengUniversity of Texas at Austin, USA, Ruben Martins, Yuepeng WangUniversity of Texas at Austin, Isil DilligUT Austin, Thomas RepsUniversity of Wisconsin - Madison and Grammatech Inc.
10:55
25m
Talk
Learning nominal automata
POPL
Joshua MoermanRadboud University, Matteo SammartinoUniversity College London, Alexandra SilvaUniversity College London, Bartek KlinUniversity of Warsaw, Michał SzynwelskiUniversity of Warsaw
11:20
25m
Talk
On Verifying Causal Consistency
POPL
Ahmed BouajjaniIRIF, Université Paris Diderot, Constantin EneaLIAFA, Université Paris Diderot, Rachid Guerraoui, Jad HamzaLIAFA, Université Paris Diderot
11:45
25m
Talk
Complexity Verification Using Guided Theorem Enumeration
POPL
Akhilesh SrikanthGeorgia Institute of Technology, Burak SahinGeorgia Institute of Technology, William Harris
10:30 - 12:10
Type Systems 3POPL at Auditorium
Chair(s): Derek DreyerMPI-SWS
10:30
25m
Talk
Intersection Type Calculi of Bounded Dimension
POPL
Andrej DudenhefnerTechnical University Dortmund, Jakob RehofTechnical University Dortmund
10:55
25m
Talk
Type Soundness Proofs with Definitional Interpreters
POPL
Nada AminEPFL, Tiark RompfPurdue University
11:20
25m
Talk
Computational Higher-Dimensional Type Theory
POPL
Carlo AngiuliCarnegie Mellon University, Robert Harper, Todd WilsonCalifornia State University Fresno
11:45
25m
Talk
Type Systems as Macros
POPL
Stephen ChangNortheastern University, Alex KnauthNortheastern University, Ben GreenmanNortheastern University
14:20 - 16:00
Concurrency 3POPL at Amphitheater 44
Chair(s): Adam ChlipalaMIT
14:20
25m
Talk
Parallel Functional Arrays
POPL
Ananya Kumar, Guy E. BlellochCarnegie Mellon University, Robert Harper
14:45
25m
Talk
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
POPL
Igor KonnovTU Wien, Marijana LazićTU Wien, Helmut VeithTU Wien, Josef WidderTU Wien
DOI Pre-print
15:10
25m
Talk
Analyzing divergence in bisimulation semantics
POPL
Xinxin LiuInstitute of software, Chinese academy of sciences, Tingting Yu, Wenhui ZhangInstitute of software, Chinese academy of sciences
15:35
25m
Talk
Fencing off Go: Liveness and Safety for Channel-Based Programming
POPL
Julien LangeImperial College London, Nicholas NgImperial College London, Bernardo ToninhoImperial College London, Nobuko YoshidaImperial College London, UK
Pre-print
14:20 - 16:00
Gradual Typing and ContractsPOPL at Auditorium
Chair(s): Ronald GarciaUniversity of British Columbia
14:20
25m
Talk
Big Types in Little Runtime: Open World Soundness and Collaborative Blame for Gradual Type System
POPL
Michael Vitousek, Cameron SwordsIndiana University, Jeremy G. SiekIndiana University Bloomington
14:45
25m
Talk
Gradual Refinement Types
POPL
Nicolás Lehmann, Éric TanterUniversity of Chile, Chile
Link to publication DOI Pre-print
15:10
25m
Talk
Automatically Generating the Dynamic Semantics of Gradually Typed Languages
POPL
Matteo CiminiIndiana University, USA, Jeremy G. SiekIndiana University Bloomington
15:35
25m
Talk
Sums of Uncertainty: Refinements go gradual
POPL
Khurram A. JaferyUniversity of British Columbia, Jana DunfieldUniversity of British Columbia
16:30 - 17:45
QuantumPOPL at Amphitheater 44
Chair(s): Michele PaganiIRIF, Université Paris Diderot
16:30
25m
Talk
Invariants of Quantum Programs: Characterisations and Generation
POPL
Mingsheng YingUniversity of Technology Sydney, Australia, Shenggang YingUniversity of Technology Sydney, Australia, Xiaodi WuUniversity of Oregon, USA
16:55
25m
Talk
The Geometry of Parallelism. Classical, Probabilistic, and Quantum Effects
POPL
Ugo Dal LagoUniversity of Bologna, France, Claudia Faggian, Benoit ValironLRI, CentraleSupelec, Univ. Paris Saclay, Akira YoshimizuUniv.Tokyo
17:20
25m
Talk
QWIRE: A Core Language for Quantum Circuits
POPL
Jennifer Paykin, Robert RandUniversity of Pennsylvania, Steve ZdancewicUniversity of Pennsylvania
16:30 - 17:45
Security and PrivacyPOPL at Auditorium
Chair(s): Cătălin HriţcuInria Paris
16:30
25m
Talk
LMS-Verify: Abstraction Without Regret for Verified Systems Programming
POPL
Nada AminEPFL, Tiark RompfPurdue University
16:55
25m
Talk
Hypercollecting Semantics and its Application to Static Analysis of Information Flow
POPL
Mounir AssafStevens Institute of Technology, David NaumannStevens Institute of Technology, Julien SignolesCEA LIST, Éric TotelCentraleSupélec, Frédéric TronelCentraleSupélec
17:20
25m
Talk
LightDP: Towards Automating Differential Privacy Proofs
POPL
Danfeng ZhangPennsylvania State University, Daniel KiferDept. of Computer Science and Engineering, Penn State University

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:

  1. author names and institutions must be omitted, and
  2. 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.

  1. Anonymous supplementary material is available to the reviewers before they submit their first-draft reviews.
  2. 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.)

Accepted Papers

Title
A Posteriori Environment Analysis with Pushdown Delta CFA
POPL
A Program Optimization for Automatic Database Result Caching
POPL
A Promising Semantics for Relaxed-Memory Concurrency
POPL
Link to publication Pre-print Media Attached
A Relational Model of Types-and-Effects in Higher-Order Concurrent Separation Logic
POPL
A Semantic Account of Metric Preservation
POPL
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
POPL
DOI Pre-print
Analyzing divergence in bisimulation semantics
POPL
Automatically Comparing Memory Consistency Models
POPL
Pre-print Media Attached File Attached
Automatically Generating the Dynamic Semantics of Gradually Typed Languages
POPL
Beginner's Luck: A Language for Property-Based Generators
POPL
Pre-print
Big Types in Little Runtime: Open World Soundness and Collaborative Blame for Gradual Type System
POPL
Cantor Meets Scott: Semantic Foundations for Probabilistic Networks
POPL
DOI File Attached
Coming to Terms with Quantified Reasoning
POPL
Complexity Verification Using Guided Theorem Enumeration
POPL
Component-Based Synthesis for Complex APIs
POPL
Computational Higher-Dimensional Type Theory
POPL
Context-sensitive data dependence analysis via Linear Conjunctive Language Reachability
POPL
Contextual isomorphisms
POPL
Contract-based Resource Verification for Higher-order Functions with Memoization
POPL
Coupling proofs are probabilistic product programs
POPL
Deciding equivalence with sums and the empty type
POPL
Dijkstra Monads for Free
POPL
Pre-print
Do be do be do
POPL
Dynamic Race Detection For C++11
POPL
Exact Bayesian Inference by Symbolic Disintegration
POPL
Pre-print
Fast Polyhedra Abstract Domain
POPL
Fencing off Go: Liveness and Safety for Channel-Based Programming
POPL
Pre-print
Genesis: Synthesizing Forwarding Tables in Multi-tenant Networks
POPL
Gradual Refinement Types
POPL
Link to publication DOI Pre-print
Hazelnut: A Bidirectionally Typed Structure Editor Calculus
POPL
Hypercollecting Semantics and its Application to Static Analysis of Information Flow
POPL
Interactive Proofs in Higher-Order Concurrent Separation Logic
POPL
DOI Pre-print Media Attached
Intersection Type Calculi of Bounded Dimension
POPL
Invariants of Quantum Programs: Characterisations and Generation
POPL
Java generics are Turing complete
POPL
LMS-Verify: Abstraction Without Regret for Verified Systems Programming
POPL
LOIS: syntax and semantics
POPL
Learning nominal automata
POPL
LightDP: Towards Automating Differential Privacy Proofs
POPL
Mixed-size Concurrency: ARM, POWER, C/C++11, and SC
POPL
Modules, Abstraction, and Parametric Polymorphism
POPL
Monadic second-order logic on finite sequences
POPL
Ogre and Pythia, An invariance proof method for weak consistency models
POPL
On Verifying Causal Consistency
POPL
On the Relationship Between Higher-Order Recursion Schemes and Higher-Order Fixpoint Logic
POPL
Opening
POPL
Parallel Functional Arrays
POPL
Polymorphism, subtyping and type inference in MLsub
POPL
QWIRE: A Core Language for Quantum Circuits
POPL
Relational Cost Analysis
POPL
Rigorous Floating-point Mixed Precision Tuning
POPL
Pre-print
Semantic-Directed Clumping of Disjunctive Abstract States
POPL
Serializability for Eventual Consistency: Criterion, Analysis and Applications
POPL
Pre-print
Stateful Manifest Contracts
POPL
Stochastic Invariants for Probabilistic Termination
POPL
Stream Fusion, to Completeness
POPL
Pre-print Media Attached
Sums of Uncertainty: Refinements go gradual
POPL
The Geometry of Parallelism. Classical, Probabilistic, and Quantum Effects
POPL
The exp-log normal form of types: Decomposing extensional equality and representing terms compactly
POPL
Thread Modularity at Many Levels: a Pearl in Compositional Verification
POPL
Towards Automatic Resource Bound Analysis for OCaml
POPL
Type Directed Compilation of Row-Typed Algebraic Effects
POPL
Type Soundness Proofs with Definitional Interpreters
POPL
Type Systems as Macros
POPL
Typed Self-Evaluation via Intensional Type Functions
POPL