File uploads: We have fixed an issue which caused file uploads to fail. We apologise for the inconvenience it may have caused.

Published April 29, 2021 | Version cav21
Software Open

Fast Computation of Strong Control Dependencies

  • 1. Masaryk University, Brno, Czechia

Description

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.

 

Notes

User: artifact, password: cav21 If there are troubles with running the VM, adjust the VM according to your host system (e.g., the number of CPU cores, the amount of memory for graphics, etc.)

Files

Files (6.2 GB)

Name Size Download all
md5:f16bfe6fb537f393838289332d7cd834
6.2 GB Download

Additional details

Related works

Is derived from
Conference paper: 10.1007/978-3-030-81688-9_41 (DOI)