APLAS 2011
27 papers
- A Deductive Database with Datalog and SQL Query Languages
- A Non-iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs
- A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction
- A Semantics for Context-Sensitive Reduction Semantics
- Access-Based Localization with Bypassing
- Algebra, Logic, Locality, Concurrency
- Compiler Backend Generation for Application Specific Instruction Set Processors
- Computation-by-Interaction with Effects
- Constructing List Homomorphisms from Proofs
- Cost Analysis of Concurrent OO Programs
- Decentralized Delimited Release
- Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy
- Engineering Theories with Z3
- Extending Hindley-Milner Type Inference with Coercive Structural Subtyping
- Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism
- Modular Abstractions of Reactive Nodes Using Disjunctive Invariants
- On the Strength of Owicki-Gries for Resources
- Polymorphic Multi-stage Language with Control Effects
- Program Analysis and Machine Learning: A Win-Win Deal
- SPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA
- Software Verification with Liquid Types
- Solving Recursion-Free Horn Clauses over LI+UIF
- Soundness of Data Flow Analyses for Weak Memory Models
- Static Object Race Detection
- Template-Based Unbounded Time Verification of Affine Hybrid Automata
- Towards a Certified Petri Net Model-Checker
- Towards a General Theory of Barbs, Contexts and Labels