Interprocedural Dynamic Slicing Applied to Algorithmic Debugging PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Interprocedural Dynamic Slicing Applied to Algorithmic Debugging PDF full book. Access full book title Interprocedural Dynamic Slicing Applied to Algorithmic Debugging by Mariam Kamkar. Download full books in PDF and EPUB format.
Author: Mariam Kamkar Publisher: ISBN: Category : Debugging in computer science Languages : en Pages : 21
Book Description
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."
Author: Mariam Kamkar Publisher: ISBN: Category : Debugging in computer science Languages : en Pages : 21
Book Description
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."
Author: Mariam Kamkar Publisher: ISBN: 9789178710652 Category : Computer programs Languages : en Pages : 190
Book Description
Abstract: "The needs of maintenance and modification demand that large programs be decomposed into manageable parts. Program slicing is one method for such decomposition. A program slice with respect to a specified variable at some program point consists of those parts of the program that may directly or indirectly affect the value of that variable at the particular program point. This is useful for understanding dependences within programs. A static program slice is computed using static data and control flow analysis and is valid for all possible executions of the program. Static slices are often imprecise, i.e., they contain unnecessarily large parts of the program. Dynamic slices, however, are precise but are valid only for a single execution of the program. Interprocedural dynamic slices can be computed for programs with procedures, and these slices consists of all executed call statements which are relevant for the computation of the specified variable at the specified program point. This thesis presents the first technique for interprocedural dynamic slicing which deals with procedures/functions at the abstract level. This technique first generates summary information for each procedure call (or function application), then represents a program as a summary graph of dynamic dependences. A slice on this graph consists of vertices for all procedure calls of the program that affect the value of a given variable at the specified program point. The amount of information recorded by this method is considerably less than what is needed by previous methods for dynamic slicing, since it only depends on the size of the program's execution tree, i.e., the number of executed procedure calls, which is smaller than a trace of all executed statements. The interprocedural dynamic slicing method is applicable in at least two areas, program debugging and data flow testing. Both of these applications can be made more effective when using dynamic dependence information collected during program execution. We conclude that the interprocedural dynamic slicing method is superior to other slicing methods when precise dependence information for a specific set of input data values at the procedural abstraction level is relevant."
Author: Peter A. Fritzson Publisher: Springer Science & Business Media ISBN: 9783540574170 Category : Computers Languages : en Pages : 392
Book Description
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.
Author: Shashank Mouli Satapathy Publisher: LAP Lambert Academic Publishing ISBN: 9783659670626 Category : Languages : en Pages : 68
Book Description
A dynamic program slice is that part of a program that affects the computation of a variable of interest during program execution on a specific program input. Dynamic program slicing was originally proposed only for program debugging. It is usually accepted that understanding and debugging of multithreaded and distributed programs are much harder compared to those of sequential programs. Different types of dynamic program slices, together with algorithms to compute them have been proposed in the literature. Most of the existing algorithms for finding slices of distributed programs use trace files and are not efficient in terms of time and space complexity. Some existing algorithms also use a complex intermediate representation graph by adding a no of different types of dependency edges and by traversing the dependency graph. Therefore, there is a need for development of efficient algorithms for distributed programs and to reduce the complex structure of the dependency graph. This work uses basic concepts of the inter-procedural dynamic slicing algorithm and remodels it to extract slices of distributed programs with introduction of some additional data structures.
Author: Shmuel Ur Publisher: Springer ISBN: 3540326057 Category : Computers Languages : en Pages : 275
Book Description
This book constitutes the refereed post-proceedings of the First International Conference on Hardware Verification, Software Testing, and PADTAD held in November 2005. The conference combines the sixth IBM Verification Workshop, the fourth IBM Software Testing Workshop, and the third PADTAD (Parallel and Distributed Systems: Testing and Debugging) Workshop. The 14 revised full papers presented together with three invited contributions were carefully reviewed and selected from 31 submissions. The papers address all current issues in hardware/software verification, software testing, and testing of parallel and concurrent applications.
Author: Bhaskar Airody Karanth Publisher: ISBN: Category : Algorithms Languages : en Pages : 0
Book Description
Program slicing is a program decomposition technique that transforms a large program into a smaller one that contains only statements relevant to the computation of a selected function. Applications of program slicing can be found in software testing, debugging and maintenance where program slicing essentially reduces the amount of data that has to be analyzed in order to comprehend a program or parts of its functionality. In this thesis, two program slicing algorithms based on the notion of removable blocks are presented and they are (1) a general static program slicing algorithm and (2) criterion based hybrid program slicing algorithm. The thesis introduced new syntax tree representation using removable blocks and theorized a new navigation technique for the same. The new static slicing algorithm combined with the enhanced dynamic slicing algorithm is used to derive the criterion based hybrid slicing algorithm. The hybrid program slicing algorithm allows the user to define the range of accuracy between static and dynamic program slicing. These algorithms compute slices that are executable for structured and object-oriented programs. It uses the executable property of new static slicing to reduce the input source code to dynamic slicing to save the time and space. The introduced program slicing approaches are part of M[barbelow]ontreal O[barbelow]bject-O[barbelow]riented S[barbelow]licing E[barbelow]nvironment (MOOSE). MOOSE utilizes the information derived from the program slicing algorithms to enhance the functionality and usability of the framework. The preliminary tests with the basic hybrid program slicing algorithm indicate that hybrid program slicing can reduce the algorithmic time and space for the slice computation as compared to the dynamic program slicing.
Author: Maurice Bruynooghe Publisher: Springer ISBN: Category : Computers Languages : en Pages : 512
Book Description
"This volume contains the papers accepted for presentation at the Fourth International Symposium on Programming Language Implementation and Logic Programming (PLILP '92) held in Leuven, Belgium, August 26-28, 1992. Theaim of the symposium was to explore new declarative concepts, methods and techniques relevant for implementation of all kinds of programming languages, whether algorithmic or declarative. The symposium gathered researchers from the fields of algorithmic programming languages as well as logic, functional, and object-oriented programming. The topics discussed in the volume include: - Declarative implementation techniques; - Implementation of declarative concepts and modules; - Compiler specification and construction; - Program transformation; - Programming environments for declarative languages; - Amalgamation of logic programming with algorithmic, functional, or object-oriented techniques; - Executable specification."--PUBLISHER'S WEBSITE.
Author: Oskar Nierstrasz Publisher: Springer ISBN: 3540481664 Category : Computers Languages : en Pages : 536
Book Description
For the second time, the European Software Engineering Conference is being held jointly with the ACM SIGSOFT Symposium on the Foundations of Software Engine- ing (FSE). Although the two conferences have different origins and traditions, there is a significant overlap in intent and subject matter. Holding the conferences jointly when they are held in Europe helps to make these thematic links more explicit, and enco- ages researchers and practitioners to attend and submit papers to both events. The ESEC proceedings have traditionally been published by Springer-Verlag, as they are again this year, but by special arrangement, the proceedings will be distributed to members of ACM SIGSOFT, as is usually the case for FSE. ESEC/FSE is being held as a single event, rather than as a pair of collocated events. Submitted papers were therefore evaluated by a single program committee. ESEC/FSE represents a broad range of software engineering topics in (mainly) two continents, and consequently the program committee members were selected to represent a spectrum of both traditional and emerging software engineering topics. A total of 141 papers were submitted from around the globe. Of these, nearly half were classified as research - pers,aquarterasexperiencepapers,andtherestasbothresearchandexperiencepapers. Twenty-nine papers from five continents were selected for presentation and inclusion in the proceedings. Due to the large number of industrial experience reports submitted, we have also introduced this year two sessions on short case study presentations.
Author: Mariam Kamkar
Author: Mariam Kamkar
Author: Mariam Kamkar
Author: Peter A. Fritzson
Author: Shashank Mouli Satapathy
Author: Shmuel Ur
Author: Bhaskar Airody Karanth
Author: Maurice Bruynooghe
Author: Oskar Nierstrasz
Author: 
Author: