Data Slicing: Separating the Heap into Independent Regions
No abstract available.
DOI 10.1007/978-3-540-31985-6_12
Related papers
- SLING: using dynamic analysis to infer program invariants in separation logic PLDI 2019
- Local Reasoning for Global Graph Properties ESOP 2020
- Go with the flow: compositional abstractions for concurrent data structures POPL 2018
- CPA-BAM-Slicing: Block-Abstraction Memoization and Slicing with Region-Based Dependency Analysis - (Competition Contribution) TACAS 2018
- Concurrent Garbage Collection Using Program Slices on Multithreaded Processors ISMM 2000
- PreFix: Optimizing the Performance of Heap-Intensive Applications CGO 2025
- A Theory of Slicing for Imperative Probabilistic Programs TOPLAS 2020
- Identification of logically related heap regions ISMM 2009