Fast Computation of Strong Control Dependencies

D 2021

Fast Computation of Strong Control Dependencies

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

Basic information

Original name

Fast Computation of Strong Control Dependencies

Authors

CHALUPA, Marek (203 Czech Republic, belonging to the institution), David KLAŠKA (203 Czech Republic, belonging to the institution), Jan STREJČEK (203 Czech Republic, belonging to the institution) and Lukáš TOMOVIČ (703 Slovakia, belonging to the institution)

Edition

Cham (Švýcarsko), Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II, p. 887-910, 24 pp. 2021

Publisher

Springer, Cham

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Switzerland

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

References:

URL

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/21:00121991

Organization unit

Faculty of Informatics

ISBN

978-3-030-81687-2

ISSN

DOI

http://dx.doi.org/10.1007/978-3-030-81688-9_41

UT WoS

000693429500041

Keywords in English

control dependence;non-termination sensitive control dependence;decisive order dependence;control closure;ntscd;dod;graph theory

Abstract

V originále

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.

Links

MUNI/A/1108/2020, interní kód MU

Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace X. (Acronym: SV-FI MAV X.)

Investor: Masaryk University

MUNI/A/1549/2020, interní kód MU

Name: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 21 (Acronym: SKOMU)

Investor: Masaryk University

Citovat

CHALUPA, Marek, David KLAŠKA, Jan STREJČEK and Lukáš TOMOVIČ. Fast Computation of Strong Control Dependencies. In Alexandra Silva, K. Rustan M. Leino. Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II. Cham (Švýcarsko): Springer, Cham, 2021, p. 887-910. ISBN 978-3-030-81687-2. Available from: https://dx.doi.org/10.1007/978-3-030-81688-9_41.

@inproceedings{1783922,
   author = {Chalupa, Marek and Klaška, David and Strejček, Jan and Tomovič, Lukáš},
   address = {Cham (Švýcarsko)},
   booktitle = {Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II},
   doi = {http://dx.doi.org/10.1007/978-3-030-81688-9_41},
   editor = {Alexandra Silva, K. Rustan M. Leino},
   keywords = {control dependence;non-termination sensitive control dependence;decisive order dependence;control closure;ntscd;dod;graph theory},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Cham (Švýcarsko)},
   isbn = {978-3-030-81687-2},
   pages = {887-910},
   publisher = {Springer, Cham},
   title = {Fast Computation of Strong Control Dependencies},
   url = {https://link.springer.com/chapter/10.1007%2F978-3-030-81688-9_41},
   year = {2021}
}

TY  - JOUR
ID  - 1783922
AU  - Chalupa, Marek - Klaška, David - Strejček, Jan - Tomovič, Lukáš
PY  - 2021
TI  - Fast Computation of Strong Control Dependencies
PB  - Springer, Cham
CY  - Cham (Švýcarsko)
SN  - 9783030816872
KW  - control dependence;non-termination sensitive control dependence;decisive order dependence;control closure;ntscd;dod;graph theory
UR  - https://link.springer.com/chapter/10.1007%2F978-3-030-81688-9_41
N2  - 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.
ER  -

CHALUPA, Marek, David KLAŠKA, Jan STREJČEK and Lukáš TOMOVIČ. Fast Computation of Strong Control Dependencies. In Alexandra Silva, K. Rustan M. Leino. \textit{Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II}. Cham (Švýcarsko): Springer, Cham, 2021, p.~887-910. ISBN~978-3-030-81687-2. Available from: https://dx.doi.org/10.1007/978-3-030-81688-9\_{}41.

Detailed Information on Publication Record