Towards Log Slicing
Pages 249 - 259
Abstract
This short paper takes initial steps towards developing a novel approach, called log slicing, that aims to answer a practical question in the field of log analysis: Can we automatically identify log messages related to a specific message (e.g., an error message)? The basic idea behind log slicing is that we can consider how different log messages are “computationally related” to each other by looking at the corresponding logging statements in the source code. These logging statements are identified by 1) computing a backwards program slice, using as criterion the logging statement that generated a problematic log message; and 2) extending that slice to include relevant logging statements.
The paper presents a problem definition of log slicing, describes an initial approach for log slicing, and discusses a key open issue that can lead towards new research directions.
References
[1]
van der Aalst, W.M.P.: Distributed process discovery and conformance checking. In: de Lara, J., Zisman, A. (eds.) Fundamental Approaches to Software Engineering. pp. 1–25. Springer Berlin Heidelberg, Berlin, Heidelberg (2012)
[2]
Agrawal, H., Horgan, J.R.: Dynamic program slicing. SIGPLAN Not. 25(6), 246–256 (jun 1990)., https://doi.org/10.1145/93548.93576
[3]
Basin, D., Caronni, G., Ereth, S., Harvan, M., Klaedtke, F., Mantel, H.: Scalable offline monitoring. In: Bonakdarpour, B., Smolka, S.A. (eds.) Runtime Verification. pp. 31–47. Springer International Publishing, Cham (2014)
[4]
Bushong, V., Sanders, R., Curtis, J., Du, M., Cerny, T., Frajtak, K., Bures, M., Tisnovsky, P., Shin, D.: On matching log analysis to source code: A systematic mapping study. In: Proceedings of the International Conference on Research in Adaptive and Convergent Systems. p. 181–187. RACS ’20, Association for Computing Machinery, New York, NY, USA (2020)., https://doi.org/10.1145/3400286.3418262
[5]
He, S., He, P., Chen, Z., Yang, T., Su, Y., Lyu, M.R.: A survey on automated log analysis for reliability engineering. ACM Comput. Surv. 54(6) (Jul 2021).
[6]
Jia, T., Yang, L., Chen, P., Li, Y., Meng, F., Xu, J.: Logsed: Anomaly diagnosis through mining time-weighted control flow graph in logs. In: 2017 IEEE 10th International Conference on Cloud Computing (CLOUD). pp. 447–455. IEEE, IEEE, Honolulu, CA, USA (2017).
[7]
Liu, Z., Xia, X., Lo, D., Xing, Z., Hassan, A.E., Li, S.: Which variables should I log? IEEE Transactions on Software Engineering 47(9), 2012–2031 (2021).
[8]
Messaoudi, S., Shin, D., Panichella, A., Bianculli, D., Briand, L.C.: Log-based slicing for system-level test cases. In: Proceedings of the 30th ACM SIGSOFT International Symposium on Software Testing and Analysis. p. 517–528. ISSTA 2021, Association for Computing Machinery, New York, NY, USA (2021)., https://doi.org/10.1145/3460319.3464824
[9]
Mi, H., Wang, H., Zhou, Y., Lyu, M.R.T., Cai, H.: Toward fine-grained, unsupervised, scalable performance diagnosis for production cloud computing systems. IEEE Transactions on Parallel and Distributed Systems 24(6), 1245–1255 (2013).
[10]
Nandi, A., Mandal, A., Atreja, S., Dasgupta, G.B., Bhattacharya, S.: Anomaly detection using program control flow graph mining from execution logs. In: 2016 26nd ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). pp. 215–224. KDD ’16, Association for Computing Machinery, New York, NY, USA (2016).
[11]
Schipper, D., Aniche, M., van Deursen, A.: Tracing back log data to its log statement: From research to practice. In: 2019 IEEE/ACM 16th International Conference on Mining Software Repositories (MSR). pp. 545–549 (2019).
[12]
Shin, D., Bianculli, D., Briand, L.: PRINS: scalable model inference for component-based system logs. Empirical Software Engineering 27(4), 87 (2022)., https://doi.org/10.1007/s10664-021-10111-4
[13]
Tak, B.C., Tao, S., Yang, L., Zhu, C., Ruan, Y.: Logan: Problem diagnosis in the cloud using log-based reference models. In: 2016 IEEE International Conference on Cloud Engineering (IC2E). pp. 62–67 (2016).
[14]
Weiser, M.: Program slicing. IEEE Trans. Softw. Eng. 10(4), 352–357 (Jul 1984)., https://doi.org/10.1109/TSE.1984.5010248
[15]
Yuan, D., Zheng, J., Park, S., Zhou, Y., Savage, S.: Improving software diagnosability via log enhancement. ACM Trans. Comput. Syst. 30(1) (Feb 2012).
[16]
Zhao, X., Rodrigues, K., Luo, Y., Stumm, M., Yuan, D., Zhou, Y.: Log20: Fully automated optimal placement of log printing statements under specified overhead threshold. In: 2017 26th Symposium on Operating Systems Principles (SOSP). p. 565–581. SOSP ’17, Association for Computing Machinery, New York, NY, USA (2017).
[17]
Zhao, X., Rodrigues, K., Luo, Y., Yuan, D., Stumm, M.: Non-Intrusive performance profiling for entire software stacks based on the flow reconstruction principle. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16). pp. 603–618. USENIX Association, Savannah, GA (Nov 2016), https://www.usenix.org/conference/osdi16/technical-sessions/presentation/zhao
[18]
Zhou, P., Wang, Y., Li, Z., Tyson, G., Guan, H., Xie, G.: Logchain: Cloud workflow reconstruction & troubleshooting with unstructured logs. Computer Networks 175, 107279 (2020)., https://www.sciencedirect.com/science/article/pii/S1389128619316731
Recommendations
Approximation in (Poly-) Logarithmic Space
AbstractWe develop new approximation algorithms for classical graph and set problems in the RAM model under space constraints. As one of our main results, we devise an algorithm for that runs in time , uses bits ...
A Survey on Automated Log Analysis for Reliability Engineering
Invited TutorialLogs are semi-structured text generated by logging statements in software source code. In recent decades, software logs have become imperative in the reliability assurance mechanism of many software systems, because they are often the only data available ...
Fully dynamic connectivity in O(log n(log log n)2) amortized expected time
SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete AlgorithmsDynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a new randomized dynamic connectivity structure with O(log n(log log n)2) amortized expected update time and O(log n/log log log n) query time, which ...
Comments
Information & Contributors
Information
Published In
Apr 2023
343 pages
© The Author(s) 2023.
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 22 April 2023
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025