POPL 2015
55 papers
- A Calculus for Relaxed Memory
- A Coalgebraic Decision Procedure for NetKAT
- A Formally-Verified C Static Analyzer
- A Meta Lambda Calculus with Cross-Level Computation
- A Scalable, Correct Time-Stamped Stack
- Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables
- Algebraic Effects, Linearity, and Quantum Programming Languages
- Analyzing Program Analyses
- Automating Repetitive Tasks for the Masses
- Coding by Everyone, Every Day
- Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it
- Compositional CompCert
- Conjugate Hylomorphisms - Or: The Mother of All Structured Recursion Schemes
- DReX: A Declarative Language for Efficiently Evaluating Regular String Transformations
- Data-Parallel String-Manipulating Programs
- Databases and Programming: Two Subjects Divided by a Common Language?
- Decentralizing SDN Policies
- Deep Specifications and Certified Abstraction Layers
- Dependent Information Flow Types
- Differential Privacy: Now it's Getting Personal
- Equations, Contractions, and Unique Solutions
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth
- Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant
- From Communicating Machines to Graphical Choreographies
- From Network Interface to Multithreaded Web Applications: A Case Study in Modular Program Verification
- Full Abstraction for Signal Flow Graphs
- Functors are Type Refinement Systems
- Higher Inductive Types as Homotopy-Initial Algebras
- Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
- Integrating Linear and Dependent Types
- Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning
- K-Java: A Complete Semantics of Java
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems
- Manifest Contracts for Datatypes
- On Characterizing the Data Access Complexity of Programs
- Polymorphic Functions with Set-Theoretic Types: Part 2: Local Type Inference and Type Reconstruction
- Predicting Program Properties from "Big Code"
- Principal Type Schemes for Gradual Programs
- Probabilistic Termination: Soundness, Completeness, and Compositionality
- Program Boosting: Program Synthesis via Crowd-Sourcing
- Programming up to Congruence
- Proof Spaces for Unbounded Parallelism
- Quantitative Interprocedural Analysis
- Runtime Enforcement of Security Policies on Black Box Reactive Programs
- Safe & Efficient Gradual Typing for TypeScript
- Self-Representation in Girard's System U
- Sound Modular Verification of C Code Executing in an Unverified Context
- Space-Efficient Manifest Contracts
- Specification Inference Using Context-Free Language Reachability
- Succinct Representation of Concurrent Trace Sets
- Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
- Towards the Essence of Hygiene
- Tractable Refinement Checking for Concurrent Objects
- Ur/Web: A Simple Model for Programming the Web