Results 261 to 270 of about 15,494 (304)
Some of the next articles are maybe not open access.
Information Processing Letters, 1988
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. It differs from the static slice [\textit{M. Weiser}, IEEE Trans. Software Eng. SE-10, 352-357 (1984; Zbl 0552.68004)] in that it is entirely defined on the basis of a computation.
Bogdan Korel, Janusz W. Laski
openaire +2 more sources
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. It differs from the static slice [\textit{M. Weiser}, IEEE Trans. Software Eng. SE-10, 352-357 (1984; Zbl 0552.68004)] in that it is entirely defined on the basis of a computation.
Bogdan Korel, Janusz W. Laski
openaire +2 more sources
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.
Hareton K. N. Leung, Hassan 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.
Hareton K. N. Leung, Hassan K. Reghbati
openaire +1 more source
Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95, 1995
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing slices directly from semantic specifications. These algorithms are based on combining the notion of dynamic dependence tracking in term rewriting systems with a program ...
John Field, G. Ramalingam, Frank Tip
openaire +1 more source
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing slices directly from semantic specifications. These algorithms are based on combining the notion of dynamic dependence tracking in term rewriting systems with a program ...
John Field, G. Ramalingam, Frank Tip
openaire +1 more source
2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation, 2009
Unexpected model behaviors need explanation, so valid behaviors can be separated from errors. Understanding unexpected behavior requires accumulation of insight into the behavior and the conditions under which it arises. Explanation Exploration (EE) has been presented to gather insight into unexpected behaviors.
Ross Gore, Paul F. Reynolds Jr.
openaire +1 more source
Unexpected model behaviors need explanation, so valid behaviors can be separated from errors. Understanding unexpected behavior requires accumulation of insight into the behavior and the conditions under which it arises. Explanation Exploration (EE) has been presented to gather insight into unexpected behaviors.
Ross Gore, Paul F. Reynolds Jr.
openaire +1 more source
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.
Yunbo Deng +2 more
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.
Yunbo Deng +2 more
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.
Thomas Ball 0001, Stephen 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.
Thomas Ball 0001, Stephen G. Eick
openaire +1 more source
Proceedings Sixth Asia Pacific Software Engineering Conference (ASPEC'99) (Cat. No.PR00509), 2003
VRML (Virtual Reality Modeling Language) is a programming language with promising effectiveness in describing cyberspace because of its real-time expressive power for 3D objects via the Internet. Concerning its 3D design, CAD tools can support static feature developments effectively, but currently, developments of dynamic features such as animation ...
Hiroshi Maruyama, Keijiro Araki
openaire +1 more source
VRML (Virtual Reality Modeling Language) is a programming language with promising effectiveness in describing cyberspace because of its real-time expressive power for 3D objects via the Internet. Concerning its 3D design, CAD tools can support static feature developments effectively, but currently, developments of dynamic features such as animation ...
Hiroshi Maruyama, Keijiro Araki
openaire +1 more source
Program slicing in understanding of large programs
Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242), 2002Program slicing transforms a large program into a smaller one that contains only statements relevant to the computation of a given function. It has been shown that program slicing can be useful in program understanding. Traditionally, program slices are represented in the textual form.
Bogdan Korel, Juergen Rilling
openaire +1 more source
Proceedings of the Tenth International Symposium on Hardware/Software Codesign. CODES 2002 (IEEE Cat. No.02TH8627), 2002
Program slicing is a software analysis technique that computes the set of operations in a program that may affect the computation at a particular operation. Interprocedural slicing techniques have separately addressed concurrent programs and hardware description languages.
openaire +1 more source
Program slicing is a software analysis technique that computes the set of operations in a program that may affect the computation at a particular operation. Interprocedural slicing techniques have separately addressed concurrent programs and hardware description languages.
openaire +1 more source