IEICE TRANSACTIONS on Information
Variable Data-Flow Graph for Lightweight Program Slicing and Visualization
Summary :
To understand the behavior of a program, developers often need to read source code fragments in various modules. System-dependence-graph-based (SDG) program slicing is a good candidate for supporting the investigation of data-flow paths among modules, as SDG is capable of showing the data-dependence of focused program elements. However, this technique has two problems. First, constructing SDG requires heavyweight analysis, so SDG is not suitable for daily uses. Second, the results of SDG-based program slicing are difficult to visualize, as they contain many vertices. In this research, we proposed variable data-flow graphs (VDFG) for use in program slicing techniques. In contrast to SDG, VDFG is created by lightweight analysis because several approximations are used. Furthermore, we propose using the fractal value to visualize VDFG-based program slice in order to reduce the graph complexity for visualization purposes. We performed three experiments that demonstrate the accuracy of VDFG program slicing with fractal value, the size of a visualized program slice, and effectiveness of our tool for source code reading.
- Publication
- IEICE TRANSACTIONS on Information Vol.E98-D No.6 pp.1194-1205
- Publication Date
- 2015/06/01
- Publicized
- 2015/03/17
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2014EDP7395
- Type of Manuscript
- PAPER
- Category
- Software Engineering
Authors
Yu KASHIMA
Osaka University
Takashi ISHIO
Osaka University
Shogo ETSUDA
Osaka University
Katsuro INOUE
Osaka University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yu KASHIMA, Takashi ISHIO, Shogo ETSUDA, Katsuro INOUE, "Variable Data-Flow Graph for Lightweight Program Slicing and Visualization" in IEICE TRANSACTIONS on Information,
vol. E98-D, no. 6, pp. 1194-1205, June 2015, doi: 10.1587/transinf.2014EDP7395.
Abstract: To understand the behavior of a program, developers often need to read source code fragments in various modules. System-dependence-graph-based (SDG) program slicing is a good candidate for supporting the investigation of data-flow paths among modules, as SDG is capable of showing the data-dependence of focused program elements. However, this technique has two problems. First, constructing SDG requires heavyweight analysis, so SDG is not suitable for daily uses. Second, the results of SDG-based program slicing are difficult to visualize, as they contain many vertices. In this research, we proposed variable data-flow graphs (VDFG) for use in program slicing techniques. In contrast to SDG, VDFG is created by lightweight analysis because several approximations are used. Furthermore, we propose using the fractal value to visualize VDFG-based program slice in order to reduce the graph complexity for visualization purposes. We performed three experiments that demonstrate the accuracy of VDFG program slicing with fractal value, the size of a visualized program slice, and effectiveness of our tool for source code reading.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2014EDP7395/_p
Copy
@ARTICLE{e98-d_6_1194,
author={Yu KASHIMA, Takashi ISHIO, Shogo ETSUDA, Katsuro INOUE, },
journal={IEICE TRANSACTIONS on Information},
title={Variable Data-Flow Graph for Lightweight Program Slicing and Visualization},
year={2015},
volume={E98-D},
number={6},
pages={1194-1205},
abstract={To understand the behavior of a program, developers often need to read source code fragments in various modules. System-dependence-graph-based (SDG) program slicing is a good candidate for supporting the investigation of data-flow paths among modules, as SDG is capable of showing the data-dependence of focused program elements. However, this technique has two problems. First, constructing SDG requires heavyweight analysis, so SDG is not suitable for daily uses. Second, the results of SDG-based program slicing are difficult to visualize, as they contain many vertices. In this research, we proposed variable data-flow graphs (VDFG) for use in program slicing techniques. In contrast to SDG, VDFG is created by lightweight analysis because several approximations are used. Furthermore, we propose using the fractal value to visualize VDFG-based program slice in order to reduce the graph complexity for visualization purposes. We performed three experiments that demonstrate the accuracy of VDFG program slicing with fractal value, the size of a visualized program slice, and effectiveness of our tool for source code reading.},
keywords={},
doi={10.1587/transinf.2014EDP7395},
ISSN={1745-1361},
month={June},}
Copy
TY - JOUR
TI - Variable Data-Flow Graph for Lightweight Program Slicing and Visualization
T2 - IEICE TRANSACTIONS on Information
SP - 1194
EP - 1205
AU - Yu KASHIMA
AU - Takashi ISHIO
AU - Shogo ETSUDA
AU - Katsuro INOUE
PY - 2015
DO - 10.1587/transinf.2014EDP7395
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E98-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2015
AB - To understand the behavior of a program, developers often need to read source code fragments in various modules. System-dependence-graph-based (SDG) program slicing is a good candidate for supporting the investigation of data-flow paths among modules, as SDG is capable of showing the data-dependence of focused program elements. However, this technique has two problems. First, constructing SDG requires heavyweight analysis, so SDG is not suitable for daily uses. Second, the results of SDG-based program slicing are difficult to visualize, as they contain many vertices. In this research, we proposed variable data-flow graphs (VDFG) for use in program slicing techniques. In contrast to SDG, VDFG is created by lightweight analysis because several approximations are used. Furthermore, we propose using the fractal value to visualize VDFG-based program slice in order to reduce the graph complexity for visualization purposes. We performed three experiments that demonstrate the accuracy of VDFG program slicing with fractal value, the size of a visualized program slice, and effectiveness of our tool for source code reading.
ER -
English
