Refuting Heap Reachability
Abstract elided by the publisher.
Related papers
- Thresher: precise refutations for heap reachability PLDI 2013
- Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation - (Competition Contribution) TACAS 2023
- Historia: Refuting Callback Reachability with Message-History Logics OOPSLA 2023
- The Lattice-Theoretic Essence of Property Directed Reachability Analysis CAV 2022
- Modular verification of heap reachability properties in separation logic OOPSLA 2019
- Avoiding the Shoals - A New Approach to Liveness Checking CAV 2024
- 2LS: Memory Safety and Non-termination - (Competition Contribution) TACAS 2018
- FlowCFL: generalized type-based reachability analysis: graph reduction and equivalence of CFL-based and type-based reachability OOPSLA 2020