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

  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at

  • 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

Computing on-the-fly the Relevant Program Flows to a Control Dependency



Research group:

Publication Type:

Report - MRTC


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


Control dependence analysis is a key step in many program analysis techniques such as program slicing. The current approaches that compute control dependencies have two limitations. First, they are monolithically computed for the whole program at once. Second, these approaches do not compute the relevant program flows with the control dependency. They consider the relevant flows a slicing issue. This work extends our previous work that computes on demand the control dependencies for a particular program statement without making a comprehensive analysis. It defines new concepts in static program analysis discipline, that will be a new foundation for many future works in static program analysis. Moreover, it significantly optimizes our previous work. Finally, it presents a new approach that can compute the relevant predicates and goto statements to a particular control dependency. The contribution of this work is well-proved, and it has succeeded with hundreds of examples. However, this is the first work that claims that it can compute accurately and on demand the control dependencies with its relevant flows.


author = {Husni Khanfar},
title = {Computing on-the-fly the Relevant Program Flows to a Control Dependency},
month = {April},
year = {2021},
publisher = {M{\"a}lardalen Real-Time Research Centre, M{\"a}lardalen University},
url = {}