Utilizing Debug Information to Compact Loops in Large Program Traces

PDF

Authors
  1. Myers, D.
  2. Storey, M-A.
  3. Salois, M.
Corporate Authors
Defence R&D Canada - Valcartier, Valcartier QUE (CAN);Victoria Univ, Victoria BC (CAN) Dept of Computer Science
Abstract
In recent years, dynamic program execution traces have been utilized in an attempt to better understand the runtime behavior of various software systems. The unfortunate reality of such traces is that they become very large. Even traces of small programs can produce many millions of messages between different software artifacts. This not only affects the load on computer memory and storage, but it also introduces cognitive load for users, affecting their ability to understand their software. This paper discusses an algorithm which combines data from multiple sources–dynamic execution traces, source code, and debug information–in order to drastically reduce the number of messages that are displayed to the user. We introduce the algorithm and apply it to the Java programming language. The algorithm is employed against several Java software systems to investigate its effectiveness in compacting loops. Its usage is demonstrated in the context of a visualization based on UML Sequence Diagrams.
Report Number
DRDC-VALCARTIER-SL-2010-246 — Scientific Literature
Date of publication
01 Mar 2010
Number of Pages
10
DSTKIM No
CA035020
CANDIS No
534642
Format(s):
Electronic Document(PDF)

Permanent link

Document 1 of 1

Date modified: