Download or read book Generalized Algorithmic Debugging written by N. Shahmehri and published by . This book was released on 1991 with total page 189 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "This thesis presents a novel method for semi-automatic program debugging -- the Generalized Algorithmic Debugging Technique, GADT. The notion of declarative algorithmic debugging was first introduced for logic programming. However, this is the first algorithmic debugging method based on the principle of declarative debugging which can handle the debugging of programs written in an imperative language including loops and side-effects. In order to localize a bug, the debugging algorithm incrementally acquires knowledge about the debugged program. The knowledge is supplied by the user. The algorithm terminates when the bug has been localized to within the body of a procedure or an explicit loop. The generalized algorithmic debugging method uses program transformation and program flow analysis techniques to transform the subject program to a largely side-effect-free internal form which is used for bug localization. Thus, this algorithm defines two views of a program: (1) The user view which is the original program with side-effects and (2) the transformed view which is the transformed side-effect-free version of the original program. Transparent program debugging is supported by maintaining a mapping between these two views. The bug localization algorithm works on the transformed version, whereas user interactions are defined in terms of the user view. We have presented a general technique which it [sic] is not based on any ad-hoc assumptions about the subject program. The flexibility of this method has made it possible to further improve the bug localization algorithm by employing a number of other techniques, i.e. program slicing and test database lookup, thus increasing the degree of automation provided by GADT. These extensions are topics for ongoing research projects and future work. A survey and evaluation of a number of automated debugging systems and the techniques behind these systems are also presented. We have introduced several criteria for comparing these techniques with GADT. A prototype implementation of the generalized algorithmic debugging technique has been carried out to verify its feasibility, and to provide feedback for further refinement of the method. This has already resulted in a more efficient set of transformations, described in the thesis, compared to the initial prototype."

Download or read book Generalized Algorithmic Debugging written by and published by . This book was released on 1991 with total page 189 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Generalized Algorithmic Debugging and Testing written by Linkoeping University. Dept. of Computer and Information Science and published by . This book was released on 1990 with total page 10 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Automated and Algorithmic Debugging written by Peter A. Fritzson and published by Springer Science & Business Media. This book was released on 1993-11-10 with total page 392 pages. Available in PDF, EPUB and Kindle. Book excerpt: Debugging has always been a costly part of software development, and many attempts have been made to provide automatic computer support for this task.Automated debugging has seen major develoments over the last decade. Onesuccessful development is algorithmic debugging, which originated in logic programming but was later generalized to concurrent, imperative, and lazy functional languages. Important advances have also been made in knowledge-based program debugging, and in approaches to automated debugging based on static and dynamic program slicing based on dataflow and dependence analysis technology. This is the first collected volume of papers on automated debugging and presents latest developments, tutorial papers, and surveys.

Download or read book Automated and Algorithmic Debugging written by Peter A. Fritzson and published by Springer. This book was released on 1993-11-10 with total page 367 pages. Available in PDF, EPUB and Kindle. Book excerpt: Debugging has always been a costly part of software development, and many attempts have been made to provide automatic computer support for this task.Automated debugging has seen major develoments over the last decade. Onesuccessful development is algorithmic debugging, which originated in logic programming but was later generalized to concurrent, imperative, and lazy functional languages. Important advances have also been made in knowledge-based program debugging, and in approaches to automated debugging based on static and dynamic program slicing based on dataflow and dependence analysis technology. This is the first collected volume of papers on automated debugging and presents latest developments, tutorial papers, and surveys.

Download or read book Automated and Algorithmic Debugging written by Peter A. Fritzson and published by . This book was released on 2014-09-01 with total page 388 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Interprocedural Dynamic Slicing Applied to Algorithmic Debugging written by Mariam Kamkar and published by . This book was released on 1991 with total page 21 pages. Available in PDF, EPUB and Kindle. Book excerpt: A program slice can be produced from the interprocedural slice on the graph if a suitable definition of control dependency is used when the summary graph is constructed. The interprocedural dynamic slicing introduced in this paper is being used to improve the bug localization properties of the Generalized Algorithmic Debugging Technique, a method for semi-automatic bug localization of programs."

Download or read book Algorithmic Program Debugging written by Ehud Y. Shapiro and published by MIT Press (MA). This book was released on 2004-07-01 with total page 231 pages. Available in PDF, EPUB and Kindle. Book excerpt: Shapiro productively combines elements of programming languages, environments, logic, and inductive inference to produce effective debugging aids. The author's use of the PROLOG language provides an efficient implementation of the debugging algorithms.

