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

Syntax-Directed Control Dependency Analysis: Eliminating Graph Overhead

Fulltext:


Authors:

Husni Khanfar

Publication Type:

Report - MRTC

Publisher:

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

ISRN:

MDH-MRTC-354/2025-1-SE

Abstract

State-of-practice techniques in static program analysis mainly depend on constructing intermediate data structures, primarily graphs, to facilitate various analyses. However, these structures introduce significant computational overhead in terms of time and space. One key static analysis technique is the computation of control dependencies, which plays a crucial role in optimizing compilers, program slicing, debugging, and parallelization by determining the execution order of statements based on conditional branches.In this paper, we present an improved technique for computing control dependencies without requiring any intermediate graph-based representations. Our approach eliminates unnecessary computations, significantly reducing resource consumption while maintaining accuracy. Experimental evaluations demonstrate that our method not only outperforms classical techniques in terms of execution speed but also exhibits superior scalability and stability when applied to large-scale programs. These findings suggest that our approach is a viable alternative to conventional methods, offering a more efficient solution for static program analysis in modern software engineering.

Bibtex

@techreport{Khanfar7146,
author = {Husni Khanfar},
title = {Syntax-Directed Control Dependency Analysis: Eliminating Graph Overhead},
month = {February},
year = {2025},
publisher = {M{\"a}lardalen Real-Time Research Centre, M{\"a}lardalen University},
url = {http://www.es.mdu.se/publications/7146-}
}