APLAS 2019
24 papers
- A Dependently Typed Multi-stage Calculus
- A Type-Based HFL Model Checking Algorithm
- Android Multitasking Mechanism: Formal Semantics and Static Analysis of Apps
- Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions
- Compositional Verification of Heap-Manipulating Programs Through Property-Guided Learning
- Conflict Abstractions and Shadow Speculation for Optimistic Transactional Objects
- Dissecting Widening: Separating Termination from Information
- Existential Types for Relaxed Noninterference
- Factorization and Normalization, Essentially
- Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion
- J-ReCoVer: Java Reducer Commutativity Verifier
- LiFtEr: Language to Encode Induction Heuristics for Isabelle/HOL
- Lightweight Functional Logic Meta-Programming
- Manifest Contracts with Intersection Types
- Mimalloc: Free List Sharding in Action
- On Strings in Software Model Checking
- Proving that Programs Are Differentially Private
- Pumping, with or Without Choice
- Recursion Schemes in Coq
- Reducing Static Analysis Alarms Based on Non-impacting Control Dependencies
- Simulations in Rank-Based Büchi Automata Complementation
- Succinct Determinisation of Counting Automata via Sphere Construction
- TxForest: A DSL for Concurrent Filestores
- Uniform Random Process Model Revisited