Fast and Incremental Computation of Weak Control Closure
Abstract elided by the publisher.
Related papers
- Simple and Efficient Computation of Minimal Weak Control Closure SAS 2020
- On the computation of interprocedural weak control closure CC 2022
- Generalized Dominance and Control Dependence PLDI 1996
- Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs TOPLAS 2021
- Abstracting abstract control DLS 2014
- Static Backward Slicing of Non-deterministic Programs and Systems TOPLAS 2018
- SHARP: fast incremental context-sensitive pointer analysis for Java OOPSLA 2022
- An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data-Flow Analysis TOPLAS 1990