You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Overlapping Flows

Fulltext:


Authors:

Husni Khanfar

Research group:

Programming Languages

Publication Type:

Report - MRTC

Publisher:

Mälardalen Real-Time Research Centre, Mälardalen University

ISRN:

MDH-MRTC-349/2024-1-SE

Abstract

Control dependence analysis is crucial in many program analysis techniques,such as program slicing. The state-of-practice approaches compute monolithically entire programs at once. My previous work proposed a new approach to compute the control dependencies accurately and on demand. The foundation of this approach is sets of overlapping flows, wherein each flow overlaps or is overlapped with another flow at least. This approach needs better time complexity because forming one set of overlapping flows might need to check the overlapping between each flow in this set with each flow in the program under analysis. This approach is expensive concerning time.This work shows a new innovative data structure that enables us to keep the cost required for collecting the flows that constitute a set of overlapping flows at a minimum.

Bibtex

@techreport{Khanfar6891,
author = {Husni Khanfar},
title = {Overlapping Flows},
month = {February},
year = {2024},
publisher = {M{\"a}lardalen Real-Time Research Centre, M{\"a}lardalen University},
url = {http://www.es.mdu.se/publications/6891-}
}