{ "schema_version": "0.6.0", "paper_id": "efficient-model-query-visualize-system-states-traces", "page_url": "https://threadslab.org/research-publications/papers/efficient-model-query-visualize-system-states-traces/", "title": "Efficient Model to Query and Visualize the System States Extracted from Trace Data", "title_variants": [], "authors": [ "Alexandre Montplaisir", "Naser Ezzati-Jivan", "Florian Wininger", "Michel R. Dagenais" ], "author_details": [ { "name": "Alexandre Montplaisir", "orcid": null, "profile_url": "https://dblp.org/pid/134/9492.html" }, { "name": "Naser Ezzati-Jivan", "orcid": "https://orcid.org/0000-0003-1435-6297", "profile_url": "https://threadslab.org/" }, { "name": "Florian Wininger", "orcid": null, "profile_url": "https://dblp.org/pid/134/9574.html" }, { "name": "Michel R. Dagenais", "orcid": null, "profile_url": "https://dblp.org/pid/60/309.html" } ], "publication": { "year": 2013, "venue": "Runtime Verification 2013 (RV 2013)", "type": "conference paper", "publication_date": "2013", "online_date": null, "print_date": "2013", "volume": null, "issue": null, "pages": "219-234", "article_number": null, "publisher": "Springer Berlin Heidelberg", "issn": [ "0302-9743", "1611-3349" ], "isbn": [ "9783642407864", "9783642407871" ], "crossref_type": "book-chapter" }, "publication_type": "conference paper", "status": "published_with_public_preview", "canonical_source_url": "https://doi.org/10.1007/978-3-642-40787-1_13", "source_record_id": "efficient-model-to-query-and-visualize-the-system-states-extracted-from-trace-data-f245cade78", "identifiers": { "doi": "10.1007/978-3-642-40787-1_13" }, "abstract": "The accessible chapter preview describes a tree-based model of system states and intervals extracted from traces, with online/offline operation and interactive analysis at approximately 1 TB trace scale.", "abstract_source": "Springer two-page chapter preview, paraphrased; complete chapter not obtained.", "abstract_available": true, "scholar_eligibility": { "eligible": false, "basis": "not-eligible", "note": "The page is a discovery record; it does not claim Google Scholar article-host eligibility." }, "description": "The accessible chapter preview describes a tree-based model of system states and intervals extracted from traces, with online/offline operation and interactive analysis at approximately 1 TB trace scale.", "evidence_level": "full-text-reviewed", "evidence": { "source_basis": "full-text-reviewed", "coverage": "material paper sections", "summary_origin": "AI-assisted catalog editorial summary", "review_status": "catalog-reviewed; paper-author approval pending", "verified_on": "2026-08-26", "sources": [ { "note": "Local PDF reviewed, including state-provider design, State History Tree, query complexity, and R-tree comparison" }, { "note": "Springer DOI record: https://doi.org/10.1007/978-3-642-40787-1_13" }, { "note": "Springer book chapter record: https://link.springer.com/chapter/10.1007/978-3-642-40787-1_13" } ] }, "summary": { "core_contribution": "The paper introduces a disk-backed state-history model that incrementally converts trace events into queryable state intervals, enabling scalable timestamp/state queries and visualization without replaying the entire trace.", "problem": "Multicore traces containing system calls, scheduling, and interrupts grow to gigabytes. Replay and checkpoint approaches are expensive, while analysts need arbitrary state-at-time and interval queries for interactive views.", "method": "The implementation uses LTTng kernel and user-space traces with the Eclipse TMF/Linux Tools ecosystem. A state provider maps event types to state changes; an in-memory Attribute Tree represents current state, while a disk State History Tree stores intervals ordered by end time. Incremental block construction, configurable disk blocks, and partial-history granularities of 20,000, 50,000, and 100,000 events support online/offline use. The State System Explorer and control-flow/resource views expose states such as USER, syscall, WAIT, and WAIT_FOR_CPU. The paper states logarithmic query complexity and compares the disk structure with an R-tree.", "findings": "On the stated Intel Core i7 920/6 GB/Eclipse 3.7/OpenJDK 7/LTTng 0.232 setup, the disk-backed history is the key enabler for large traces, and partial updates reduce storage/build cost while still allowing inspection of the event stream. The R-tree comparison shows higher cost from rebalancing in the evaluated workload. Figures cover traces from zero to roughly 12,000 MB, although the paper does not provide a single consolidated numeric benchmark table.", "limitations": "The validation is centered on LTTng and a single machine; late interval insertion can imbalance the structure, the event-to-state mapping is partly hard-coded, and the study does not establish behavior under all trace schemas or distributed clocks.", "future_work": "Support additional tracing ecosystems such as DTrace and ETW, improve balancing and late insertion, make mappings more declarative, and evaluate query latency, storage, and update cost across larger heterogeneous and distributed traces." }, "tags": [ "trace-abstraction", "trace-visualization", "trace-analysis", "performance-analysis" ], "keywords": [ "system states", "trace queries", "trace visualization", "interval data", "tree-based storage", "online analysis", "offline analysis" ], "versions": [ { "id": "published-version", "label": "Published version", "relation": "version-of-record", "title": "Efficient Model to Query and Visualize the System States Extracted from Trace Data", "url": "https://doi.org/10.1007/978-3-642-40787-1_13", "pdf_url": null, "status": "published", "canonical_for_citation": true }, { "id": "springer-two-page-chapter-preview", "label": "Springer two-page chapter preview", "relation": "source-record", "title": "Efficient Model to Query and Visualize the System States Extracted from Trace Data", "url": "https://page-one.springer.com/pdf/preview/10.1007/978-3-642-40787-1_13", "pdf_url": null, "status": "public_preview", "canonical_for_citation": false } ], "access": { "status": "published_with_public_preview", "note": "PolyPublie, DOI, DBLP, and the chapter metadata verify the record. The authorized Springer route exposed only a two-page preview, not the complete chapter; detailed implementation and benchmark claims remain unverified.", "license": null }, "resources": { "code": null, "data": null, "slides": null, "demo": null }, "citation_guidance": { "when_to_cite": "Cite this paper when building disk-backed, incrementally queryable state histories from large execution traces.", "points": [ "The State History Tree and Attribute Tree representation.", "Event-to-state mapping for LTTng kernel/user traces and interactive state queries.", "Partial history updates and the R-tree comparison.", "The stated logarithmic query model and single-platform evaluation caveat." ], "canonical_version_id": "published-version" }, "provenance": { "metadata_verified_on": "2026-08-26", "metadata_source": [ "Local PDF reviewed, including state-provider design, State History Tree, query complexity, and R-tree comparison", "Springer DOI record: https://doi.org/10.1007/978-3-642-40787-1_13", "Springer book chapter record: https://link.springer.com/chapter/10.1007/978-3-642-40787-1_13" ], "summary_written_by": "AI-assisted", "summary_verified_by": "full-text-grounded catalog review; author approval pending", "linked_preprint_record": null, "author_order_note": null }, "batch": { "phase": 2, "batch_label": "expanded forty-paper release", "status": "included_in_expanded_catalog", "selected_at": "2026-08-28" } }