Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/gasche/popl2018-papers

Link to preprints for POPL'18 and colocated events
https://github.com/gasche/popl2018-papers

Last synced: about 1 month ago
JSON representation

Link to preprints for POPL'18 and colocated events

Awesome Lists containing this project

README 

        
# popl2018-papers



Links to [accepted papers][popl2018-accepted] for the [45th ACM

SIGPLAN-SIGACT Symposium on Principles of Programming

Languages][popl2018-website] (POPL 2018).  **Pull requests welcome!**



[popl2018-website]: http://popl18.sigplan.org/home

[popl2018-accepted]: http://popl18.sigplan.org/track/POPL-2018-papers#event-overview



(Similar pages are available for [POPL 2017][popl2017], [2016][popl2016], [2015][popl2015], [2014][popl2014], and [2013][popl2013],

ICFP ([2016][icfp16], [2015][icfp15], [2014][icfp14], [2013][icfp13], [2012][icfp12]) and [PLDI 2014][pldi2014-accepted].)



[popl2013]: https://github.com/23Skidoo/popl13-papers-links

[popl2014]: https://github.com/gasche/popl2014-papers

[popl2015]: https://github.com/yallop/popl2015-papers

[popl2016]: https://github.com/gasche/popl2016-papers

[popl2017]: https://github.com/gasche/popl2017-papers

[icfp12]: https://github.com/technogeeky/icfp12-paper-links

[icfp13]: https://github.com/gasche/icfp2013-papers

[icfp14]: https://github.com/yallop/icfp2014-papers

[icfp15]: https://github.com/mpickering/icfp2015-papers

[icfp16]: https://github.com/gasche/icfp2016-papers

[haskell2014-accepted]: https://github.com/yallop/haskell2014-papers

[pldi2014-accepted]: https://github.com/yallop/pldi2014-papers



Note: if you are editing this repository, please remember to use the

Markdown syntax for hard line breaks, namely two spaces at the end of

the line.



## POPL 2018



A Logical Relation for Monadic Encapsulation of State: Proving contextual equivalences in the presence of runST  

Amin Timany, Leo Stefanesco, Morten Krogh-Jespersen, Lars Birkedal  

