Sciweavers

53 search results - page 7 / 11
» On Slicing Programs with Jump Statements
Sort
View
IWPC
2009
IEEE
14 years 1 months ago
A plethora of paths
A common static software bug detection technique is to use path simulation. Each execution path is simulated using symbolic variables to determine if any software errors could occ...
Eric Larson
KBSE
2005
IEEE
14 years 8 days ago
Locating faulty code using failure-inducing chops
Software debugging is the process of locating and correcting faulty code. Prior techniques to locate faulty code either use program analysis techniques such as backward dynamic pr...
Neelam Gupta, Haifeng He, Xiangyu Zhang, Rajiv Gup...
ISSTA
2009
ACM
14 years 1 months ago
Memory slicing
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
Bin Xin, Xiangyu Zhang
INFSOF
2006
73views more  INFSOF 2006»
13 years 6 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
FAC
2008
100views more  FAC 2008»
13 years 6 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois