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.

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.)