Abstract
Recent technological advances have made possible the retrieval of execution traces on microcontrollers. However, the huge amount of data in the collected trace makes the trace analysis extremely difficult and time-consuming. In this paper, by leveraging both cycles and repetitions present in an execution trace, we present an approach which offers a compact and accurate trace compression. This compression may be used during the trace analysis without decompression, notably for identifying repeated cycles or comparing different cycles. The evaluation demonstrates that our approach reaches high compression ratios on microcontroller execution traces.
Chapter PDF
References
Aoe, J.: Computer Algorithms: String Pattern Matching Strategies. Wiley-IEEE Computer Society Press (1994)
Burtscher, M., Ganusov, I., Jackson, S., Ke, J., Ratanaworabhan, P., Sam, N.: The VPC trace-compression algorithms. IEEE Trans. on Computers 54(11), 1329–1344 (2005)
Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. on Information Theory 51(7), 2554–2576 (2005)
De Oliveira, C., Theoleyre, F., Duda, A.: Connectivity in multi-channel multi-interface wireless mesh networks. In: International Wireless Communications and Mobile Computing Conference (IWCMC), pp. 35–40 (2011)
Fayyad, U., Piatetsky-shapiro, G., Smyth, P.: From data mining to knowledge discovery in databases. AI Magazine 17, 37–54 (1996)
Gailly, J.-L., Adler, M.: Gzip, http://www.gzip.org
Hamou-Lhadj, A., Lethbridge, T.: Summarizing the content of large traces to facilitate the understanding of the behaviour of a software system. In: International Conference on Program Comprehension (ICPC), pp. 181–190. IEEE Computer Society (2006)
Hamou-Lhadj, A., Lethbridge, T.C.: Compression techniques to simplify the analysis of large execution traces. In: International Workshop on Program Comprehension (IWPC), pp. 159–168. IEEE Computer Society (2002)
Heizmann, M., Hoenicke, J., Podelski, A.: Refinement of trace abstraction. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 69–85. Springer, Heidelberg (2009)
Larus, J.R.: Whole program paths. In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 259–269. ACM (1999)
Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical strcture in sequences: A linear-time algorithm. Journal of Artificial Intellgence Research (JAIR) 7, 67–82 (1997)
Rohani, A., Zarandi, H.: An analysis of fault effects and propagations in AVR microcontroller ATmega103(L). In: International Conference on Availability, Reliability and Security (ARES), pp. 166–172 (2009)
Taniguchi, K., Ishio, T., Kamiya, T., Kusumoto, S., Inoue, K.: Extracting sequence diagram from execution trace of Java program. In: International Workshop on Principles of Software Evolution, pp. 148–154. IEEE Computer Society (2005)
Yang, E.-H., Kieffer, J.C.: Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform—Part one: Without context models. IEEE Trans. on Information Theory 46(3), 755–777 (2000)
Zhang, X., Gupta, R.: Whole execution traces and their applications. ACM Trans. Archit. Code Optim. 2(3), 301–334 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Amiar, A., Delahaye, M., Falcone, Y., du Bousquet, L. (2013). Compressing Microcontroller Execution Traces to Assist System Analysis. In: Schirner, G., Götz, M., Rettberg, A., Zanella, M.C., Rammig, F.J. (eds) Embedded Systems: Design, Analysis and Verification. IESS 2013. IFIP Advances in Information and Communication Technology, vol 403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38853-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-38853-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38852-1
Online ISBN: 978-3-642-38853-8
eBook Packages: Computer ScienceComputer Science (R0)