Sciweavers

617 search results - page 27 / 124
» Debugging distributed programs using controlled re-execution
Sort
View
SIGSOFT
1994
ACM
14 years 3 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
ICSE
2010
IEEE-ACM
14 years 3 months ago
Runtime repair of software faults using event-driven monitoring
In software with emergent properties, despite the best efforts to remove faults before execution, there is a high likelihood that faults will occur during runtime. These faults c...
Chris Lewis 0002, Jim Whitehead
ISSRE
2006
IEEE
14 years 4 months ago
Memoized Forward Computation of Dynamic Slices
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
Wes Masri, Nagi Nahas, Andy Podgurski
KBSE
2005
IEEE
14 years 4 months ago
Automated path generation for software fault localization
Localizing the cause(s) of an observable error lies at the heart of program debugging. Fault localization often proceeds by comparing the failing program run with some “successf...
Tao Wang, Abhik Roychoudhury
EMSOFT
2001
Springer
14 years 3 months ago
An Implementation of Scoped Memory for Real-Time Java
Abstract. This paper presents our experience implementing the memory management extensions in the Real-Time Specification for Java. These extensions are designed to given real-tim...
William S. Beebee, Martin C. Rinard