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 language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Publisher | Springer Verlag |
Pages | 113-120 |
Number of pages | 8 |
Volume | 2400 |
ISBN (Print) | 3540440496 |
Publication status | Published - 2002 |
Event | 8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002 - Paderborn, Germany Duration: Aug 27 2002 → Aug 30 2002 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 2400 |
ISSN (Print) | 03029743 |
ISSN (Electronic) | 16113349 |
Other
Other | 8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002 |
---|---|
Country | Germany |
City | Paderborn |
Period | 8/27/02 → 8/30/02 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
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 proceeding › Conference contribution
}
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 -