Sciweavers

53 search results - page 4 / 11
» On Slicing Programs with Jump Statements
Sort
View
INFSOF
1998
73views more  INFSOF 1998»
13 years 6 months ago
Restructuring programs by tucking statements into functions
Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by ...
Arun Lakhotia, Jean-Christophe Deprez
JUCS
2007
80views more  JUCS 2007»
13 years 6 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
AADEBUG
2005
Springer
14 years 7 days ago
Experimental evaluation of using dynamic slices for fault location
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
Xiangyu Zhang, Haifeng He, Neelam Gupta, Rajiv Gup...
ICSM
2008
IEEE
14 years 1 months ago
Dynamic slicing of multithreaded programs for race detection
Prior work has shown that computing dynamic slices of erroneous program values can greatly assist in locating the root cause of erroneous behavior by identifying faulty statements...
Sriraman Tallam, Chen Tian, Rajiv Gupta
ENTCS
2006
102views more  ENTCS 2006»
13 years 6 months ago
Slicing XML Documents
Program slicing is a well-known technique to extract the program statements that (potentially) affect the values computed at some point of interest. In this work, we introduce a n...
Josep Silva