Computer Science – Software Engineering
Scientific paper
2008-03-27
2nd IEEE International Symposium on Theoretical Aspects of Software Engineering, 2008, Nanjing, China
Computer Science
Software Engineering
9 pages, 10pt, double column, 15 figures
Scientific paper
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 interprocedural 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.
Gopinath K.
Narayan Ganesh M.
Sridhar V.
No associations
LandOfFree
Structure and Interpretation of Computer Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Structure and Interpretation of Computer Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structure and Interpretation of Computer Programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-173511