Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage

Treffer: Structure and Interpretation of Computer Programs

Title:
Structure and Interpretation of Computer Programs
Authors:
Narayan, Ganesh M., Gopinath, K., Sridhar, V.
Source:
2nd IEEE International Symposium on Theoretical Aspects of Software Engineering, 2008, Nanjing, China
Publication Year:
2008
Collection:
Computer Science
Subject Terms:
Computer Science - Software Engineering, Computer Science - Programming Languages, D.2.8, D.2.3, D.2.5, D.2.10
Document Type:
Report Working Paper
DOI:
10.1109/TASE.2008.40
Access URL:
http://arxiv.org/abs/0803.4025
Accession Number:
edsarx.0803.4025
Database:
arXiv

Weitere Informationen

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.
Comment: 9 pages, 10pt, double column, 15 figures