In this paper, we describe the process-level debugger of GRAPE, a hierarchical graphical programming environment for concurrent programs. This debugger allows to debug concurrent programs that are based on communicating sequential processes. Its unique feature is that it clearly separates the identification of erroneous processes from the exact localisation of the bug on the source-level. This ...

Algorithmic debugging is a debugging technique that has been extended to practically all programming paradigms. Roughly speaking, the technique constructs an internal representation of all (sub)computations performed during the execution of a buggy program; and then, it asks the programmer about the correctness of such computations. The answers of the programmer guide the search for the bug unt...

We suggest an approach to the development of software testing and debugging automation tools based on precise program behavior models. The program behavior model is defined as a set of events (event trace) with two basic binary relations over events -precedence and inclusion, and represents the temporal relationship between actions. A language for the computations over event traces is developed...

ABSTRACT Dynamic program slicing methods are very attractive for debugging because many statements can be ignored in the process of localizing a bug. Although language interoperability is a key concept in modern development platforms, current slicing techniques are still restricted to a single language. In this paper a cross-language dynamic program slicing technique is introduced for the .NET ...

This paper suggests an approach to the development of software testing and debugging automation tools based on precise program behavior models. The program behavior model is defined as a set of events (event trace) with two basic binary relations over events -precedence and inclusion, and represents the temporal relationship between actions. A language for the computations over event traces is ...

Facilities for instrumentation or runtime “printf” debugging are commonly implemented by instrumentation or debugging statements interspersed within program code. Such hardwiring makes the programs dependent on assumptions about the implementations of these services (meta-facilities) that are used by almost every program module. As a result, program modules become difficult to reuse in contexts...

Preface This thesis deals with debugging in answer-set programming (ASP), a logic-programming paradigm which became popular in the scientific community for its fully declarative semantics. A major reason why ASP has not found widespread popularity as problem-solving technique yet is a lack of suitable tools for program development. In particular, debugging in ASP is an important field which has...

In this paper we examine how we can find contradictions from Answer Set Programs (ASP). One of the most important phases of programming is debugging, finding errors that have crept in during program implementation. Current ASP systems are still mostly experimental tools and their support for debugging is limited. This paper addresses one part of ASP debugging, finding the reason why a program d...

Information about Prolog data term's dependencies on derivation goals can be used for improved debugging, whether in the wrong solution or the missing solution type of faulty program behaviour. A debugger for full Prolog (itself written in Prolog) has been developed which automates the reasoning ability required to pinpoint errors, resorting to the user only to ask about the intended program se...

Program debugging is one of the most time-consuming parts of the software development cycle. In recent years, automatic debugging has been an active research area in software engineering; it has also attracted attention from the AI community. However, existing approaches are mostly experiential; moreover, those model-based approaches are based on abstract models of programs, which lends an expe...