By Topic

Re-execution of distributed programs to detect bugs hidden by racing messages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kilgore, R. ; Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA ; Chase, C.

Finding errors in non-deterministic programs is complicated by the fact that an anomaly may occur during one program execution and not the next. Our objective is to provide a practical, yet powerful testing environment for distributed systems, using re-execution. We focus on re-executing the program under a strictly different message ordering. We show that messages are grouped into waves, such that any two messages from different waves must always be received in the same order. We provide an algorithm that produces a re-execution that maximizes the number of reordered pairs of message delivery events. We also provide an efficient online algorithm for detecting racing messages

Published in:

System Sciences, 1997, Proceedings of the Thirtieth Hawaii International Conference on  (Volume:1 )

Date of Conference:

7-10 Jan 1997