Journal Article10.1016/0020-0190(88)90054-3
Dynamic program slicing
B. Korel,Janusz Laski +1 more
782
TL;DR: A dynamic program slice is an executable subset of the original program that produces the same computations on a subset of selected variables and inputs that can be handled more precisely and the size of slice can be significantly reduced, leading to a finer localization of the fault.
read more
About: This article is published in Information Processing Letters. The article was published on 26 Oct 1988. The article focuses on the topics: Program slicing & Debugging.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey of Program Slicing Techniques.
Frank Tip
- 31 Jul 1994
TL;DR: An overview of the applications of program slicing, which include debugging, program integration, dataflow testing, and software maintenance is presented, including the various general approaches used to compute slices.
A Survey on Software Fault Localization
TL;DR: A comprehensive overview of a broad spectrum of fault localization techniques, each of which aims to streamline the fault localization process and make it more effective by attacking the problem in a unique way is provided.
1.1K
Automated software test data generation
TL;DR: Values of array indexes and pointers are known at each step of program execution; this information is used to overcome difficulties of array and pointer handling to significantly increase the speed of the search process.
1K
PIE: a dynamic failure-based technique
TL;DR: A dynamic technique called PIE (propagation, infection, and execution) is presented for statistically estimating three program characteristics that affect a program's computational behavior that can be used to predict whether faults are likely to be uncovered by software testing.
432
The chaining approach for software test data generation
Roger Ferguson,Bogdan Korel +1 more
TL;DR: The experiments have shown that the chaining approach may significantly improve the chances of finding test data as compared to the existing methods of automated test data generation.
402
References
Program Slicing
TL;DR: Program slicing as mentioned in this paper is a method for automatically decomposing programs by analyzing their data flow and control flow. But it is not a technique for finding statement-minimal slices, as it is in general unsolvable, but using data flow analysis is sufficient to find approximate slices.
3.3K
Certification of programs for secure information flow
TL;DR: This paper presents a mechanism for verifying the secure flow of information through a program that exploits the properties of a lattice structure among security classes and proves that a program cannot cause supposedly nonconfidential results to depend on confidential input data.
Programmers use slices when debugging
TL;DR: The experiment reported here shows that programmers also routinely break programs into one kind of coherent piece which is not coniguous.
854
A fast algorithm for finding dominators in a flowgraph
Thomas Lengauer,Robert E. Tarjan +1 more
TL;DR: A fast algorithm for finding dominators in a flowgraph is presented, which beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tested.
The program dependence graph in a software development environment
Karl J. Ottenstein,Linda M. Ottenstein +1 more
- 25 Apr 1984
TL;DR: The program dependence graph (PDG) may be a suitable internal form that is amenable to incremental data flow analysis, improving response time to the user in an interactive environment and facilitating debugging through data flow anomaly detection.
734