APLAS 2018
22 papers
- A Decision Procedure for String Logic with Quadratic Equations, Regular Expressions and Length Constraints
- Automated Modular Verification for Relaxed Communication Protocols
- Automated Proof Synthesis for the Minimal Propositional Logic with Deep Neural Networks
- Automated Synthesis of Functional Programs with Auxiliary Functions
- Certifying CPS Transformation of Let-Polymorphic Calculus Using PHOAS
- Complexity Analysis of Tree Share Structure
- Factoring Derivation Spaces via Intersection Types
- Formal Small-Step Verification of a Call-by-Value Lambda Calculus Machine
- HoIce: An ICE-Based Non-linear Horn Clause Solver
- Model Checking Differentially Private Properties
- Modular Verification of SPARCv8 Code
- New Approaches for Almost-Sure Termination of Probabilistic Programs
- Non-linear Pattern Matching with Backtracking for Non-free Data Types
- On the Complexity of Pointer Arithmetic in Separation Logic
- On the Soundness of Call Graph Construction in the Presence of Dynamic Language Features - A Benchmark and Tool Evaluation
- Particle-Style Geometry of Interaction as a Module System
- Relational Thread-Modular Abstract Interpretation Under Relaxed Memory Models
- Scallina: Translating Verified Programs from Coq to Scala
- Shallow Effect Handlers
- The Practice of a Compositional Functional Programming Language
- Traf: A Graphical Proof Tree Viewer Cooperating with Coq Through Proof General
- Types of Fireballs