Enhancing the Analysis of Large Multimedia Applications Execution Traces with FrameMiner

The analysis of multimedia application traces can reveal important information to enhance program comprehension. However traces can be very large, which hinders their effective exploitation. In this paper, we study the problem of finding a k-golden set of blocks that best characterize data. Sequential pattern mining can help to automatically discover the blocks, and we called k-golden set, a set of k blocks that maximally covers the trace. These kind of blocks can simplify the exploration of large traces by allowing programmers to see an abstraction instead of low-level events. We propose an approach for mining golden blocks and finding coverage of frames. The experiments carried out on video and audio application decoding show very promising results.

[1]  Xavier Guerin.  An Efficient Embedded Software Development Approach for Multiprocessor System-on-Chips. (Approche Efficace de Développement de Logiciel Embarqué pour des Systèmes Multiprocesseurs sur Puce) , 2010 .

[2]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[3]  Philippe Dugerdil,et al.  Using trace sampling techniques to identify dynamic clusters of classes , 2007, CASCON.

[4]  Aranyak Mehta,et al.  Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.

[5]  Abdelwahab Hamou-Lhadj,et al.  A software behaviour analysis framework based on the human perception systems: NIER track , 2011, 2011 33rd International Conference on Software Engineering (ICSE).

[6]  Sourav S. Bhowmick,et al.  Sequential Pattern Mining: A Survey , 2003 .

[7]  Alexandre Termier,et al.  Debugging embedded multimedia application traces through periodic pattern mining , 2012, EMSOFT '12.

[8]  Hadas Shachnai,et al.  Maximizing submodular set functions subject to multiple linear constraints , 2009, SODA.

[9]  B. de Oliveira Stein,et al.  Pajé trace file format , 2003 .

[10]  Jan Vondrák,et al.  Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.

[11]  Matthew J. Streeter,et al.  An Online Algorithm for Maximizing Submodular Functions , 2008, NIPS.

[12]  C. Alberini,et al.  Memory , 2006, Cellular and Molecular Life Sciences CMLS.

[13]  Abdelwahab Hamou-Lhadj,et al.  A survey of trace exploration tools and techniques , 2004, CASCON.

[14]  Abdelwahab Hamou-Lhadj,et al.  The Concept of Stratified Sampling of Execution Traces , 2011, 2011 IEEE 19th International Conference on Program Comprehension.

[15]  Jing Xiao,et al.  Frequent Instruction Sequential Pattern Mining in Hardware Sample Data , 2010, 2010 IEEE International Conference on Data Mining.

[16]  Abdelwahab Hamou-Lhadj,et al.  Pattern Recognition Techniques Applied to the Abstraction of Traces of Inter-Process Communication , 2011, 2011 15th European Conference on Software Maintenance and Reengineering.

[17]  Jiawei Han,et al.  Signature Pattern Covering via Local Greedy Algorithm and Pattern Shrink , 2011, 2011 IEEE 11th International Conference on Data Mining.

[18]  Patrick Th. Eugster,et al.  Semantics-aware trace analysis , 2009, PLDI '09.

[19]  Abdelwahab Hamou-Lhadj,et al.  A Novel Approach Based on Gestalt Psychology for Abstracting the Content of Large Execution Traces for Program Comprehension , 2011, 2011 16th IEEE International Conference on Engineering of Complex Computer Systems.

[20]  Gail C. Murphy,et al.  Scaling an object-oriented system execution visualizer through sampling , 2003, 11th IEEE International Workshop on Program Comprehension, 2003..

[21]  Thomas Ball,et al.  The concept of dynamic analysis , 1999, ESEC/FSE-7.

[22]  Arie van Deursen,et al.  Understanding Execution Traces Using Massive Sequence and Circular Bundle Views , 2007, 15th IEEE International Conference on Program Comprehension (ICPC '07).