APLAS 2009
24 papers
- A Fresh Look at Separation Algebras and Share Accounting
- A Short Cut to Optimal Sequences
- A Skeletal Parallel Framework with Fusion Optimizer for GPGPU Programming
- Abstract Transformers for Thread Correlation Analysis
- Asymptotic Resource Usage Bounds
- Bi-abductive Resource Invariant Synthesis
- Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
- Certify Once, Trust Anywhere: Modular Certification of Bytecode Programs for Certified Virtual Machine
- Classical Natural Deduction for S4 Modal Logic
- Fractional Ownerships for Safe Memory Deallocation
- Large Spurious Cycle in Global Static Analyses and Its Algorithmic Mitigation
- On Stratified Regions
- On the Decidability of Subtyping with Bounded Existential Types
- Ownership Downgrading for Ownership Types
- Parallel Reduction in Resource Lambda-Calculus
- Proving Copyless Message Passing
- Refining Abstract Interpretation-Based Static Analyses with Hints
- Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters
- The Higher-Order, Call-by-Value Applied Pi-Calculus
- The Sketching Approach to Program Synthesis
- The Twilight Zone: From Testing to Formal Specifications and Back Again
- Types and Recursion Schemes for Higher-Order Program Verification
- Weak updates and separation logic
- Witnessing Purity, Constancy and Mutability