Sciweavers

67 search results - page 2 / 14
» Bug Classification Using Program Slicing Metrics
Sort
View
SIGSOFT
2007
ACM
16 years 15 days ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
ASPLOS
2006
ACM
15 years 5 months ago
HeapMD: identifying heap-based bugs using anomaly detection
We present the design, implementation, and evaluation of HeapMD, a dynamic analysis tool that finds heap-based bugs using anomaly detection. HeapMD is based upon the observation ...
Trishul M. Chilimbi, Vinod Ganapathy
CHI
2009
ACM
16 years 10 days ago
Finding causes of program output with the Java Whyline
Debugging and diagnostic tools are some of the most important software development tools, but most expect developers choose the right code to inspect. Unfortunately, this rarely o...
Andrew Jensen Ko, Brad A. Myers
111
Voted
SIGSOFT
2006
ACM
16 years 15 days ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
LISP
2008
96views more  LISP 2008»
14 years 11 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal