| Hybrid slicing: an approach for refining static slices using dynamic information |
| Full text |
Pdf
(1.14 MB)
|
| Source
|
Foundations of Software Engineering
archive
Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
table of contents
Washington, D.C., United States
Pages: 29 - 40
Year of Publication: 1995
ISBN:0-89791-716-2
Also published in ...
|
|
Authors
|
|
Rajiv Gupta
|
Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA
|
|
Mary Lou Soffa
|
Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 11, Citation Count: 15
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
| |
3
|
Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
|
 |
4
|
|
 |
5
|
|
 |
6
|
|
| |
7
|
|
 |
8
|
|
 |
9
|
John Field , G. Ramalingam , Frank Tip, Parametric program slicing, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.379-392, January 23-25, 1995, San Francisco, California, United States
[doi> 10.1145/199448.199534]
|
| |
10
|
|
| |
11
|
R. Gupta and M.L. Soffa, "Hybrid Slicing: An Approach for Refining Static Slices Using Dynamic Information," Technzcal Report TR- 95-30, University of Pittsburgh, Pittsburgh, June 1995.
|
 |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
J.R. Lyle and M. Weiser, "Automatic Program Bug Location by Program Slicing," Proc. Second IEEE Sympostum on Computers and Applications, pages 877-883, June 1987.
|
 |
16
|
|
 |
17
|
|
| |
18
|
|
| |
19
|
M. Weiser, "Program Slicing," IEEE Transactions on Software Engineering, Vol. SE-10, No. 4, pages 352-357, July 1984.
|
CITED BY 15
|
|
|
|
|
|
|
Akira Nishimatsu , Minoru Jihira , Shinji Kusumoto , Katsuro Inoue, Call-mark slicing: an efficient and economical way of reducing slice, Proceedings of the 21st international conference on Software engineering, p.422-431, May 16-22, 1999, Los Angeles, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|