Results 241 to 250 of about 71,487 (291)
Some of the next articles are maybe not open access.
IEEE Transactions on Software Engineering, 1984
Program slicing is a method for automatically decomposing programs by analyzing their data flow and control flow. Starting from a subset of a program's behavior, slicing reduces that program to a minimal form which still produces that behavior. The reduced program, called a ''slice'', is an independent program guaranteed to represent faithfully the ...
openaire +4 more sources
Program slicing is a method for automatically decomposing programs by analyzing their data flow and control flow. Starting from a subset of a program's behavior, slicing reduces that program to a minimal form which still produces that behavior. The reduced program, called a ''slice'', is an independent program guaranteed to represent faithfully the ...
openaire +4 more sources
Information and Software Technology, 1998
Abstract Slicing is a technique to decompose programs based on the analysis of the control and data flow. In the original Weiser's definition, a slice consists of any subset of program statements preserving the behaviour of the original program with respect to a program point and a subset of the program variables (slicing criterion), for any ...
CANFORA G. +2 more
openaire +4 more sources
Abstract Slicing is a technique to decompose programs based on the analysis of the control and data flow. In the original Weiser's definition, a slice consists of any subset of program statements preserving the behaviour of the original program with respect to a program point and a subset of the program variables (slicing criterion), for any ...
CANFORA G. +2 more
openaire +4 more sources
Journal of Systems and Software, 2003
Traditional, syntax-preserving program slicing simplifies a program by deleting components (e.g., statements and predicates) that do not affect a computation of interest. Amorphous slicing removes the limitation to component deletion as the only means of simplification, while retaining the semantic property that a slice preserves the selected behaviour
Harman, M, Binkley, D, Danicic, S
openaire +3 more sources
Traditional, syntax-preserving program slicing simplifies a program by deleting components (e.g., statements and predicates) that do not affect a computation of interest. Amorphous slicing removes the limitation to component deletion as the only means of simplification, while retaining the semantic property that a slice preserves the selected behaviour
Harman, M, Binkley, D, Danicic, S
openaire +3 more sources
Applied Mechanics and Materials, 2012
With the complexity of language structure, the problem of slice’s executability has gradually become people’s focus of attention. The research combines program slicing and path coverage according to their features, makes an attempt to propose the model of executable program slicing, and presents the executable slicing algorithm, which plays an ...
Sheng Hui Shi +2 more
openaire +1 more source
With the complexity of language structure, the problem of slice’s executability has gradually become people’s focus of attention. The research combines program slicing and path coverage according to their features, makes an attempt to propose the model of executable program slicing, and presents the executable slicing algorithm, which plays an ...
Sheng Hui Shi +2 more
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 of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90, 1990
Program slices are useful in debugging, testing, maintenance, and understanding of programs. The conventional notion of a program slice, the static slice , is the set of all statements that might affect the value of a given variable occurrence. In this paper, we investigate the concept of the
Hiralal Agrawal, Joseph R. Horgan
openaire +1 more source
Program slices are useful in debugging, testing, maintenance, and understanding of programs. The conventional notion of a program slice, the static slice , is the set of all statements that might affect the value of a given variable occurrence. In this paper, we investigate the concept of the
Hiralal Agrawal, Joseph R. Horgan
openaire +1 more source
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.
Korel, Bogdan, Laski, Janusz
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.
Korel, Bogdan, Laski, Janusz
openaire +2 more sources
Proceedings of the 17th Annual Conference on Information Technology Education, 2016
Learning programming contains several activities, e.g., syntax and semantics of language, program design, comprehension and debugging. Conventional classroom teaching begins with declarative knowledge concepts followed by program writing skills. As a result students attempt to memorise typical program codes instead of writing a fresh code applying the ...
Kiran L.N Eranki, Kannan M. Moudgalya
openaire +1 more source
Learning programming contains several activities, e.g., syntax and semantics of language, program design, comprehension and debugging. Conventional classroom teaching begins with declarative knowledge concepts followed by program writing skills. As a result students attempt to memorise typical program codes instead of writing a fresh code applying the ...
Kiran L.N Eranki, Kannan M. Moudgalya
openaire +1 more source
ACM SIGSOFT Software Engineering Notes, 2000
Slicing is a well-known program analysis technique for analyzing sequential programs and found useful in debugging, testing and reverse engineering. This paper extends the notion of slicing to concurrent programs with shared memory, interleaving semantics and mutual exclusion.
Mangala Gowri Nanda, S. Ramesh
openaire +1 more source
Slicing is a well-known program analysis technique for analyzing sequential programs and found useful in debugging, testing and reverse engineering. This paper extends the notion of slicing to concurrent programs with shared memory, interleaving semantics and mutual exclusion.
Mangala Gowri Nanda, S. Ramesh
openaire +1 more source