Topology Characters of the Linux Call Graph

Author

Yu-Fang Wang ; De-Wu Ding

Author_Institution

Dept. of Math. & Phys., Jingchu Univ. of Technol., Jingmen, China

fYear

2015

fDate

24-26 April 2015

Firstpage

517

Lastpage

518

Abstract

A call graph is a directed graph in which nodes are functional units and arcs are call events, it is used to represent the call relationship of the program. Generally speaking, call graph plays a very important role in program analysis, and it has been widely used in software engineering (e.g., program understanding, compiling optimization, regression test, etc). In the present paper, we studied the giant strong component of the call graph of the Linux kernel (v2.6.27) with the rising complex network theory. We analyzed some basic topological characteristic of the giant strong component, and we also identified the top 20 functional units.

Keywords

Linux; complex networks; directed graphs; network theory (graphs); operating system kernels; program diagnostics; topology; Linux call graph; Linux kernel; call events; complex network theory; directed graph; functional units; program analysis; software engineering; topology characters; Biology; Complex networks; Kernel; Linux; Physics; Topology; Linux kernel; call graph; complex network; topological characteristic;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Science and Control Engineering (ICISCE), 2015 2nd International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4673-6849-0

Type

conf

DOI

10.1109/ICISCE.2015.120

Filename

7120660