A Debugger for AND and OR-Parallel Logic Programming Languge ANDOR-II

概要

論文の詳細を見る
This paper discusses a debugger for an AND- and OR-parallel logic programming language ANDOR-II. In this class of languages debugging is complicated and burdensome, since the user has to handle the computation of multiple worlds. We propose a framework of debugging which consists of three stages: (1) A buggy program is executed, and the history of the whole computation is gathered. (2) The computation of a representative world in which the bug manifests is reconstructed using the above history. (3) Algorithmic debugging is applied to the computation in this world. We show a realization of the debugger based on this framework. The underlying idea is the extraction of an erroneous AND tree from an AND/OR tree and application of well established debugging algorithms to this AND tree. And if there is a bug in a program, it may cause erroneous results in several worlds. This implies that to fix the bug, examination of one world in which the bug manifests is sufficient. We also discuss yet another approach of utilizing information found in OR parallel worlds. Although the framework described above is investigated in more detail using ANDOR-II as an example, it is general enough to be applicable to other AND-and OR-parallel logic programming languages.
一般社団法人情報処理学会の論文
1993-04-15