Binary Reachability Analysis of Higher Order Functional Programs
Abstract elided by the publisher.
Related papers
- Temporal verification of higher-order functional programs POPL 2016
- Higher-Order Demand-Driven Program Analysis ECOOP 2016
- Higher-order Demand-driven Program Analysis TOPLAS 2019
- Reachability types: tracking aliasing and separation in higher-order functional programs OOPSLA 2021
- Introspective pushdown analysis of higher-order programs ICFP 2012
- Exploiting reachability and cardinality in higher-order flow analysis JFP 2008
- Stable relations and abstract interpretation of higher-order programs ICFP 2020
- Higher-Order Property-Directed Reachability ICFP 2023