A metamodel for the compact but lossless exchange of execution traces

  • Authors:

  • Abdelwahab Hamou-Lhadj;Timothy C. Lethbridge

  • Affiliations:

  • Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada;School of Information Technology and Engineering (SITE), University of Ottawa, Ottawa, Canada

  • Venue:
  • Software and Systems Modeling (SoSyM)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Understanding the behavioural aspects of a software system can be made easier if efficient tool support is provided. Lately, there has been an increase in the number of tools for analysing execution traces. These tools, however, have different formats for representing execution traces, which hinders interoperability and limits reuse and sharing of data. To allow for better synergies among trace analysis tools, it would be beneficial to develop a standard format for exchanging traces. In this paper, we present a graph-based format, called compact trace format (CTF), which we hope will lead the way towards such a standard. CTF can model traces generated from a variety of programming languages, including both object-oriented and procedural ones. CTF is built with scalability in mind to overcome the vast size of most interesting traces. Indeed, the design of CTF is based on the idea that call trees can be transformed into more compact ordered acyclic directed graphs by representing similar subtrees only once. CTF is also supported by our trace analysis tool SEAT (Software Exploration and Analysis Tool).