Structure and Interpretation of Computer Programs

Narayan, Ganesh M and Gopinath, K and Sridhar, V (2008) Structure and Interpretation of Computer Programs. In: IEEE . (In Press)

Preview

PDF sfree.pdf Download (239kB)

Abstract

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.

Item Type:	Journal Article
Publication:	IEEE
Publisher:	IEEE Computer Society Press
Additional Information:	Publication details not available yet
Keywords:	Software Engineering;Call Graphs;Software Metrics;Statistics
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	27 Mar 2008
Last Modified:	19 Sep 2010 04:43
URI:	http://eprints.iisc.ac.in/id/eprint/13503

Available Versions of this Item

• Structure and Interpretation of Computer Programs. (deposited 27 Mar 2008) [Currently Displayed]
  • Structure and Interpretation of Computer Programs. (deposited 28 Mar 2008)

Actions (login required)

View Item