TailTracer: Continuous Tail Tracing for Production Use
Open Access
- 9 October 2025
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (OOPSLA2) , 1647-1670
Abstract
Despite extensive in-house testing, bugs often escape to deployed software. Whenever a failure occurs in production software, it is desirable to collect as much execution information as possible so as to help developers reproduce, diagnose and fix the bug. To reconcile the tension between trace capability, runtime overhead, and trace scale, we propose continuous tail tracing for production use. Instead of capturing only crash stacks, we produce the complete sequence of function calls and returns. Importantly, to avoid the overwhelming stress to I/O, storage, and network transfer caused by the tremendous amount of trace data, we only retain the final segment of trace. To accomplish it, we design a novel trace decoder to support precise tail trace decoding, and an effective path-based instrumentation-site selection algorithm to reduce overhead. We implemented our approach as a tool called TailTracer on top of LLVM, and conducted the evaluations over the SPEC CPU 2017 benchmark suite, the open-source database system, and real-world bugs. The experimental results validate that TailTracer achieves low-overhead tail tracing, while providing more informative trace data than the baseline.Keywords
Funding Information
- National Natural Science Foundation of China-Liaoning Joint Fund (No. 62272217)
This publication has 32 references indexed in Scilit:
- BOLT: A Practical Binary Optimizer for Data Centers and Beyond2019
- Transparent and Efficient CFI Enforcement with Intel Processor Trace2017
- Chronicler: Lightweight recording to reproduce field failures2013
- Spectrum-Based Multiple Fault Localization2009
- ReCrash: Making Software Failures Reproducible by Preserving Object States2008
- Model-based fault localization in large-scale computing systems2008
- The VPC Trace-Compression AlgorithmsIEEE Transactions on Computers, 2005
- PDATS Lossless Address Trace Compression For Reducing File Size And Access Time2005
- PDATS II: improved compression of address traces1999
- Optimal measurement points for program frequency countsBIT Numerical Mathematics, 1973