{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T22:58:54Z","timestamp":1791154734438,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642388521","type":"print"},{"value":"9783642388538","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38853-8_13","type":"book-chapter","created":{"date-parts":[[2013,6,13]],"date-time":"2013-06-13T14:39:00Z","timestamp":1371134340000},"page":"139-150","source":"Crossref","is-referenced-by-count":6,"title":["Compressing Microcontroller Execution Traces to Assist System Analysis"],"prefix":"10.1007","author":[{"given":"Azzeddine","family":"Amiar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micka\u00ebl","family":"Delahaye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yli\u00e8s","family":"Falcone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lydie","family":"du Bousquet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Aoe, J.: Computer Algorithms: String Pattern Matching Strategies. Wiley-IEEE Computer Society Press (1994)"},{"issue":"11","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1109\/TC.2005.186","volume":"54","author":"M. Burtscher","year":"2005","unstructured":"Burtscher, M., Ganusov, I., Jackson, S., Ke, J., Ratanaworabhan, P., Sam, N.: The VPC trace-compression algorithms. IEEE Trans. on Computers\u00a054(11), 1329\u20131344 (2005)","journal-title":"IEEE Trans. on Computers"},{"issue":"7","key":"13_CR3","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. on Information Theory\u00a051(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. on Information Theory"},{"key":"13_CR4","unstructured":"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\u201340 (2011)"},{"key":"13_CR5","first-page":"37","volume":"17","author":"U. Fayyad","year":"1996","unstructured":"Fayyad, U., Piatetsky-shapiro, G., Smyth, P.: From data mining to knowledge discovery in databases. AI Magazine\u00a017, 37\u201354 (1996)","journal-title":"AI Magazine"},{"key":"13_CR6","unstructured":"Gailly, J.-L., Adler, M.: Gzip, \n                    \n                      http:\/\/www.gzip.org"},{"key":"13_CR7","unstructured":"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\u2013190. IEEE Computer Society (2006)"},{"key":"13_CR8","unstructured":"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\u2013168. IEEE Computer Society (2002)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-03237-0_7","volume-title":"Static Analysis","author":"M. Heizmann","year":"2009","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Refinement of trace abstraction. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol.\u00a05673, pp. 69\u201385. Springer, Heidelberg (2009)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Larus, J.R.: Whole program paths. In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 259\u2013269. ACM (1999)","DOI":"10.1145\/301631.301678"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"C.G. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical strcture in sequences: A linear-time algorithm. Journal of Artificial Intellgence Research (JAIR)\u00a07, 67\u201382 (1997)","journal-title":"Journal of Artificial Intellgence Research (JAIR)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013172 (2009)","DOI":"10.1109\/ARES.2009.169"},{"key":"13_CR13","unstructured":"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\u2013154. IEEE Computer Society (2005)"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1109\/18.841161","volume":"46","author":"E.-H. Yang","year":"2000","unstructured":"Yang, E.-H., Kieffer, J.C.: Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform\u2014Part one: Without context models. IEEE Trans. on Information Theory\u00a046(3), 755\u2013777 (2000)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/1089008.1089012","volume":"2","author":"X. Zhang","year":"2005","unstructured":"Zhang, X., Gupta, R.: Whole execution traces and their applications. ACM Trans. Archit. Code Optim.\u00a02(3), 301\u2013334 (2005)","journal-title":"ACM Trans. Archit. Code Optim."}],"container-title":["IFIP Advances in Information and Communication Technology","Embedded Systems: Design, Analysis and Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38853-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T03:55:20Z","timestamp":1557806120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38853-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642388521","9783642388538"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38853-8_13","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}