Compressing Microcontroller Execution Traces to Assist System Analysis

  • Azzeddine Amiar
  • Mickaël Delahaye
  • Yliès Falcone
  • Lydie du Bousquet
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 403)


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.


Compression Ratio Trace Analysis Execution Trace Embed Software Good Compression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Aoe, J.: Computer Algorithms: String Pattern Matching Strategies. Wiley-IEEE Computer Society Press (1994)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)MathSciNetCrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Fayyad, U., Piatetsky-shapiro, G., Smyth, P.: From data mining to knowledge discovery in databases. AI Magazine 17, 37–54 (1996)Google Scholar
  6. 6.
    Gailly, J.-L., Adler, M.: Gzip,
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Larus, J.R.: Whole program paths. In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 259–269. ACM (1999)Google Scholar
  11. 11.
    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)zbMATHGoogle Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Zhang, X., Gupta, R.: Whole execution traces and their applications. ACM Trans. Archit. Code Optim. 2(3), 301–334 (2005)zbMATHCrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2013

Authors and Affiliations

  • Azzeddine Amiar
    • 1
  • Mickaël Delahaye
    • 1
  • Yliès Falcone
    • 1
  • Lydie du Bousquet
    • 1
  1. 1.Laboratoire d’Informatique de GrenobleUniversité Grenoble AlpesGrenobleFrance

Personalised recommendations