Structure and Interpretation of Computer Programs
Call graphs depict the static, caller-callee relation between functions in a program. With most source/target languages supporting functions as the primitive unit of composition, call graphs naturally form the fundamental control flow representation available to understand/develop software. They are also the substrate on which various inter-procedural analyses are performed and are integral part of program comprehension/testing. Given their universality and usefulness, it is imperative to ask if call graphs exhibit any intrinsic graph theoretic features-across versions, program domains and source languages. This work is an attempt to answer these questions: we present and investigate a set of meaningful graph measures that help us understand call graphs better; we establish how these measures correlate, if any, across different languages and program domains; we also assess the overall, language independent software quality by suitably interpreting these measures.
Ganesh Narayan Gopinath K Sridhar V
Computer Science and Automation Indian Institute of Science Applied Research Group Satyam Computers
国际会议
南京
英文
73-80
2008-06-17（万方平台首次上网日期，不代表论文的发表时间）