Searching for authors named "Hiralal Agrawal" – sorted by Relevance.
-
Dominators, Super Blocks, and Program Coverage
- In this paper we present techniques to #nd subsets of nodes of a #owgraph that satisfy the following property: A test set that exercises all nodes in a subset exercises all nodes in the #owgraph. Analogous techniques to #nd subsets of edges are also proposed. These techniques may be used to signi#ca
- Cited by 9 (0 self) – Add To MetaCart
-
On Slicing Programs with Jump Statements
- Program slices have potential uses in many software engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump statements. Two similar algorithms were proposed recently to alleviate this problem. Both require the flowgraph and the
- Cited by 56 (0 self) – Add To MetaCart
-
Towards Automatic Debugging of Computer Programs
- Programmers spend considerable time debugging code. Symbolic debuggers provide some help but the task still remains complex and difficult. Other than breakpoints and tracing, these tools provide little high level help. Programmers must perform many tasks manually that the tools could perform automat
- Cited by 30 (3 self) – Add To MetaCart
-
Dynamic Program Slicing
- 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
- Cited by 227 (6 self) – Add To MetaCart
-
Fault Localization using Execution Slices and Dataflow Tests
- Finding a fault in a program is a complex process which involves understanding the program's purpose, structure, semantics, and the relevant characteristics of failureproducing tests. We describeatool which supports execution slicing and dicing based on test cases. We report the results of an experi
- Cited by 30 (1 self) – Add To MetaCart
-
Debugging with Dynamic Slicing and Backtracking
- 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
- Cited by 77 (0 self) – Add To MetaCart
-
Efficient Debugging with Slicing and Backtracking
- Programmers spend considerable time debugging code. Several tools are available to help them in this task, varying from hexadecimal dumps of program state to window- and mouse-based interactive debuggers, but the task still remains complex and difficult. Most of these conventional debuggers provid
- Cited by 6 (1 self) – Add To MetaCart
-
Incremental Regression Testing
- The purpose of regression testing is to ensure that bug #xes and new functionality introduced in a new version of a software do not adversely a#ect the correct functionality inheritedfrom the previous version. This paper explores e#cient methods of selecting small subsets of regression test sets tha
- Cited by 58 (2 self) – Add To MetaCart
-
Dynamic Slicing in the Presence of Unconstrained Pointers
- Program slices are useful in debugging. Most work on program slicing to date has concentrated on finding slices of programs involving only scalar variables. Pointers and composite variables do not lend themselves well to static analysis, especially when the language involved is not strongly-typed. W
- Cited by 52 (3 self) – Add To MetaCart
-
An execution backtracking approach to program debugging
- An execution backtracking facility in interactive source debuggers allows users to mirror their thought processes while debugging — working backwards from the location where an error is manifested and determining the conditions under which the error occurred. Such a facility also allows a user to ch
- Cited by 21 (5 self) – Add To MetaCart