([print](http://iris-project.org/pdfs/2018-popl-runST-final.pdf))



A Practical Construction for Decomposing Numerical Abstract Domains  

Gagandeep Singh, Markus Püschel, Martin Vechev  

([preprint](http://www.srl.inf.ethz.ch/papers/popl2018.pdf))



A Principled approach to Ornamentation in ML  

Thomas Williams, Didier Rémy  

([preprint](https://hal.inria.fr/hal-01666104/document) from [HAL](https://hal.inria.fr/hal-01666104/), [extended preprint](https://hal.inria.fr/hal-01628060/document) from [HAL](https://hal.inria.fr/hal-01628060), [website](http://pauillac.inria.fr/~remy/ornaments/))



A new proof rule for almost-sure termination  

Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen  

([preprint](https://arxiv.org/pdf/1711.03588) from [arXiv](https://arxiv.org/abs/1711.03588))



Algorithmic Analysis of Termination Problems for Quantum Programs  

Yangjia Li, Mingsheng Ying  



Alone Together: Compositional Reasoning and Inference for Weak Isolation  

Gowtham Kaki, Mahsa Najafzadeh, Kartik Nagar, Suresh Jagannathan  

([preprint](https://arxiv.org/pdf/1710.09844) from [arXiv](https://arxiv.org/abs/1710.09844))



An Axiomatic Basis for Bidirectional Programming  

Hsiang-Shang ‘Josh’ Ko, Zhenjiang Hu  

([preprint](https://bitbucket.org/prl_tokyo/bigul/raw/logic/POPL18/logic.pdf),

 [agda code](https://josh-hs-ko.github.io/Agda/POPL18/Everything.html),

 [website](https://josh-hs-ko.github.io/#publication-e124d6a0))



Analytical Modeling of Cache Behavior and Vulnerability Optimization for Affine Programs  

Wenlei Bao, Sriram Krishnamoorthy, Louis-Noel Pouchet, P. (Saday) Sadayappan  



Automated Lemma Synthesis in Symbolic-Heap Separation Logic  

Quang-Trung Ta, Ton Chanh Le, Siau-Cheng Khoo, Wei Ngan Chin  

([preprint](https://arxiv.org/pdf/1710.09635) from [arXiv](https://arxiv.org/abs/1710.09635))



Bonsai: Synthesis-Based Reasoning for Type Systems  

Kartik Chandra, Rastislav Bodik  

([preprint](https://arxiv.org/pdf/1708.00551) from [arXiv](https://arxiv.org/abs/1708.00551))



Collapsing Towers of Interpreters  

Nada Amin, Tiark Rompf  

([print](http://lampwww.epfl.ch/~amin/pub/collapsing-towers.pdf), [code](https://github.com/TiarkRompf/collapsing-towers/tree/master/popl18))



Correctness of Speculative Optimizations with Dynamic Deoptimization  

Olivier Fluckiger, Gabriel Scherer, Ming-Ho Yee, Aviral Goel, Amal Ahmed, Jan Vitek  

([preprint](https://arxiv.org/pdf/1711.03050) from [arXiv](https://arxiv.org/abs/1711.03050))



Data-centric Dynamic Partial Order Reduction  

Krishnendu Chatterjee, Marek Chalupa, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya  

([preprint](https://arxiv.org/pdf/1610.01188) from [arXiv](https://arxiv.org/abs/1610.01188))



Decidability of Conversion for Type Theory in Type Theory  

Andreas Abel, Andrea Vezzosi, Joakim Öhman  

([print](http://www.cse.chalmers.se/~abela/popl18.pdf), [agda code](https://github.com/mr-ohman/logrel-mltt))



Denotational validation of higher-order Bayesian inference  

Adam Ścibior, Ohad Kammar, Matthijs Vákár, Sam Staton, Hongseok Yang, Yufei Cai, Klaus Ostermann, Sean Moss, Chris Heunen, Zoubin Ghahramani  

([preprint](https://arxiv.org/pdf/1711.03219) from [arXiv](https://arxiv.org/abs/1711.03219))



Effective Stateless Model Checking for C/C++ Concurrency  

Michalis Kokologiannakis, Ori Lahav, Konstantinos Sagonas, Viktor Vafeiadis  

([preprint](http://plv.mpi-sws.org/rcmc/paper.pdf), [website](http://plv.mpi-sws.org/rcmc/))



Foundations for Natural Proofs and Quantifier Instantiation  

Christof Löding, P. Madhusudan, Lucas Peña  

([preprint](http://madhu.cs.illinois.edu/FoundationsForNaturalProofs.pdf))



Generating Good Generators for Inductive Relations  

Leonidas Lampropoulos, Zoe Paraskevopoulou, Benjamin C. Pierce  

([preprint](https://www.cis.upenn.edu/~llamp/pdf/GeneratingGoodGenerators.pdf))



Go with the Flow: Compositional Abstractions for Concurrent Data Structures  

Siddharth Krishna, Dennis Shasha, Thomas Wies  

([preprint](https://arxiv.org/pdf/1711.03272) from [arXiv](https://arxiv.org/abs/1711.03272))



Handle with Care: Relational Interpretation of Algebraic Effects and Handlers  

Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski  

([preprint](http://www.ii.uni.wroc.pl/~dabi/publications/POPL18/biernacki-al-popl18.pdf),

 [coq development](https://bitbucket.org/pl-uwr/aleff-logrel))



Handling fibred algebraic effects  

Danel Ahman  

([preprint](https://danelahman.github.io/papers/popl18.pdf),

 [agda code](https://github.com/danelahman/POPL18))



Higher-Order Constrained Horn Clauses for Verification  

Toby Cathcart Burn, C.-H. Luke Ong, Steven Ramsay  

([preprint](https://arxiv.org/pdf/1705.06216) from [arXiv](https://arxiv.org/abs/1705.06216))



Inference of Static Semantics for Incomplete C Programs  

Leandro T. C. Melo, Rodrigo Geraldo Ribeiro, Marcus Rodrigues de Araújo, Fernando Magno Quintão Pereira  

([preprint](http://homepages.dcc.ufmg.br/~fernando/publications/papers/Leandro_POPL18.pdf))



Intrinsically-Typed Definitional Interpreters for Imperative Languages  

Casper Bach Poulsen, Arjen Rouvoet, Andrew Tolmach, Robbert Krebbers, Eelco Visser  

([preprint](http://casperbp.net/store/intrinsicallytyped.pdf),

 [agda code](https://metaborg.github.io/mj.agda/)

)



JaVerT: JavaScript Verification Toolchain  

José Fragoso Santos, Philippa Gardner, Petar Maksimović, Daiva Naudziuniene, Thomas Wood  

([preprint](http://www.doc.ic.ac.uk/~jfaustin/javert.pdf))



Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs  

Sheshansh Agrawal, Krishnendu Chatterjee, Petr Novotny  

([preprint](https://arxiv.org/pdf/1709.04037) from [arXiv](https://arxiv.org/abs/1709.04037))



Linear Haskell: practical linearity in a higher-order polymorphic language  

Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack  

([preprint](https://arxiv.org/pdf/1710.09756) from [arXiv](https://arxiv.org/abs/1710.09756))



Linearity in Higher-Order Recursion Schemes  

Pierre Clairambault, Charles Grellois, Andrzej Murawski  

([preprint](http://perso.ens-lyon.fr/pierre.clairambault/lhors.pdf))



Measurable cones and stable, measurable functions  

Thomas Ehrhard, Michele Pagani, Christine Tasson  

([preprint](https://arxiv.org/pdf/1711.09640) from [arXiv](https://arxiv.org/abs/1711.09640))



Migrating Gradual Types  

John Peter Campora III, Sheng Chen, Martin Erwig, Eric Walkingshaw  

([preprint](http://web.engr.oregonstate.edu/~walkiner/papers/popl18-migrating-gradual-types.pdf))



Monadic refinements for relational cost analysis  

Ivan Radicek, Gilles Barthe, Marco Gaboardi, Deepak Garg, Florian Zuleger  

([preprint](https://people.mpi-sws.org/~dg/papers/popl18.pdf))



Non-Linear Reasoning For Invariant Synthesis  

Jason Breck, John Cyphert, Zachary Kincaid, Thomas Reps  

([preprint](http://research.cs.wisc.edu/wpis/papers/popl18.pdf))



On Automatically Proving the Correctness of math.h Implementations  

Wonyeol Lee, Rahul Sharma, Alex Aiken  

([preprint](http://theory.stanford.edu/~aiken/publications/papers/popl18.pdf))



Online Detection of Effectively Callback Free Objects with Applications to Smart Contracts  

Shelly Grossman, Ittai Abraham, Guy Golan-Gueta, Yan Michalevsky, Noam Rinetzky, Mooly Sagiv, Yoni Zohar  

([preprint](http://www.cs.tau.ac.il/~shellygr/pubs/2018-popl-1.pdf))



Optimal Dyck Reachability for Data-dependence and Alias Analysis  

Krishnendu Chatterjee, Andreas Pavlogiannis, Bhavya Choudhary  

([preprint](https://repository.ist.ac.at/870/1/main.pdf))



Parametricity versus the Universal Type  

Dominique Devriese, Marco Patrignani, Frank Piessens  

([preprint](https://people.mpi-sws.org/~marcopat/marcopat/Publications_files/poly-seal-no.pdf))



Polyadic Approximations, Fibrations and Intersection Types  

Damiano Mazza, Luc Pellissier, Pierre Vial  

([preprint](http://www-lipn.univ-paris13.fr/~mazza/papers/IntersectionTypes.pdf))



Program Synthesis using Abstraction Refinement  

Xinyu Wang, Isil Dillig, Rishabh Singh  

([preprint](https://arxiv.org/pdf/1710.07740) from [arXiv](https://arxiv.org/abs/1710.07740))



Programming and Proving with Distributed Protocols  

Ilya Sergey, James R. Wilcox, Zachary Tatlock  

([preprint](https://homes.cs.washington.edu/~jrw12/disel.pdf))



Progress of Concurrent Objects with Partial Methods  

Hongjin Liang, Xinyu Feng  



Proving expected sensitivity of probabilistic programs  

Gilles Barthe, Thomas Espitau, Benjamin Gregoire, Justin Hsu, Pierre-Yves Strub  

([preprint](https://arxiv.org/pdf/1708.02537.pdf) from [arXiv](https://arxiv.org/abs/1708.02537))



Recalling a Witness: Foundations and Applications of Monotonic State  

Danel Ahman, Cédric Fournet, Cătălin Hriţcu, Kenji Maillard, Aseem Rastogi, Nikhil Swamy  

([preprint](https://arxiv.org/pdf/1707.02466) from [arXiv](https://arxiv.org/abs/1707.02466))



Reducing Liveness to Safety in First-Order Logic  

Oded Padon, Jochen Hoenicke, Giuliano Losa, Andreas Podelski, Mooly Sagiv, Sharon Shoham  

([preprint](http://www.cs.tau.ac.il/~odedp/reducing-liveness-to-safety-in-first-order-logic/popl18-reducing-liveness-to-safety-in-first-order-logic.pdf), [website](http://www.cs.tau.ac.il/~odedp/reducing-liveness-to-safety-in-first-order-logic/))



Refinement Reflection: Complete Verification with SMT  

Niki Vazou, Anish Tondwalkar, Vikraman Choudhury, Ryan Scott, Ryan R. Newton, Philip Wadler, Ranjit Jhala  

([preprint](https://arxiv.org/pdf/1711.03842) from [arXiv](https://arxiv.org/abs/1711.03842))



Relatively Complete Refinement Type System for Verification of Higher-Order Non-Deterministic Programs  

Hiroshi Unno, Yuki Satake, Tachio Terauchi  



RustBelt: Securing the Foundations of the Rust Programming Language  

Ralf Jung, Jacques-Henri Jourdan, Robbert Krebbers, Derek Dreyer  

([preprint](http://www.mpi-sws.org/%7Edreyer/papers/rustbelt/paper.pdf))



Safety and Conservativity of Definitions in HOL and Isabelle/HOL  

Ondřej Kunčar, Andrei Popescu  

([preprint](http://andreipopescu.uk/pdf/conserv_HOL_IsabelleHOL.pdf))



Simplicitly: Foundations and Applications of Implicit Function Types  

Martin Odersky, Olivier Blanvillain, Fengyun Liu, Aggelos Biboudis, Heather Miller, Sandro Stucki  

([preprint](https://infoscience.epfl.ch/record/229878/files/simplicitly_1.pdf))



Simplifying ARM Concurrency: Multicopy-atomic Axiomatic and Operational Models for ARMv8  

Christopher Pulte, Shaked Flur, Will Deacon, Jon French, Susmit Sarkar, Peter Sewell  

([draft](http://www.cl.cam.ac.uk/~pes20/armv8-mca/armv8-mca-draft.pdf), [website](http://www.cl.cam.ac.uk/~pes20/armv8-mca/))



Soft Contract Verification for Higher-order Stateful Programs  

Phúc C. Nguyễn, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn  

([preprint](https://arxiv.org/pdf/1711.03620) from [arXiv](https://arxiv.org/abs/1711.03620))



Sound, Complete, and Tractable Linearizability Monitoring for Concurrent Collections  

Michael Emmi, Constantin Enea  

([preprint](https://www.irif.fr/~cenea/papers/popl2018.pdf))



Strategy Synthesis for Linear Arithmetic Games  

Azadeh Farzan, Zachary Kincaid  

([preprint](https://www.cs.princeton.edu/~zkincaid/pub/popl18b.pdf))



String Constraints with Concatenation and Transducers Solved Efficiently  

Lukas Holik, Anthony Widjaja Lin, Petr Janku, Philipp Ruemmer, Tomas Vojnar  

([technical report](https://raw.githubusercontent.com/uuverifiers/sloth/master/papers/popl18-efficient.pdf))



Symbolic Types for Lenient Symbolic Execution  

Stephen Chang, Alex Knauth, Emina Torlak  

([draft](http://www.ccs.neu.edu/home/stchang/pubs/ckt-popl2018.pdf), [website](http://www.ccs.neu.edu/home/stchang/popl2018/index.html))



Synthesizing Bijective Lenses  

Anders Miltner, Kathleen Fisher, Benjamin C. Pierce, David Walker, Steve Zdancewic  

([preprint](https://arxiv.org/pdf/1710.03248) from [arXiv](https://arxiv.org/abs/1710.03248))



Synthesizing Coupling Proofs of Differential Privacy  

Aws Albarghouthi, Justin Hsu  

([preprint](https://arxiv.org/pdf/1709.05361) from [arXiv](https://arxiv.org/abs/1709.05361))



Transactions in Relaxed Memory Architectures  

Brijesh Dongol, Radha Jagadeesan, James Riely  

([preprint](http://bura.brunel.ac.uk/bitstream/2438/15405/1/Fulltext.pdf))



Type-Preserving CPS Translation of Σ and Π Types is Not Not Possible  

William J. Bowman, Youyou Cong, Nick Rioux, Amal Ahmed  

([draft](https://williamjbowman.com/resources/cps-sigma.pdf), [website](https://williamjbowman.com/papers/#cps-sigma))



Typed and Jones Optimal Self-Applicable Partial Evaluation  

Matt Brown, Jens Palsberg  



Unifying Analytic and Statically-Typed Quasiquotes  

Lionel Parreaux, Antoine Voizard, Amir Shaikhha, Christoph E. Koch  

([preprint](https://infoscience.epfl.ch/record/232427/files/[v.2.10]%20qq_unif_popl18.pdf))



Univalent Higher Categories via Complete Semi-Segal Types  

Paolo Capriotti, Nicolai Kraus  

([preprint](https://arxiv.org/pdf/1707.03693) from [arXiv](https://arxiv.org/abs/1707.03693))



Up-to Techniques Using Sized Types  

Nils Anders Danielsson  

([draft](http://www.cse.chalmers.se/~nad/publications/danielsson-up-to-using-sized-types.pdf))



Verifying Equivalence of Database-Driven Applications  

Yuepeng Wang, Isil Dillig, Shuvendu K. Lahiri, William Cook  

([preprint](https://arxiv.org/pdf/1710.07660) from [arXiv](https://arxiv.org/abs/1710.07660))



WebRelate: Integrating Web Data with Spreadsheets using Examples  

Jeevana Priya Inala, Rishabh Singh  

([preprint](https://arxiv.org/pdf/1711.05787) from [arXiv](https://arxiv.org/abs/1711.05787))



What's Decidable About String Constraints with ReplaceAll Function?  

Taolue Chen, Yan Chen, Matthew Hague, Anthony Widjaja Lin, Zhilin Wu  

([preprint](https://arxiv.org/pdf/1711.03363) from [arXiv](https://arxiv.org/abs/1711.03363))



Why is Random Testing Effective for Partition Tolerance Bugs?  

Rupak Majumdar, Filip Niksic  

([preprint](https://people.mpi-sws.org/~fniksic/popl2018/paper.pdf))