Title :
Understanding the complexity embedded in large routine call traces with a focus on program comprehension tasks
Author :
Hamou-Lhadj, Abdelwahab ; Lethbridge, Timothy C.
Author_Institution :
Dept. of Electr. & Comput. Eng., Concordia Univ., West Montreal, QC, Canada
fDate :
4/1/2010 12:00:00 AM
Abstract :
The analysis of execution traces has been shown to be useful in many software maintenance activities that require a certain understanding of the systems´ behaviour. Traces, however, are extremely large, hence are difficult for humans to analyse without effective tools. These tools usually support some sort of trace abstraction techniques that can help users understand the essence of a trace despite the trace being massive. Designing such tools requires a good understanding of the amount of complexity embedded in traces. Trace complexity has traditionally been measured using the file size or the number of lines in the trace. In this study, the authors argue that such metrics provide limited indication of the complexity of a trace. The authors address this issue by presenting a catalogue of metrics for assessing the various facets of traces of routine calls, with the ultimate objective being to facilitate the development of tools for the exploration of lengthy traces. The authors show the effectiveness of our metrics by applying them to 35 traces generated from four software systems.
Keywords :
computational complexity; embedded systems; software maintenance; software metrics; complexity embedded understanding; large routine call traces; program comprehension tasks; software maintenance; software systems;
Journal_Title :
Software, IET
DOI :
10.1049/iet-sen.2009.0031