Download or read book Focusing the Bug Localization Process in Algorithmic Debugging Through Program Slicing written by Linkoeping University. Dept. of Computer and Information Science and published by . This book was released on 1990 with total page 11 pages. Available in PDF, EPUB and Kindle. Book excerpt: This improved method is also applicable to imperative programs with side-effects, since we use a version of algorithmic debugging which has been generalized to imperative languages [Shahmehri, Fritzson-89]."

Download or read book Algorithmic Debugging for Locally Defined Functions written by Dr. Yong Luo and published by . This book was released on 2007 with total page 28 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Concurrent Algorithmic Debugging written by Yossi Lichtenstein and published by . This book was released on 1987 with total page 32 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Algorithmic Program Debugging written by Ehud Yehuda Shapiro and published by . This book was released on 1982 with total page 394 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Algorithmic Debugging and Trusted Functions written by Yong Luo and published by . This book was released on 2007 with total page 16 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Using Assertions in Declarative and Operational Models for Automated Debugging written by Linkoeping University. Dept. of Computer and Information Science and published by . This book was released on 1993 with total page 12 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "The paper presents an improved method for semi- automatic bug localization, by extending the Generalized Algorithmic Debugging Technique, GADT [Fritzson, et.al-91], which uses declarative assertions about program units such as procedures, with operational assertions about program behavior. For example, functional properties are best expressed through declarative assertions about procedure units, whereas order-dependent properties such as race conditions in parallel processing, or sequencing constraints in general, are more easily expressed using operational semantics. A powerful assertion language, called FORMAN, has been developed to this end. Such assertions can be collected into assertion-libraries, which can greatly increase the degree of automation in bug localization. The long-range goal of this work is a semi-automatic debugging and testing system which can be used during large- scale program development of non-trivial programs. The need for such automated debugging support will increase as applications on parallel architectures become more prevalent, since such programs are both harder to write and to debug, partly because of non-sequential execution semantics. Our previously developed GADT method was the first declarative algorithmic debugging technique for procedural imperative languages with side-effects. GADT is generally applicable to procedural languages, and is not dependent on any ad hoc assumptions regarding the subject program. The original form of algorithmic debugging, introduced by Shapiro [Shapiro-82], is however limited to small Prolog programs without side-effects. Another drawback of the original method is the large number of interactions with the user during bug localization. To our knowledge, the extended GADT presented here is the first method which uses powerful operational assertions in algorithmic debugging. In addition to providing support for local-level bug localization within procedures (which is not handled well by basic algorithmic debugging), the operational assertions reduce the number of irrelevant questions to the programmer during bug localization, thus further improving bug localization. Previously, we have enhanced the bug localization properties of GADT, using lookup in a category partition testing database. In addition, we use program slicing, a data flow analysis technique, to dynamically compute which parts of the program are relevant for the search. A prototype of the GADT has been implemented in Pascal, supporting debugging in a subset of Pascal. An interpreter of FORMAN assertions has also been implemented in Pascal. During bug localization, both types of assertions are evaluated on execution traces."

Download or read book Abstract Algorithmic Debugging written by Yossi Lichtenstein and published by . This book was released on 1987 with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Algorithmic Debugging of Flat Concurrent Prolog written by Yossi Lichtenstein and published by . This book was released on 1987 with total page 110 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Programming Language Implementation and Logic Programming written by Pierre Deransart and published by Springer Science & Business Media. This book was released on 1990-08-08 with total page 420 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume consists of the papers accepted for presentation at the second international workshop on Programming Language Implementation and Logic Programming (PLILP '90) held in Linköping, Sweden, August 20-22, 1990. The aim of the workshop was to identify concepts and techniques used both in implementation of programming languages, regardless of the underlying programming paradigm, and in logic programming. The intention was to bring together researchers working in these fields. The volume includes 26 selected papers falling into two categories. Papers in the first category present certain ideas from the point of view of a particular class of programming languages, or even a particular language. The ideas presented seem to be applicable in other classes of languages. Papers in the second category directly address the problem of integration of various programming paradigms. The proceedings of the predecessor workshop PLILP '88, held in Orléans, France, May 16-18, 1988, are available as Lecture Notes in Computer Science, Vol. 348.