POPL 2013
47 papers
- A model-learner pattern for bayesian reasoning
- A theorem prover for Boolean BI
- Abstract conflict driven learning
- Abstraction and invariance for algebraically indexed types
- Advanced automata minimization
- Automatic detection of floating-point exceptions
- Automating relatively complete verification of higher-order functional programs
- Cache and I/O efficent functional algorithms
- Checking NFA equivalence with bisimulations up to congruence
- Complete instantiation-based interpolation
- Copatterns: programming infinite structures by observations
- Deadlock-freedom-by-design: multiparty asynchronous global programming
- Engineering mathematics: the odd order theorem proof
- Fault tolerance via idempotence
- From principles to programming languages (and back)
- Full abstraction for nominal Scott domains
- Fully abstract compilation to JavaScript
- HALO: haskell to logic through denotational semantics
- High-level separation logic for low-level code
- How languages can save distributed computing
- Hyperstream processing systems: nonstandard modeling of continuous-time signals
- Inductive data flow graphs
- Library abstraction for C/C++ concurrency
- Linear dependent types for differential privacy
- Logical relations for fine-grained concurrency
- Meta-theory à la carte
- On the linear ranking problem for integer linear-constraint loops
- Optimizing data structures in high-level programs: new directions for extensible compilers based on staging
- Plan B: a buffered memory model for Java
- Principled parsing for indentation-sensitive languages: revisiting landin's offside rule
- Quantitative abstraction refinement
- Quantitative relaxation of concurrent data structures
- Sigma*: symbolic learning of input-output specifications
- Static and dynamic semantics of NoSQL languages
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
- Subjective auxiliary state for coarse-grained concurrency
- Synthesis of biological models from mutation experiments
- The Lambda Lambda-Bar calculus: a dual calculus for unconstrained strategies
- The geometry of types
- The power of parameterization in coinductive proof
- The principles and practice of probabilistic programming
- The ramifications of sharing in data structures
- The sequential semantics of producer effect systems
- The type discipline of behavioral separation
- Towards fully automatic placement of security sanitizers and declassifiers
- Universal properties of impure programming languages
- Views: compositional reasoning for concurrent programs