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

Fast and incremental computation of weak control closure



Publication Type:

Conference/Workshop Paper


29th Static Analysis Symposium


Control dependence is a fundamental concept used in many program analysis techniques such as program slicing, program debug- ging, program parallelization, and detecting security leaks. Since the introduction of this concept in the late eighties, numerous definitions of control dependencies and their computation methods have been de- veloped. The later definitions are progressively more generalized cover- ing a wide spectrum of modern programming language constructs. The most generalized concepts are the weak and strong control closure (WCC and SCC) that capture the nontermination (in)sensitive control depen- dencies of a given program. In this paper, we have developed a novel method to compute WCC incrementally. Any client application of WCC such as program slicing requires computing the WCC repeatedly in a fixpoint computation. An incremental algorithm to compute WCC will improve the performance of the client application significantly. We have provided the proof of correctness and the theoretical worst-case com- plexity of our algorithm. We have performed an experimental evaluation on well-known benchmarks, and our experiments reveal that we have significantly improved the practical efficiency in computing WCC incre- mentally. We have obtained an average speedup of 31.03 in all bench- marks and a maximum speedup of 35.29 than the best state-of-the-art algorithm computing WCC.


author = {Abu Naser Masud},
title = {Fast and incremental computation of weak control closure},
editor = {Gagandeep Singh, Caterina Urban},
month = {December},
year = {2022},
booktitle = {29th Static Analysis Symposium},
url = {}