Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs
No abstract available.
Related papers
- Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs PLDI 1992
- Untyped Strictness Analysis JFP 1995
- Flow-Sensitive Type-Based Heap Cloning ECOOP 2020
- Single and Loving It: Must-Alias Analysis for Higher-Order Languages POPL 1998
- Fast algorithms for Dyck-CFL-reachability with applications to alias analysis PLDI 2013
- Newly-single and loving it: improving higher-order must-alias analysis with heap fragments ICFP 2021
- Type-Based Alias Analysis PLDI 1998
- Retargetable High-Level Alias Analysis POPL 1986