Integrating temporal assertions into a parallel debugger

J. Kovács, Gabor Kusper, Robert Lovas, Wolfgang Schreiner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages113-120
Number of pages8
Volume2400
ISBN (Print)3540440496
Publication statusPublished - 2002
Event8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002 - Paderborn, Germany
Duration: Aug 27 2002Aug 30 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2400
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002
CountryGermany
CityPaderborn
Period8/27/028/30/02

Fingerprint

Temporal logic
Assertion
Macros
Message passing
Model checking
Debugging
Temporal Logic
Communication
Message Passing
Model Checking
Verify
Path

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kovács, J., Kusper, G., Lovas, R., & Schreiner, W. (2002). Integrating temporal assertions into a parallel debugger. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2400, pp. 113-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2400). Springer Verlag.

Integrating temporal assertions into a parallel debugger. / Kovács, J.; Kusper, Gabor; Lovas, Robert; Schreiner, Wolfgang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2400 Springer Verlag, 2002. p. 113-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2400).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kovács, J, Kusper, G, Lovas, R & Schreiner, W 2002, Integrating temporal assertions into a parallel debugger. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2400, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2400, Springer Verlag, pp. 113-120, 8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002, Paderborn, Germany, 8/27/02.
Kovács J, Kusper G, Lovas R, Schreiner W. Integrating temporal assertions into a parallel debugger. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2400. Springer Verlag. 2002. p. 113-120. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Kovács, J. ; Kusper, Gabor ; Lovas, Robert ; Schreiner, Wolfgang. / Integrating temporal assertions into a parallel debugger. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2400 Springer Verlag, 2002. pp. 113-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3e1edbbfb49d439cbb8e83118368777c,
title = "Integrating temporal assertions into a parallel debugger",
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.",
author = "J. Kov{\'a}cs and Gabor Kusper and Robert Lovas and Wolfgang Schreiner",
year = "2002",
language = "English",
isbn = "3540440496",
volume = "2400",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "113--120",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Integrating temporal assertions into a parallel debugger

AU - Kovács, J.

AU - Kusper, Gabor

AU - Lovas, Robert

AU - Schreiner, Wolfgang

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84956861371&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956861371&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84956861371

SN - 3540440496

VL - 2400

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 113

EP - 120

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -