Using Dictionary Compression Algorithms to Identify Phases in Program Traces

by Sheeva Afshan, Phil McMinn, and Neil Walkinshaw

Technical Report (Department of Computer Science, University of Sheffield), 2010



Program execution traces record the sequences of events or functions that are encountered during a program execution. They can provide valuable insights into the run-time behaviour of software systems and form the basis for dynamic analysis techniques. Execution traces of large software systems can be huge, incorporating hundreds of thousands of elements, rendering them difficult to interpret and understand. One recognised problem is the phase-detection problem where the challenge is to identify repeating phases within a trace that may correspond to the execution of particular features within the software system. This paper proposes an abstraction technique that uses the well-known ... [more]


Reference

Sheeva Afshan, Phil McMinn, and Neil Walkinshaw. Using Dictionary Compression Algorithms to Identify Phases in Program Traces. Department of Computer Science, University of Sheffield Technical Report CS-10-01, 2010


Bibtex Entry
@techreport{Afshan2010,
  author      = "Afshan, Sheeva and McMinn, Phil and Walkinshaw, Neil",
  title       = "Using Dictionary Compression Algorithms to Identify Phases in Program Traces",
  number      = "CS-10-01",
  year        = "2010",
  institution = "Department of Computer Science, University of Sheffield"
}