Sciweavers

241 search results - page 4 / 49
» Trace analysis of Erlang programs
Sort
View
CAL
2006
13 years 6 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani
PLDI
2009
ACM
14 years 6 months ago
Semantics-aware trace analysis
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
Kevin J. Hoffman, Patrick Eugster, Suresh Jagannat...
RV
2010
Springer
110views Hardware» more  RV 2010»
13 years 4 months ago
Interval Analysis for Concurrent Trace Programs Using Transaction Sequence Graphs
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
Malay K. Ganai, Chao Wang
SIGMETRICS
1999
ACM
130views Hardware» more  SIGMETRICS 1999»
13 years 10 months ago
Address Trace Compression Through Loop Detection and Reduction
ded Abstract This paper introduces a new technique for compressing memory address traces. The technique relies on the simple observation that most programs spend their time execut...
E. N. Elnozahy
ISSRE
2002
IEEE
13 years 11 months ago
An Empirical Study of Tracing Techniques from a Failure Analysis Perspective
Tracing is a dynamic analysis technique to continuously capture events of interest on a running program. The occurrence of a statement, the invocation of a function, and the trigg...
Satya Kanduri, Sebastian G. Elbaum