Integrating Temporal Assertions into a Parallel Debugger

  • Jozsef Kovacs
  • Gabor Kusper
  • Robert Lovas
  • Wolfgang Schreiner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2400)

Abstract

We describe the use of temporal logic formulas as runtime assertions in a parallel debugging environment. The user asserts in a message passing program the expected system behavior by one or several such formulas. The debugger allows by “macro-stepping” to interactively elaborate the execution tree (i.e., the set of possible execution paths) which arises from the use of non-deterministic communication operations. In each macro-step, a temporal logic checker verifies that the once asserted temporal formulas are not violated by the current program state. Our approach thus introduces powerful runtime assertions into parallel and distributed debugging by incorporating ideas from the model checking of temporal formulas.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Jozsef Kovacs
    • 1
  • Gabor Kusper
    • 2
  • Robert Lovas
    • 1
  • Wolfgang Schreiner
    • 2
  1. 1.Hungarian Academy of SciencesComputer and Automation Research Institute (MTA SZTAKI)BudapestHungary
  2. 2.Research Institute for Symbolic Computation (RISC-Linz)Johannes Kepler UniversityLinzAustria

Personalised recommendations