• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,331
Next 10 →

Precise Dynamic Slicing Algorithms

by Xiangyu Zhang, Rajiv Gupta - IEEE/ACM International Conference on Software Engineering , 2003
"... Dynamic slicing algorithms can greatly reduce the de-bugging effort by focusing the attention of the user on a rele-vant subset of program statements. In this paper we present the design and evaluation of three precise dynamic slicing algorithms called the full preprocessing (FP), no prepro-cessing ..."
Abstract - Cited by 95 (13 self) - Add to MetaCart
Dynamic slicing algorithms can greatly reduce the de-bugging effort by focusing the attention of the user on a rele-vant subset of program statements. In this paper we present the design and evaluation of three precise dynamic slicing algorithms called the full preprocessing (FP), no prepro

Debugging with Dynamic Slicing and Backtracking

by Hiralal Agrawal, Richard A. Demillo, Eugene H. Spafford - Software Practice and Experience , 1993
"... this paper we present a debugging model, based on dynamic program slicing and execution backtracking techniques, that easily lends itself to automation. This model is based on experience with using these techniques to debug software. We also present a prototype debugging tool, SPYDER, that explicitl ..."
Abstract - Cited by 109 (0 self) - Add to MetaCart
this paper we present a debugging model, based on dynamic program slicing and execution backtracking techniques, that easily lends itself to automation. This model is based on experience with using these techniques to debug software. We also present a prototype debugging tool, SPYDER

Application of Dynamic Slicing in Program Debugging

by Bogdan Korel, Jurgen Rilling - In Proceedings of the Third International Workshop on Automatic Debugging (AADEBUG '97), Linkoping , 1997
"... A dynamic program slice is an executable part of a program whose behavior is identical, for the same program input, to that of the original program with respect to a variable(s) of interest at some execution position. In the existing dynamic slicing tools dynamic slices are represented in a textual ..."
Abstract - Cited by 32 (0 self) - Add to MetaCart
A dynamic program slice is an executable part of a program whose behavior is identical, for the same program input, to that of the original program with respect to a variable(s) of interest at some execution position. In the existing dynamic slicing tools dynamic slices are represented in a textual

Hierarchical dynamic slicing

by Tao Wang, Abhik Roychoudhury - in ACM International Symposium on Software Testing and Analysis (ISSTA , 2007
"... Dynamic slicing is a widely used technique for program analysis, debugging, and comprehension. However, the reported slice is often too large to be inspected by the programmer. In this work, we address this deficiency by hierarchically applying dynamic slicing at various levels of granularity. The b ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
Dynamic slicing is a widely used technique for program analysis, debugging, and comprehension. However, the reported slice is often too large to be inspected by the programmer. In this work, we address this deficiency by hierarchically applying dynamic slicing at various levels of granularity

Dynamic Program Slicing

by Hiralal Agrawal, Joseph R. Horgan , 1990
"... The conventional notion of a program slice---the set of all statements that might affect the value of a variable occurrence---is totally independent of the program input values. Program debugging, however, involves analyzing the program behavior under the specific inputs that revealed the bug. In th ..."
Abstract - Cited by 415 (7 self) - Add to MetaCart
. In this paper we address the dynamic counterpart of the static slicing problem---finding all statements that really affected the value of a variable occurrence for the given program inputs. Several approaches for computing dynamic slices are examined. The notion of a Dynamic Dependence Graph and its use

A Survey of Program Slicing Techniques

by F. Tip - JOURNAL OF PROGRAMMING LANGUAGES , 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract - Cited by 790 (10 self) - Add to MetaCart
in 1979. Since then, various slightly different notions of program slices have been proposed, as well as a number of methods to compute them. An important distinction is that between a static and a dynamic slice. The former notion is computed without making assumptions regarding a program's input

Dynamic Slicing of Aspect-Oriented Programs

by Durga Prasad Mohapatra, Madhusmita Sahu , 2007
"... dynamic dependence slicing tool (DDST), trace file based dynamic slicing (TBDS) algorithm ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
dynamic dependence slicing tool (DDST), trace file based dynamic slicing (TBDS) algorithm

Abstract Pruning Dynamic Slices With Confidence

by Xiangyu Zhang, Neelam Gupta, Rajiv Gupta
"... Given an incorrect value produced during a failed program run (e.g., a wrong output value or a value that causes the program to crash), the backward dynamic slice of the value very frequently captures the faulty code responsible for producing the incorrect value. Although the dynamic slice often con ..."
Abstract - Add to MetaCart
Given an incorrect value produced during a failed program run (e.g., a wrong output value or a value that causes the program to crash), the backward dynamic slice of the value very frequently captures the faulty code responsible for producing the incorrect value. Although the dynamic slice often

Dynamic Slicing of Object-Oriented Programs

by Jianjun Zhao , 1998
"... Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may affect the value of variable v at some point p, and a dynamic slice consists only of statements that influence the value of ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may affect the value of variable v at some point p, and a dynamic slice consists only of statements that influence the value

Dynamic Slicing on Java Bytecode Traces

by Tao Wang, Abhik Roychoudhury
"... Dynamic slicing is a well-known technique for program analysis, debugging and understanding. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some variables ’ occurrences when P is executed with I. In this paper, we develop a dynamic slici ..."
Abstract - Cited by 16 (2 self) - Add to MetaCart
Dynamic slicing is a well-known technique for program analysis, debugging and understanding. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some variables ’ occurrences when P is executed with I. In this paper, we develop a dynamic
Next 10 →
Results 1 - 10 of 1,331
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University