Software Open Access
Fast Computation of Strong Control Dependencies
Marek Chalupa;
David Klaška;
Jan Strejček;
Lukáš Tomovič
We introduce new algorithms for computing non-termination sensitive control dependence (NTSCD) and decisive order dependence (DOD). These relations on vertices of a control flow graph have many applications including program slicing and compiler optimizations. Our algorithms are asymptotically faster than the current algorithms. We also show that the original algorithms for computing NTSCD and DOD may produce incorrect results. We implemented the new as well as fixed versions of the original algorithms for the computation of NTSCD and DOD. Experimental evaluation shows that our algorithms dramatically outperform the original ones.
This artifact contains a virtual machine with the infrastructure for experiments, benchmarks, and a set of automated scripts to reproduce the results from the paper.
| Name | Size | |
|---|---|---|
|
CAV21artifact.ova
md5:f16bfe6fb537f393838289332d7cd834 |
6.2 GB | Download |
| All versions | This version | |
|---|---|---|
| Views | 146 | 146 |
| Downloads | 75 | 75 |
| Data volume | 465.9 GB | 465.9 GB |
| Unique views | 135 | 135 |
| Unique downloads | 61 | 61 |
- Publication date:
- April 29, 2021
- DOI:
-
- Keyword(s):
- NTSCD non-termination sensitive control dependence DOD decisive order dependence control dependence program slicing graph theory program analysis
- Related identifiers:
- Derived from
- 10.1007/978-3-030-81688-9_41 (Conference paper)
- License (for files):
- Creative Commons Attribution 4.0 International