APLAS 2014
25 papers
- A Formalized Proof of Strong Normalization for Guarded Recursive Types
- A Method for Scalable and Precise Bug Finding Using Program Analysis and Model Checking
- A Precise and Abstract Memory Model for C Using Symbolic Values
- A Translation of Intersection and Union Types for the λμ-Calculus
- A ZDD-Based Efficient Higher-Order Model Checking Algorithm
- Address Chain: Profiling Java Objects without Overhead in Java Heaps
- Automatic Constrained Rewriting Induction towards Verifying Procedural Programs
- Automatic Memory Management Based on Program Transformation Using Ownership
- Call-by-Value in a Basic Logic for Interaction
- Compositional Entailment Checking for a Fragment of Separation Logic
- Functional Pearl: Nearest Shelters in Manhattan
- Hereditary History-Preserving Bisimilarity: Logics and Automata
- Inferring Grammatical Summaries of String Values
- Logic Programming and Logarithmic Space
- Model-Checking for Android Malware Detection
- Necessary and Sufficient Preconditions via Eager Abstraction
- NetKAT - A Formal System for the Verification of Networks
- Optimized Compilation of Multiset Rewriting with Comprehensions
- Resource Analysis of Complex Programs with Cost Equations
- Resource Protection Using Atomics - Patterns and Verification
- Simple and Efficient Algorithms for Octagons
- Suppl: A Flexible Language for Policies
- Syntax-Directed Divide-and-Conquer Data-Flow Analysis
- The Essence of Ruby
- Types for Flexible Objects