 | 2003 |
|---|
| 26 |       | Philip N. Klein,
Robert H. B. Netzer,
Hsueh-I Lu:
Detecting Race Conditions in Parallel Programs that Use Semaphores.
Algorithmica 35(4): 321-345 (2003) |
| 2002 |
|---|
| 25 | | Philip N. Klein,
Hsueh-I Lu,
Robert H. B. Netzer:
Detecting Race Conditions in Parallel Programs that Use Semaphores
CoRR cs.DS/0208004: (2002) |
| 2001 |
|---|
| 24 | | Franco Zambonelli,
Robert H. B. Netzer:
Deadlock-Free Incremental Replay of Message-Passing Programs.
J. Parallel Distrib. Comput. 61(5): 667-678 (2001) |
| 2000 |
|---|
| 23 | | Jean-Michel Hélary,
Achour Mostéfaoui,
Robert H. B. Netzer,
Michel Raynal:
Communication-Based Prevention of Useless Checkpoints in Fistributed Computations.
Distributed Computing 13(1): 29-43 (2000) |
| 1999 |
|---|
| 22 | | Jean-Michel Hélary,
Robert H. B. Netzer,
Michel Raynal:
Consistency Issues in Distributed Checkpoints.
IEEE Trans. Software Eng. 25(2): 274-281 (1999) |
| 1997 |
|---|
| 21 | | Robert H. B. Netzer,
Yikang Xu:
Replaying Distributed Programs without Message Logging.
HPDC 1997: 137-147 |
| 20 |  | Jean-Michel Hélary,
Achour Mostéfaoui,
Robert H. B. Netzer,
Michel Raynal:
Preventing Useless Checkpoints in Distributed Computations.
SRDS 1997: 183-190 |
| 19 | | D. Manivannan,
Robert H. B. Netzer,
Mukesh Singhal:
Finding Consistent Global Checkpoints in a Distributed Computation.
IEEE Trans. Parallel Distrib. Syst. 8(6): 623-627 (1997) |
| 1996 |
|---|
| 18 | | Philip N. Klein,
Hsueh-I Lu,
Robert H. B. Netzer:
Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract).
ESA 1996: 445-459 |
| 1995 |
|---|
| 17 | | Robert H. B. Netzer,
Jian Xu:
Necessary and Sufficient Conditions for Consistent Global Snapshots.
IEEE Trans. Parallel Distrib. Syst. 6(2): 165-169 (1995) |
| 1994 |
|---|
| 16 | | Robert H. B. Netzer,
Sairam Subramanian,
Jian Xu:
Critical-Path-Based Message Logging for incremental Replay of Message-Passing Programs.
ICDCS 1994: 404-413 |
| 15 | | Robert H. B. Netzer,
Mark H. Weaver:
Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs.
PLDI 1994: 313-325 |
| 1993 |
|---|
| 14 | | Robert H. B. Netzer:
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs.
LCPC 1993: 617-632 |
| 13 | | Robert H. B. Netzer,
Jian Xu:
Adaptive message logging for incremental replay of message-passing programs.
SC 1993: 840-849 |
| 12 | | Jian Xu,
Robert H. B. Netzer:
Adaptive Independent Checkpointing for Reducing Rollback Propagation.
SPDP 1993: 754-761 |
| 11 | | Hsueh-I Lu,
Philip N. Klein,
Robert H. B. Netzer:
Detecting Race Conditions in Parallel Programs that Use One Semaphore.
WADS 1993: 471-482 |
| 10 | | Robert H. B. Netzer:
Optimal Tracing and Replay for Debugging Shared-Memory Parallel Programs.
Workshop on Parallel and Distributed Debugging 1993: 1-11 |
| 9 | | Cherri M. Pancake,
Robert H. B. Netzer:
A Bibliography of Parallel Debuggers, 1993 Eddition.
Workshop on Parallel and Distributed Debugging 1993: 169-186 |
| 1992 |
|---|
| 8 | | Robert H. B. Netzer,
Sanjoy Ghosh:
Efficient Race Condition Detection for Shared-Memory Programs with Post/Wait Synchronization.
ICPP (2) 1992: 242-246 |
| 7 | | Robert H. B. Netzer,
Barton P. Miller:
Experience with Techniques for Refining Data Race Detection.
LCPC 1992: 449-463 |
| 6 | | Robert H. B. Netzer,
Barton P. Miller:
Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs.
SC 1992: 502-511 |
| 5 | | Robert H. B. Netzer,
Barton P. Miller:
What Are Race Conditions? Some Issues and Formalizations.
LOPLAS 1(1): 74-88 (1992) |
| 1991 |
|---|
| 4 | | Sarita V. Adve,
Mark D. Hill,
Barton P. Miller,
Robert H. B. Netzer:
Detecting Data Races on Weak Memory Systems.
ISCA 1991: 234-243 |
| 3 | | Robert H. B. Netzer,
Barton P. Miller:
Improving the Accuracy of Data Race Detection.
PPOPP 1991: 133-144 |
| 2 | | Jong-Deok Choi,
Barton P. Miller,
Robert H. B. Netzer:
Techniques for Debugging Parallel Programs with Flowback Analysis.
ACM Trans. Program. Lang. Syst. 13(4): 491-530 (1991) |
| 1990 |
|---|
| 1 | | Robert H. B. Netzer,
Barton P. Miller:
On the Complexity of Event Ordering for Shared-Memory Parallel Program Executions.
ICPP (2) 1990: 93-97 |
