Analyzing information-flow in java program based on slicing technique
Author:
Open Access
- 1 September 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSOFT Software Engineering Notes
- Vol. 27 (5) , 98-103
Abstract
Traditional information-flow analysis is mainly based on dataflow and control-flow analysis. In object-oriented program, because of pointer aliasing, inheritance, and polymorphism, information-flow analysis become very complicated. Especially, it is difficult to rely only on normal data and control-flow analysis techniques. some new approaches are required to analyze the information-flow between components in object-oriented program. In this paper, object-oriented program slicing technique is introduced. By this technique, the amount of information-flow, the width of information-flow and correlation coefficient between components can be computed. Some applications of the information-flow are also discussed and analyzed in this paper.Keywords
This publication has 4 references indexed in Scilit:
- An extensible program representation for object-oriented softwareACM SIGPLAN Notices, 1994
- Interprocedural slicing using dependence graphsACM Transactions on Programming Languages and Systems, 1990
- Program SlicingIEEE Transactions on Software Engineering, 1984
- The program dependence graph in a software development environment1984