Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

Syntax-Directed Program Slicing

Nor Adnan Yahaya, (1995) Syntax-Directed Program Slicing. Malaysian Journal of Computer Science, 8 (2). pp. 130-150. ISSN 0127-9084

Full text not available from this repository.

Affiliations

Universiti Sains Malaysia, School of Computer Science

Abstract

The slicing algorithm presented is syntax-directed in the sense that it assumes a program representation that provides detailed syntactic information of the program to be sliced. This approach differs from the traditional ones that offer slicing algorithms based on the control flow graph of the program. One major advantage of the approach is that a program slice, which is the resulting subset ofthe original program, can easily be generated as an independent syntactically correct program. The syntax-directed algorithm has been implemented for slicing PASCAL-S on DEC VAX-11/780 computer.

Item Type:Journal
Additional Information:This note was added by the search_and_modify.pl script.
Keywords:Program slicing; Syntax-directed program slicing; Debugging.
Subjects:Q Science, Computer Science
ID Code:772

M. D. Weiser, “Programmers Use Slices When Debugging”. Communications of the ACM, Vol. 25, No. 7, July 1982, pp. 446-452.

M. D. Weiser, “Reconstructing Sequential Behavior from Parallel Behavior Projection”. Information Processing Letters, Vol. 17, No. 3, October 1983, pp. 129-135.

K. B. Gallagher and J. R. Lyle, “Using Program Slicing in Software Maintenance” IEEE Transactions on Software Engineering, Vol. 1 7, No. 8, 1991 , pp. 751-761.

N. A. Yahaya, “A First Step towards a Systematic Program Understanding Method”, in First National Computer Science Conference, Kuala Lumpur, January 1989, pp. 218-231.

M. D. Weiser, “Program Slicing”. IEEE Transactions on Software Engineering, Vol. 10, No. 4, 1984, pp. 352-357.

B. K. Rosen, “High-Level Data Flow Analysis”. Communications of the ACM, Vol. 20, No. 10, 1977, pp. 712-724.

J. M. Barth, “A Practical Interprocedural Dataflow Algorithms”. Communications of the CACM, Vol. 21, No. 9, 1978, pp. 724-736.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.