APLAS 2010
30 papers
- A Calculus for Hybrid CSP
- A Certified Implementation of ML with Structural Polymorphism
- A Logical Mix of Approximation and Separation
- A Provably Correct Stackless Intermediate Representation for Java Bytecode
- A Quick Tour of the VeriFast Program Verifier
- Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
- An Interactive Tool for Analyzing Embedded SQL Queries
- Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
- Bisimulation Proof Methods in a Path-Based Specification Language for Polynomial Coalgebras
- Categorical Descriptional Composition
- Concurrency Can't Be Observed, Asynchronously
- Context-Preserving XQuery Fusion
- Data Structure Fusion
- Foundations of Quantum Programming (Extended Abstract)
- From a Verified Kernel towards Verified Systems
- Index-Compact Garbage Collection
- Interprocedural Control Flow Reconstruction
- JNI Light: An Operational Model for the Core JNI
- Liberal Typing for Functional Logic Programs
- Live Heap Space Bounds for Real-Time Systems
- Liveness of Communicating Transactions (Extended Abstract)
- Metric Spaces and Termination Analyses
- Model Independent Order Relations for Processes
- Reasoning about Computations Using Two-Levels of Logic
- Relational Parametricity for a Polymorphic Linear Lambda Calculus
- Simple and Precise Widenings for H-Polyhedra
- Towards Deriving Type Systems and Implementations for Coroutines
- Type Inference for Sublinear Space Functional Programming
- Typechecking Higher-Order Security Libraries
- Verification of Tree-Processing Programs via Higher-Order Model Checking