Results 271 to 280 of about 13,970 (291)
Some of the next articles are maybe not open access.
Proceedings Fifth International Workshop on Program Comprehension. IWPC'97, 2002
This paper introduces amorphous program slicing. Like traditional slicing, amorphous slicing simplifies a program while preserving a projection of its semantics. Unlike traditional slicing, amorphous slicing may make use of any simplifying transformation which preserves this semantic projection, thereby improving upon the simplification power of ...
Harman, Mark, Danicic, Sebastian
openaire +1 more source
This paper introduces amorphous program slicing. Like traditional slicing, amorphous slicing simplifies a program while preserving a projection of its semantics. Unlike traditional slicing, amorphous slicing may make use of any simplifying transformation which preserves this semantic projection, thereby improving upon the simplification power of ...
Harman, Mark, Danicic, Sebastian
openaire +1 more source
Proceedings 9th International Workshop on Program Comprehension. IWPC 2001, 2002
Program slicing is useful for addressing many software engineering problems as it allows focusing attention on just the relevant part of the program. However, this part could still be huge and difficult to comprehend and thus diminish usefulness of program slicing. This is a serious problem in working with legacy codes for scientific computing.
Y. Deng, S. Kothari, Y. Namara
openaire +1 more source
Program slicing is useful for addressing many software engineering problems as it allows focusing attention on just the relevant part of the program. However, this part could still be huge and difficult to comprehend and thus diminish usefulness of program slicing. This is a serious problem in working with legacy codes for scientific computing.
Y. Deng, S. Kothari, Y. Namara
openaire +1 more source
Proceedings of 1994 IEEE Symposium on Visual Languages, 2002
Program slicing is an automatic technique for determining which code in a program is relevant to a particular computation. Slicing has been applied in many areas, including program understanding, debugging, and maintenance. However, little attention has been paid to suitable interfaces for exploring program slices.
T. Ball, S.G. Eick
openaire +1 more source
Program slicing is an automatic technique for determining which code in a program is relevant to a particular computation. Slicing has been applied in many areas, including program understanding, debugging, and maintenance. However, little attention has been paid to suitable interfaces for exploring program slices.
T. Ball, S.G. Eick
openaire +1 more source
RESTRUCTURING PROGRAMS THROUGH PROGRAM SLICING
International Journal of Software Engineering and Knowledge Engineering, 1994Software restructuring is recognized as a promising method to improve logical structure and understandability of a software system which is composed of modules with loosely-coupled elements. In this paper, we present methods of restructuring an ill-structured module at the software maintenance phase.
HYEON SOO KIM +2 more
openaire +1 more source
IEEE Transactions on Software Engineering, 1987
This correspondence points out some of the problems with Weiser's algorithm [5] for computing program slices. Corrections are made to Weiser's algorithm. It is shown how Weiser's algorithm can be amended to handle loops. Advantages of the Bergeretti and Carre's approach [1] are discussed.
H.K.N. Leung, H.K. Reghbati
openaire +1 more source
This correspondence points out some of the problems with Weiser's algorithm [5] for computing program slices. Corrections are made to Weiser's algorithm. It is shown how Weiser's algorithm can be amended to handle loops. Advantages of the Bergeretti and Carre's approach [1] are discussed.
H.K.N. Leung, H.K. Reghbati
openaire +1 more source
[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track, 2003
An original, theoretical definition of denotational program slicing is presented. Program slicing is a method for automatic program decomposition that is based exclusively on control and data-flow information. Denotational slicing makes use of the functional semantics of a particular programming language and defines the various domains and appropriate ...
openaire +1 more source
An original, theoretical definition of denotational program slicing is presented. Program slicing is a method for automatic program decomposition that is based exclusively on control and data-flow information. Denotational slicing makes use of the functional semantics of a particular programming language and defines the various domains and appropriate ...
openaire +1 more source
Beyond traditional program slicing
ACM SIGSOFT Software Engineering Notes, 1996Traditional program slices are based on variables and statements. Slices consist of statements that potentially affect (or are affected by) the value of a particular variable at a given statement. Two assumptions are implicit in this definition: 1) that variables and statements are concepts of the programming language in which the program is written ...
Anthony M. Sloane, Jason Holdsworth
openaire +1 more source
Structured Dynamic Program Slicing
2011 International Conference on Computer and Management (CAMAN), 2011Program slicing has been proven to be an effective approach to aid program understanding in recent years. A dynamic program slicer computes the set of instructions that may have affected or been affected by the given variable in certain location of the instruction stream.
Ruoyu Zhang +3 more
openaire +1 more source
Dynamic program slicing methods
Information and Software Technology, 1998Abstract A dynamic program slice is that part of a program that “affects” the computation of a variable of interest during program execution on a specific program input. Dynamic program slicing refers to a collection of program slicing methods that are based on program execution and may significantly reduce the size of a program slice because run ...
Bogdan Korel, Jurgen Rilling
openaire +1 more source
1993
This paper extends the notion of slicing, which was originally proposed and studied for sequential programs, to concurrent programs and presents a graph-theoretical approach to slicing concurrent programs. In addition to the usual control and data dependences proposed and studied for sequential programs, the paper introduces three new types of primary ...
openaire +1 more source
This paper extends the notion of slicing, which was originally proposed and studied for sequential programs, to concurrent programs and presents a graph-theoretical approach to slicing concurrent programs. In addition to the usual control and data dependences proposed and studied for sequential programs, the paper introduces three new types of primary ...
openaire +1 more source