Skip to content

AutoScope: Code Knowledge Enhanced Span-level Sampling for Distributed Tracing

Jul 2026 · ACM Transactions on Software Engineering and Methodology · 0 citations · 55 references

TL;DR

This work proposes AutoScope, a novel framework that leverages static code knowledge to enable structurally safe span-level sampling and introduces the concept of span-level sampling, a fine-grained paradigm that retains only essential spans rather than full traces.

Abstract

Distributed tracing is essential for observing microservices but incurs prohibitive storage costs. Existing solutions primarily rely on trace-level sampling, which indiscriminately discards entire traces based on probability or tail latency. This coarse-grained approach often loses critical off-the-path anomalies and fails to retain normal baselines required for comparative diagnosis. To address these limitations, we introduce the concept of span-level sampling, a fine-grained paradigm that retains only essential spans rather than full traces. However, we identify a critical challenge in this new approach where naive span retention leads to structural ambiguity, as the removal of intermediate spans disrupts the graph topology and renders the remaining data useless for analysis. To resolve this, we propose AutoScope , a novel framework that leverages static code knowledge to enable structurally safe span-level sampling. AutoScope constructs a Bridged Call Site Control Flow Graph (CSCFG) to map runtime spans to static execution logic. By identifying Dominant Span Sets (DSS), it exploits the “Sample One, Infer All” property to enable aggressive compression while preserving the structural skeleton of every request. Extensive evaluations on two benchmark microservice systems demonstrate that AutoScope achieves an 80.2% storage reduction while maintaining a state-of-the-art faulty span coverage of 98.1%. Furthermore, the reconstructed traces enhance downstream Root Cause Analysis (RCA) tasks, improving the Mean Reciprocal Rank (MRR) by an average of 8.3%.

View source

Similar papers

Open access Oct 2026

ReFun: Reconstructing Function Boundaries in EVM Bytecode

Recovering the structure of a Solidity smart contract from its deployed bytecode is a prerequisite for various downstream analyses, such as control-flow graph construction, decompilation, and clone detection. A central step in this task is identifying private functions. However, since all source-level function boundari...

Yi-Chuan Li, Wei Song, Jeff Huang et al. · 0 citations
Conference Aug 2026

PRECISE: Precision-Driven Discovery of Token-centric MEV

Token-centric maximal extractable value (tMEV) arises when token supply-control behavior interacts with exchanges whose pricing ignores particular balance updates. Existing analyses face state explosion, missing deep inter-transaction paths or producing false positives. PRECISE combines token-level static filtering, fo...

Dinh-Khang Nguyen, Huynh-Nhu Nguyen Thi, Bich-Nhu Hong et al. · 0 citations
Open access Sep 2026

Frankenstein’s RAM: A Simulation Framework for Evaluating Memory Forensic Acquisition Strategies

Frankenstein is presented, a simulation-based framework that synthesizes a memory dump from a time series of atomic, hypervisor-level ground-truth snapshots under a configurable traversal strategy and bandwidth model and proposes novel page-category priority orderings that cut semantic inconsistencies and Hamming dista...

Lisa Rzepka, Jan Gruber, Felix C. Freiling et al. · 0 citations
Open access 2026

TrustTrace: Provenance-Aware Tracing of Indirect Prompt Injection Propagation in LLM-Assisted Learning Workflows

Indirect prompt injection can persist through retrieval, generation, and revision after the visible payload disappears. Existing defenses primarily detect suspicious inputs or constrain immediate actions, but they provide less evidence about which source influenced which final-artifact span through a temporally valid r...

Jing-Yi Chen, Rong-Qing Lu · 0 citations
Sep 2026

InterFuse: Scalable Detection of Memory Safety Violations via Differential Reasoning and Hierarchical Context Fusion

This work proposes InterFuse, a framework for differential path reasoning that builds compact interprocedural control-flow graphs with targeted pruning, samples high-contrast paths via genetic optimization, and uses hierarchical fusion with a lightweight concatenation-based module to enhance discriminative signals.

Yao Zhang, Rui-Jie Cai, Xiao-Kang Yin et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.