A Discovery Method of the Dirty Data Transmission Path Based on Complex Network

Abstract:

With the increasing scale of software system, the interaction between software elements becomes more and more complex, which lead to the increased dirty data in running software system. This may reduce the system performance and cause system collapse. In this paper, we proposed a discovery method of the dirty data transmission path based on complex network. Firstly, the binary file is decompiled and the function call graph is drawn by using the source code. Then the software structure is described as a weighted directed graph based on the knowledge of complex network. In addition, the dirty data node is marked by using the power-law distribution characteristics of the scale-free network construction of complex network chart. Finally, we found the dirty data transmission path during software running process. The experimental results show the transmission path of dirty data is accurate, which confirmed the feasibility of the method.

• Periodical: Applied Mechanics and Materials (Volumes 651-653)
• Pages: 1741-1747
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.651-653.1741
• Online since: September 2014
• Authors: Xiao Lin Zhao, Gang Hao, Chang Zhen Hu, Zhi Qiang Li*
• Keywords: Complex Network, Decompilation, Dirty Data, Function Call

References

[1] H. Huang, L. H. Jiang. A decompile model based multiple disassemble front-end result. International Conference on Information Technology and Environmental System Sciences (2008).

[2] B. Boehm. Some future trends and implications for systems and software engineering processes. Systems Engineering, Vol. 9 (2006), pp.1-19.

[3] Y. C. Bao. Building process virtual machine via dynamic binary translation. Shanghai: Shanghai Jiaotong University (2007).

[4] R. P. Zhou, T. Lei, H. Zhu. Applied study of library functions recognition in decompiling. Application Research of Computers, Vol. 12 (2004), pp.34-35.

[5] J. B. Wu, L. H. Jiang, P. Zhao. Research on a static disassembly algorithm based upon control flow. Computer Engineering and Applications, Vol. 41 (2005), pp.89-90.

[6] D. Yan, G. N. Qi. The scale-free feature and evolving model of large-scale software system. ACTA Physica Sinica, Vol. 55 (2006), pp.3799-3804.

DOI: 10.7498/aps.55.3799

[7] M. C. Han, D. Y. Li, C. Y. Liu. Networked characteristics in software and its contribution to software quality. Computer Engineering and Applications, Vol. 42 (2006), pp.29-31.

[8] K. J. Zhou, Y. P. Wang, Y. Li. Web users clustering algorithm. computer engineering and applications, Vol. 42 (2006), pp.184-187.

[9] G. Palla, I. Derenvi, I. Farkas. Uncovering the overlapping community structures of complex networks in nature and society, Vol. 435 (2005), pp.814-818.

DOI: 10.1038/nature03607

[10] S. Boccaletti, V. Latora, Y. Moreno. Complex networks: Structure and dynamics. Physics Reports, (2006).

[11] A. Potanin, J. Noble, M. Frean. Scale-free geometry in object-oriented programs. Comm ACM, Vol. 48 (2005), pp.99-103.

DOI: 10.1145/1060710.1060716

[12] C. Myers. Software systems as complex networks: structure, function, and evolvability of software collaboration graphs. Physical Rev, Vol. 68 (2003), pp.100-104.

DOI: 10.1103/physreve.68.046116

[13] R. Wheeldon, S. Counsell. Power law distributions in class relationships. Proc Third IEEE International Workshop Source Code Analysis and Manipulation, (2003), pp.128-218.

DOI: 10.1109/scam.2003.1238030