{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:28:20Z","timestamp":1747805300288,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1109\/csmr.2011.27","type":"proceedings-article","created":{"date-parts":[[2011,4,7]],"date-time":"2011-04-07T06:41:03Z","timestamp":1302158463000},"page":"211-220","source":"Crossref","is-referenced-by-count":12,"title":["Pattern Recognition Techniques Applied to the Abstraction of Traces of Inter-Process Communication"],"prefix":"10.1109","author":[{"given":"Luay","family":"Alawneh","sequence":"first","affiliation":[]},{"given":"Abdelwahab","family":"Hamou-Lhadj","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89985-3_9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1216370.1216372"},{"key":"ref11","first-page":"467","article-title":"Class-based n-gram models of natural language","volume":"18","author":"brown","year":"1992","journal-title":"Journal of Computational Linguistics"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380240105"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.05.002"},{"key":"ref14","article-title":"An n-gram based approach to finding the repeating patterns in musical data","author":"patel","year":"2005","journal-title":"Proceedings of the European IMSA"},{"journal-title":"MPI A Message Passing Interface Standard","article-title":"Message Passing Interface Forum","year":"1995","key":"ref15"},{"key":"ref16","article-title":"Visualization of repetitive patterns in event traces","author":"kn\u00fcpfer","year":"2006","journal-title":"Proc Workshop State-of-the-Art in Scientific and Parallel Computing (PARA)"},{"key":"ref17","article-title":"TraceVis: an execution trace visualization tool","author":"roberts","year":"2005","journal-title":"Proc MoBS 2005"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11261-4_8"},{"key":"ref19","first-page":"309","article-title":"A Scalable Approach to MPI Application Performance Analysis","volume":"3666","author":"moore","year":"2005"},{"journal-title":"FLASH 2 0 User's Guide","year":"0","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.71"},{"key":"ref27","first-page":"526","article-title":"Introducing the Open Trace Format (OTF)","author":"kn\u00fcpfer","year":"2006","journal-title":"Proc of the International Conference on Computational Science (ICS)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/749874"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161035"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4655(99)00501-9"},{"key":"ref5","article-title":"Fast detection of communication patterns in distributed executions","author":"kunz","year":"1997","journal-title":"proc of CASCON"},{"key":"ref8","article-title":"Techniques to Simplify the Analysis of Execution Traces for Program Comprehension","author":"hamou-lhadj","year":"2005","journal-title":"School of Information Technology and Engineering (SITE)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2006.19"},{"journal-title":"The Vampir Performance Visualizer","year":"0","key":"ref2"},{"article-title":"Performance Evaluation of Interconnection Networks using Simulation: Tools and Case Studies","year":"2009","author":"palma","key":"ref9"},{"key":"ref1","first-page":"258","article-title":"An Architecture for Reconfigurable Iterative MPI Applications in Dynamic Environments","author":"el maghraoui","year":"2005","journal-title":"Proc of ICPP AM"},{"journal-title":"Event graph analysis for debugging massively parallel programs","year":"2000","author":"kranzlm\u00fcller","key":"ref20"},{"key":"ref22","first-page":"707","article-title":"Binary Codes Capable of Correcting Deletions, Insertions and Reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1984.1659158"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/11408079_4"},{"key":"ref23","first-page":"240","article-title":"Two algorithms for approximate string matching in static texts","author":"jokinen","year":"1991","journal-title":"Proc 2nd Annual Symp Mathematical Foundations of Computer Science"},{"year":"0","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.296"}],"event":{"name":"2011 15th European Conference on Software Maintenance and Reengineering (CSMR)","start":{"date-parts":[[2011,3,1]]},"location":"Oldenburg, Germany","end":{"date-parts":[[2011,3,4]]}},"container-title":["2011 15th European Conference on Software Maintenance and Reengineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5740650\/5741244\/05741263.pdf?arnumber=5741263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:20:17Z","timestamp":1490066417000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5741263\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/csmr.2011.27","relation":{},"subject":[],"published":{"date-parts":[[2011,3]]}}}