- Title
- Casper: an efficient approach to call trace collection
- Creator
- Wu, Rongxin; Xiao, Xiao; Cheung, Shing-Chi; Zhang, Hongyu; Zhang, Charles
- Relation
- 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL '16 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (St. Petersburg, FL 20-22 January, 2016) p. 678-690
- Publisher Link
- http://dx.doi.org/10.1145/2837614.2837619
- Publisher
- Association for Computing Machinery (ACM)
- Resource Type
- conference paper
- Date
- 2016
- Description
- Call traces, i.e., sequences of function calls and returns, are fundamental to a wide range of program analyses such as bug reproduction, fault diagnosis, performance analysis, and many others. The conventional approach to collect call traces that instruments each function call and return site incurs large space and time overhead. Our approach aims at reducing the recording overheads by instrumenting only a small amount of call sites while keeping the capability of recovering the full trace. We propose a call trace model and a logged call trace model based on an LL(1) grammar, which enables us to define the criteria of a feasible solution to call trace collection. Based on the two models, we prove that to collect call traces with minimal instrumentation is an NP-hard problem. We then propose an efficient approach to obtaining a suboptimal solution. We implemented our approach as a tool Casper and evaluated it using the DaCapo benchmark suite. The experiment results show that our approach causes significantly lower runtime (and space) overhead than two state-of-the-arts approaches.
- Subject
- call trace; instrumentation; overhead
- Identifier
- http://hdl.handle.net/1959.13/1357332
- Identifier
- uon:31907
- Identifier
- ISBN:9781450335492
- Language
- eng
- Reviewed
- Hits: 2769
- Visitors: 2984
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|