Sciweavers

166 search results - page 5 / 34
» Application of redundant computation in program debugging
Sort
View
ACTAC
2002
102views more  ACTAC 2002»
14 years 11 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
HOTOS
2007
IEEE
15 years 3 months ago
Relaxed Determinism: Making Redundant Execution on Multiprocessors Practical
Given that the majority of future processors will contain an abundance of execution cores, redundant execution can offer a promising method for increasing the availability and res...
Jesse Pool, Ian Sin Kwok Wong, David Lie
SIGSOFT
2010
ACM
14 years 9 months ago
Differential static analysis: opportunities, applications, and challenges
It is widely believed that program analysis can be more closely targeted to the needs of programmers if the program is accompanied by further redundant documentation. This may inc...
Shuvendu K. Lahiri, Kapil Vaswani, C. A. R. Hoare
PERCOM
2009
ACM
15 years 12 months ago
DiaSim: A Parameterized Simulator for Pervasive Computing Applications
Abstract--Pervasive computing applications involve both software concerns, like any software system, and integration concerns, for the constituent networked devices of the pervasiv...
Wilfried Jouve, Julien Bruneau, Charles Consel
ISSRE
2006
IEEE
15 years 5 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