2011
DOI: 10.1007/978-3-642-22655-7_26
|View full text |Cite
|
Sign up to set email alerts
|

Summarized Trace Indexing and Querying for Scalable Back-in-Time Debugging

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…In practice, however, there is ample opportunity for optimizating the writing and reading of such traces, and scalable implementations can be quite sophisticated [6]. In particular, recording a full copy of the store at every event can be expensive, and more practical implementations will instead record individual changes to the store incrementally.…”
Section: Recording and Reading Tracesmentioning
confidence: 99%
“…In practice, however, there is ample opportunity for optimizating the writing and reading of such traces, and scalable implementations can be quite sophisticated [6]. In particular, recording a full copy of the store at every event can be expensive, and more practical implementations will instead record individual changes to the store incrementally.…”
Section: Recording and Reading Tracesmentioning
confidence: 99%
“…STIQ (Summarized Trace Indexing and Querying) [27] has been recently proposed as an efficient solution to debug a Java program during real-time. The solution saves traces of program executions onto the hard disk and caches the summary information in an "Execution Block" to link indexed data.…”
Section: Related Workmentioning
confidence: 99%
“…In contrast, heavyweight fine-grained execution trace collection introduces up to an order of magnitude slowdown [12,20]. Generated traces and their indices [23,24] are very large and often limited by the size of main memory.…”
Section: Visualizing and Exploring Recordings And Tracesmentioning
confidence: 99%