Informace o publikaci

Fast Computation of Strong Control Dependencies

Autoři

CHALUPA Marek KLAŠKA David STREJČEK Jan TOMOVIČ Lukáš

Rok publikování 2021
Druh Článek ve sborníku
Konference Computer Aided Verification
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www https://link.springer.com/chapter/10.1007%2F978-3-030-81688-9_41
Doi http://dx.doi.org/10.1007/978-3-030-81688-9_41
Klíčová slova control dependence;non-termination sensitive control dependence;decisive order dependence;control closure;ntscd;dod;graph theory
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info