By Topic

A framework of an assertion-based algorithmic debugging for distributed programs

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
$33 $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

4 Author(s)
T. Ohta ; Dept. of Comput. Sci., Shizuoka Univ., Hamamatsu, Japan ; H. Kinoshita ; T. Kimata ; T. Mizuno

The article presents a framework and an assertion based prototype system of an algorithmic debugging for distributed programs written in procedural languages. First, an abstraction of previous related works is presented and we argue that an algorithmic debugging is a pruning process of a directed graph. Second, we present how to concrete the abstract method for distributed procedural languages. The method is divided into two phases. The purpose of the first phase is to reduce a range of erroneous program codes that cause a global state anomaly. We use only a global state in this phase. In the second phase, we locate a fault only using local states of processes. Third, we describe an overview of our prototype system based on the framework. The system is based on a replaying technique. We also show an automatic method for the first phase by using an assertion technique. Finally, the limitations of this approach and future work is presented. The major contribution of the paper is as follows. First, separating the treatment of global and local anomaly by dividing debugging processes into two phases enables us to apply algorithmic debugging to distributed programs. Second, we can use appearable execution points instead of actually appearing execution points to check whether the execution is correct or not, and third, we show an automatic operation of the first phase to avoid troublesome global state checking and to aim the range of codes which may contain fault

Published in:

Information Networking, 2001. Proceedings. 15th International Conference on

Date of Conference: