Citation Context

...tations from value flow, this approach naturally assigns formation costs to data structures. Dynamic thin slicing, in general, suffers from a problem common to most client analyses of dynamic slicing =-=[2, 9, 34, 41]-=-: large memory requirements. While there exists a range of strategies to reduce these costs [15, 27, 33, 38, 39, 41], it is still prohibitively expensive to perform whole-program dynamic slicing. The ...

Citation Context

... to replay non-deterministic executions [26]. Checkpointing at the application level. Applicationlevel checkpointing has recently gained popularity for debugging and testing [24, 22], dynamic slicing =-=[36]-=-, and race detection [5, 6]. There is also work on deterministic replay of multi-threaded programs [23, 4]. User-driven language-level checkpointing techniques have been proposed for recording data of...

Citation Context

...nation of delta debugging and dynamic slicing [8] to further reduce the size of slices, while Zhang and colleagues combined check-pointing with dynamic slicing for analyzing long-running applications =-=[27]-=-. A second family of complementary approaches attempts to automate debugging by ranking program entities. These approaches include techniques that aim to locate suspicious statements by comparing pass...

Citation Context

...where system calls are represented by vertices, and data and control dependences between system calls are represented by edges. To formally define SCDG, we first define dynamic dependence graph (DDG) =-=[31]-=- of a program run. Later, an SCDG can be constructed from a DDG. 1 : fd1 = open(path1,"r",...); 2 : read(fd1, buf, ...); 3 : if (buf == "1") { 4 : fd2 = open(path2, "r", ...); 5 : n = read(fd2,buf,......

Citation Context

...on in multithreaded programs executing on a uniprocessor. In prior work we have shown that a straightforward extension of dynamic slicing for multithreaded programs can detect certain types of faults =-=[28, 24]-=-. However, presence of data races is not captured by the above dynamic slices. Hence, backward dynamic slices by themselves are inadequate for debugging programs when one source of errors can be the p...

Citation Context

...he other hand, expensive and bulky, as it often implies walking stack frames to reconstruct a context and explicitly dumping the context as a sequence of symbolic function names. It has been shown in =-=[22]-=- that context sensitive event logging is critical for event reduction, which speeds up execution replay by removing events in a replay log that are not relevant to producing a failure. In that work, c...

Citation Context

...ology and challenges can be found in Tip’s survey [32] and Krinke’s thesis [19]. The work by Zhang et al. [40, 41, 43] has considerably improved the state of the art in dynamic slicing. The work from =-=[44]-=- is more related to our work in that the proposed event-based slicing approach uses pre-defined events to merge dependence graph nodes. However, this work targets automated program debugging, whereas ...

Citation Context

...wn by up to 50%. Categories and Subject Descriptors D.2.5 [Software Engineering]: Testing and Debugging—Debugging aids; D.3.4 [Programming Languages]: Processors—Debuggers; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages—Program analysis General Terms Languages, Performance, Reliability Keywords Data flow, graph cut, replay, instrumentation 1. INTRODUCTION A replay tool aims at reproducing a program’s execution, which enables cyclic debugging [28] and comprehensive diagnosis techniques, such as intrusion analysis [7, 13], predicate checking [9, 17], program slicing [40], model checking [14, 39], and test generation [8, 24, 30]. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. FSE-18, November 7–11, 2010, Santa Fe, New Mexico, USA. Copyright 2010 ACM 978-1-60558-791-2/10/11 ...$10.00. Re-execution of a p...