POPL 2015 Artifact Evaluation

Welcome to the POPL 2015 Artifact Evaluation Process.

Learn More

The Artifact Evaluation Process is complete. Thanks to all authors and reviewers for making it a success. The report from the AEC Chairs is now available online.


Paper decision notification:
September 30, 2014
Artifacts due:
October 6, 2014
Decisions announced:
October 26, 2014
POPL camera-ready deadline:
October 28, 2014

For Authors

We have written guidelines for artifacts. Because we want to encourage as many of you as possible to submit, these are only guidelines, not hard rules. Of course, if the material you want us to evaluate is fairly standard, following these suggestions will greatly simplify our lives. After all, remember: You want us to be able to evaluate your artifact, don't you?

Committee Members


Accepted Artifacts

The following 27 papers had artifacts that "meet the expectations set by the paper":

  • From Communicating Machines to Graphical Choreographies
    [Download Artifact]
    Julien Lange, Emilio Tuosto, and Nobuko Yoshida
  • Ur/Web: A Simple Model for Programming the Web
    [Download Artifact]
    Adam Chlipala
  • From Network Interface to Multithreaded Web Applications: A Case Study in Modular Program Verification
    [Download Artifact]
    Adam Chlipala
  • Succinct Representation of Concurrent Trace Sets
    [Download Artifact]
    Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, and Thorsten Tarrach
  • Sound Modular Verification of C Code Executing in an Unverified Context
    [Download Artifact]
    Pieter Agten, Bart Jacobs, and Frank Piessens
  • Common compiler optimisations are invalid in the C11 memory model and what we can do about it
    [Download Artifact]
    Viktor Vafeiadis, Thibaut Balabonski, Soham Chakraborty, Robin Morisset, and Francesco Zappa Nardelli
  • Manifest Contracts for Datatypes
    [Download Artifact]
    Taro Sekiyama, Yuki Nishida, and Atsushi Igarashi
  • Formal verification of a C static analyzer
    [Download Artifact]
    Jacques-Henri Jourdan, Vincent Laporte, Sandrine Blazy, Xavier Leroy, and David Pichardie
  • Quantitative Interprocedural Analysis
    [Download Artifact]
    Krishnendu Chatterjee, Andreas Pavlogiannis, and Yaron Velner
  • A Scalable, Correct Time-Stamped Stack
    [Download Artifact]
    Mike Dodds, Andreas Haas, and Christoph M. Kirsch
  • Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant
    [Download Artifact]
    Benjamin Delaware, Clément Pit--Claudel, Jason Gross, and Adam Chlipala
  • Safe and Efficient Gradual Typing for TypeScript
    [Download Artifact]
    Aseem Rastogi, Nikhil Swamy, Cédric Fournet, Gavin Bierman, and Panagiotis Vekris
  • A Calculus for Relaxed Memory
    [Download Artifact]
    Karl Crary and Michael Sullivan
  • Deep Specifications and Certified Abstraction Layers
    Ronghui Gu, Jeremie Koenig, Tahina Ramananandro, Zhong Shao, Newman Wu, Shu-chun Weng, Haozhong Zhang, and Yu Guo
  • DReX: A Declarative Language for Efficiently Computable Regular String Transformations
    [Download Artifact]
    Rajeev Alur, Loris D'Antoni, and Mukund Raghothaman
  • Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
    [Download Artifact]
    Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, Aaron Roth, and Pierre-Yves Strub
  • Predicting Program Properties from "Big Code"
    [Download Artifact]
    Veselin Raychev, Martin Vechev, and Andreas Krause
  • Compositional CompCert
    [Download Artifact]
    Gordon Stewart, Lennart Beringer, Santiago Cuellar, and Andrew W. Appel
  • A Coalgebraic Decision Procedure for NetKAT
    [Download Artifact]
    Nate Foster, Dexter Kozen, Matthew Milano, Alexandra Silva, and Laure Thompson
  • K-Java: A Complete Semantics of Java
    [Download Artifact]
    Denis Bogdanas and Grigore Rosu
  • Programming up to Congruence
    [Download Artifact]
    Vilhelm Sjoberg and Stephanie Weirich
  • Polymorphic Functions with Set-Theoretic Types. Part 2: Local Type Inference and Type Reconstruction
    [Download Artifact]
    Giuseppe Castagna, Kim Nguyen, Zhiwu Xu, and Pietro Abate
  • Integrating Linear and Dependent Types
    [Download Artifact]
    Neel Krishnaswami, Pierre Pradic, and Nick Benton
  • Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
    [Download Artifact]
    Damien Pous
  • Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning
    [Download Artifact]
    Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, and Derek Dreyer
  • Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
    [Download Artifact]
    Hao Tang, Xiaoyin Wang, Lingming Zhang, Bing Xie, Lu Zhang, and Hong Mei
  • Self-Representation in Girard's System U
    [Download Artifact]
    Matt Brown and Jens Palsberg