POPL is the symposium on Principles of Programming Languages. The 2014 edition will take place in San Diego, from January 22 to January 24.

The list of accepted papers was published there. The present page tries to gather preprint links and complementary information; please do not hesitate to submit issues or pull requests. Patch authors: please pay attention to the two non-erasable whitespaces required to add a line break after each link.

(See here for a similar page for ICFP'13)

POPL

• Sound Compilation of Reals. 
  (arxiv),
  E. Darulova, V. Kuncak

• Minimization of Symbolic Automata. 
  (technical report) (webpage),
  L. D'Antoni, M. Veanes

• Profiling For Laziness. 
  (no preprint found),
  S. Chang, M. Felleisen

• Sound Input Filter Generation for Integer Overflow Errors. 
  (technical report) (website),
  F. Long, S. Sidiroglou-Douskos, D. Kim, M. Rinard

• Abstract Acceleration of General Linear Loops. 
  (no preprint found),
  B. Jeannet, P. Schrammel, S. Sankaranarayanan

• Proofs that count. 
  (no preprint found),
  A. Farzan, Z. Kincaid, A. Podelski

• Parametric Completeness for Separation Theories. 
  (preprint) (slides),
  J. Brotherston, J. Villard

• FISSILE Type Analysis: Modular Checking of Almost Everywhere Invariants. 
  D. Coughlin, B. Chang

• Tabular: A Schema-Driven Probabilistic Programming Language. 
  A. Gordon, T. Graepel, N. Rolland, C. Russo, J. Borgström, J. Guiver

• Effect-Delimited Monad. 
  S. Katsumata

• Bias-Variance Tradeoffs in Program Analysis. 
  A. Aiken, A. Nori, R. Sharma

• Verifying Eventual Consistency of Optimistic Replication Systems. 
  A. Bouajjani, C. Enea, J. Hamza

• A Verified Information-Flow Architecture. 
  A. de Amorim, N. Collins, A. DeHon, D. Demange, C. Hritcu, D. Pichardie, B. Pierce, R. Pollack, A. Tolmach

• A non-standard standardization theorem. 
  B. Accattoli, E. Bonelli, D. Kesner, C. Lombardi

• On Coinductive Equivalences for Higher-Order Probabilistic Functional Programs. 
  M. Alberti, U. Dal Lago, D. Sangiorgi

• Optimal Dynamic Partial Order Reduction. 
  P. Abdulla, S. Aronis, B. Jonsson, K. Sagonas

• Proof search for propositional abstract separation logics via labelled sequents. 
  Z. Hou, R. Clouston, R. Gore, A. Tiu

• Game semantics for Interface Middleweight Java. 
  A. Murawski, N. Tzevelekos

• A Sound and Complete Abstraction for Reasoning About Parallel Prefix Sums. 
  N. Chong, A. Donaldson, J. Ketema

• Abstract Effects and Proof-Relevant Logical Relations. 
  N. Benton, M. Hofmann, V. Nigam

• Closed type families with overlapping equations. 
  R. Eisenberg, D. Vytiniotis, S. Peyton Jones, S. Weirich

• Combining Proofs and Programs in a Dependently Typed Language. 
  C. Casinghino, V. Sjoeberg, S. Weirich

• Consistency Analysis of Decision-Making Programs. 
  S. Chaudhuri, A. Farzan, Z. Kincaid

• Toward General Diagnosis of Static Errors. 
  D. Zhang, A. Myers

• Probabilistic Relational Verification for Cryptographic Implementations. 
  G. Barthe, C. Fournet, B. Grégoire, P. Strub, N. Swamy, S. Zanella-Béguelin

• A Proof System for Separation Logic with Magic Wand. 
  W. Lee, S. Park

• An Abstraction Refinement Approach to Higher-Order Model Checking. 
  S. Ramsay, R. Neatherway, L. Ong

• Gradual Typing Embedded Securely in JavaScript. 
  K. Bhargavan, G. Bierman, J. Chen, C. Fournet, A. Rastogi, P. Strub, N. Swamy

• Fair Reactive Programming. 
  (preprint),
  A. Cave, F. Ferreira, P. Panangaden, B. Pientka

• Freeze After Handling: Quasi-Deterministic Parallel Programming with LVars. 
  (preprint) (github),
  L. Kuper, A. Turon, N. Krishnaswami, R. Newton

• Authenticated Data Structures, Generically. 
  (preprint)
  A. Miller, M. Hicks, J. Katz, E. Shi

• Backpack: Retrofitting Haskell with Interfaces. 
  S. Kilpatrick, D. Dreyer, S. Peyton Jones, S. Marlow

• Symbolic Optimization with SMT Solvers. 
  Y. Li, A. Albarghouthi, Z. Kincaid, A. Gurfinkel, M. Chechik

• Applying quantitative semantics to higher-order quantum computing. 
  M. Pagani, P. Selinger, B. Valiron

• Replicated Data Types: Specification, Verification, Optimality. 
  S. Burckhardt, A. Gotsman, H. Yang, M. Zawirski

• NetKAT: Semantic Foundations for Networks. 
  C. Anderson, N. Foster, A. Guha, J. Jeannin, D. Kozen, C. Schlesinger, D. Walker

• Abstract Satisfaction. 
  V. D'Silva, L. Haller, D. Kroening

• Battery Transition Systems. 
  U. Boker, T. Henzinger, A. Radhakrishna

• Bridging Boolean and Quantitative Synthesis Using Smoothed Proof Search. 
  M. Clochard, S. Chaudhuri, A. Solar-Lezama

• CakeML: A Verified Implementation of ML. 
  R. Kumar, M. Myreen, S. Owens, M. Norrish

• From Parametricity to Conservation Laws, via Noether's Theorem. 
  (preprint) (webpage),
  R. Atkey

• Polymorphic Functions with Set-Theoretic Types (Part 1: Syntax, Semantics, and Evaluation). 
  G. Castagna, K. Nguyễn, Z. Xu, H. Im, S. Lenglet, L. Padovani

• A Constraint-Based Approach to Solving Games on Infinite Graphs. 
  T. Beyene, S. Chaudhuri, C. Popeea, A. Rybalchenko

• Tracing Compilation by Abstract Interpretation. 
  S. Dissegna, F. Logozzo, F. Ranzato

• Counter-Factual Typing for Debugging Type Errors. 
  S. Chen, M. Erwig

• Modular, Higher-Order Cardinality Analysis in Theory and Practice. 
  I. Sergey, D. Vytiniotis, S. Peyton Jones

• Modular Reasoning on Unique Heap Paths via Effectively Propositional Formulas. 
  S. Itzhaky, O. Lahav, A. Banerjee, N. Immerman, A. Nanevski, M. Sagiv

• Probabilistic Coherence Spaces are Fully Abstract for Probabilistic PCF. 
  T. Ehrhard, M. Pagani, C. Tasson

• A Relationally Parametric Model of Dependent Type Theory. 
  (preprint) (webpage),
  R. Atkey, N. Ghani, P. Johann

• A Trusted Mechanised JavaScript Specification. 
  M. Bodin, A. Charguéraud, D. Filaretti, P. Gardner, S. Maffeis, D. Naudziuniene, A. Schmitt, G. Smith

• An operational and axiomatic semantics for non-determinism and sequence points in C. 
  R. Krebbers

Affiliated events

?

(Feel free to send me pull request with the programme of the affiliated events, even if you don't have much preprint links, when they become available.)