Tracking data structures for postmortem analysis

  • Xiao X
  • Zhou J
  • Zhang C
  • 15


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Analyzing the runtime behaviors of the data structures is important because they usually relate to the obscured program performance and understanding issues. The runtime evolution history of data structures creates the possibility of building a lightweight and non-checkpointing based solution for the backward analysis for validating and mining both the temporal and stationary properties of the data structure. We design and implement TAEDS, a framework that focuses on gathering the data evolution history of a program at the runtime and provides a virtual machine for programmers to examine the behavior of data structures back in time. We show that our approach facilitates many programming tasks such as diagnosing memory problems and improving the design of the data structures themselves.

Author-supplied keywords

  • Arrays
  • Debugging
  • History
  • Instruments
  • Monitoring
  • NIER track
  • Runtime
  • backward analysis
  • data evolution
  • data structure
  • data structures
  • debugging
  • postmortem analysis
  • program analysis
  • stationary properties
  • temporal properties
  • tracing
  • virtual machine
  • virtual machines

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Xiao Xiao

  • Jinguo Zhou

  • Charles Zhang

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free