The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Conditioned Slicing of Interprocedural Programs
|
|
Author(s): Madhusmita Sahu (National Institute of Technology, Odisha, India)
Copyright: 2019
Volume: 6
Issue: 1
Pages: 18
Source title:
International Journal of Rough Sets and Data Analysis (IJRSDA)
Editor(s)-in-Chief: Parikshit Narendra Mahalle (Department of Artificial Intelligence and Data Science, Bansilal Ramnath Agarwal Charitable Trust's, Vishwakarma Institute of Information Technology, India)
DOI: 10.4018/IJRSDA.2019010103
Purchase
|
Abstract
Program slicing is a technique to decompose programs depending on control flow and data flow amongst several lines of code in a program. Conditioned slicing is a generalization of static slicing and dynamic slicing. A variable, the desired program point, and a condition of interest form a slicing criterion for conditioned slicing. This paper proposes an approach to calculate conditioned slices for programs containing multiple procedures. The approach is termed Node-Marking Conditioned Slicing (NMCS) algorithm. In this approach, first and foremost step is to build an intermediate symbolization of a given program code and the next step is to develop an algorithm for finding out conditioned slices. The dependence graph, termed System Dependence Graph (SDG), is used to symbolize intermediate presentation. After constructing SDG, the NMCS algorithm chooses nodes that satisfy a given condition by the process of marking and unmarking. The algorithm also finds out conditioned slices for every variable at every statement during the process. NMCS algorithm employs a stack to save call context of a method. Few edges in SDG are labeled to identify the statement that calls a method. The proposed algorithm is implemented, and its performance is tested with several case study projects.
Related Content
|
Tianlong Wang, Chaoyang Wang, Zhiqiang Liu, Shuai Ma, Huibo Yan.
© 2024.
15 pages.
|
|
Xudong Cao, Chenchen Chen, Lejia Zhang, Li Pan.
© 2024.
25 pages.
|
|
Shengfeng Xie, Jingwei Li.
© 2024.
20 pages.
|
|
Xiaoyuan Wang, Hongfei Wang, Jianping Wang, Jiajia Wang.
© 2024.
24 pages.
|
|
Jiao Hao, Zongbao Zhang, Yihan Ping.
© 2024.
14 pages.
|
|
Qinmei Wang.
© 2024.
13 pages.
|
|
Wenzhen Mai, Mohamud Saeed Ambashe, Chukwuka Christian Ohueri.
© 2024.
18 pages.
|
|
|