Location of Repository

Hierarchical Tracing of Concurrent Programs

By Wei Jen Yeh and Michal Young


Practical analysis of large systems must proceed piecemeal, and preferably in a hierarchical manner with suppression of details at each level. Reports of possible errors, on the other hand, may be helpful only if they describe in detail how the error can occur. A common error reporting technique in analysis of concurrent systems is to present an example trace (sequence of actions) that exhibits an undesired property (e.g., a deadlock or critical race). Since suppression of detail may make such a trace less useful, we need to recover a detailed trace despite having suppressed details during the analysis. We describe an approach to recovering detailed traces of possible task interactions from a hierarchical state-space analysis, and report performance of the method in a prototype state-space analysis tool for Ada systems

Year: 1993
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.purdue.edu/serc/... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.