Giles Reger
Abstract
This paper considers automata-based pattern mining techniques for extracting specifications from runtime traces and suggests a novel extension that allows these techniques to work with so-called imperfect traces i.e. traces that do not exactly satisfy the intended specification of the system that produced them. We show that by taking a so-called edit-distance between an input trace and the language of a pattern we can extract specifications from imperfect traces and identify the parts of an input trace that do not satisfy the mined specification, thus aiding the identification and location of errors in programs.
- C. Allauzen and M. Mohri. 3-way composition of weighted finite-state transducers. In Proceedings of the 13th international conference on Implementation and Applications of Automata, CIAA '08, pages 262--273, Berlin, Heidelberg, 2008. Springer-Verlag. Google Scholar
Digital Library
- C. Allauzen and M. Mohri. Linear-space computation of the edit-distance between a string and a finite automaton. CoRR, abs/0904.4686, 2009.Google Scholar
- G. Ammons, R. Bodík, and J. R. Larus. Mining specifications. SIGPLAN Not., 37(1):4--16, Jan. 2002. Google ScholarDigital Library
- D. Engler, D. Y. Chen, S. Hallem, A. Chou, and B. Chelf. Bugs as deviant behavior: a general approach to inferring errors in systems code. SIGOPS Oper. Syst. Rev., 35(5):57--72, Oct. 2001. Google ScholarDigital Library
- M. Gabel and Z. Su. Javert: fully automatic mining of general temporal properties from dynamic traces. In Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering, SIGSOFT '08/FSE-16, pages 339--349, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- M. Gabel and Z. Su. Symbolic mining of temporal specifications. In ICSE '08: Proceedings of the 30th international conference on Software engineering, pages 51--60, New York, USA, 2008. ACM. Google ScholarDigital Library
- M. Gabel and Z. Su. Online inference and enforcement of temporal properties. In Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1, ICSE '10, pages 15--24, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- C. Goues and W. Weimer. Specification mining with few false positives. In Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems., TACAS '09, pages 292--306, Berlin, Heidelberg, 2009. Springer-Verlag. Google ScholarDigital Library
- C. Lee, F. Chen, and G. Roşu. Mining parametric specifications. In Proceeding of the 33rd International Conference on Software Engineering (ICSE'11), pages 591--600. ACM, 2011. Google ScholarDigital Library
- V. Levenshtein. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady, 10:707, 1966.Google Scholar
- W. Li, A. Forin, and S. A. Seshia. Scalable specification mining for verification and diagnosis. In DAC '10: Proceedings of the 47th Design Automation Conference, pages 755--760, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- Z. Li and Y. Zhou. Pr-miner: automatically extracting implicit programming rules and detecting violations in large software code. SIGSOFT Softw. Eng. Notes, 30(5):306--315, Sept. 2005. Google ScholarDigital Library
- D. Lo, K. Cheng, and J. Han. Mining Software Specifications: Methodologies and Applications. Chapman and Hall/CRC Data Mining and Knowledge Discovery. Taylor & Francis Group, 2011. Google ScholarDigital Library
- D. Lo and S.-C. Khoo. Smartic: towards building an accurate, robust and scalable specification miner. In Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, SIGSOFT '06/FSE-14, pages 265--275, New York, USA, 2006. ACM. Google ScholarDigital Library
- D. Lo, S.-C. Khoo, and C. Liu. Mining temporal rules for software maintenance. J. Softw. Maint. Evol., 20(4):227--247, July 2008. Google ScholarDigital Library
- D. Lo, G. Ramalingam, V. P. Ranganath, and K. Vaswani. Mining quantified temporal rules: Formalism, algorithms, and evaluation. Sci. Comput. Program., 77(6):743--759, 2012. Google ScholarDigital Library
- G. Reger, H. Barringer, and D. Rydeheard. A pattern-based approach to parametric specification mining. In Proceedings of the 28th IEEE/ACM International Conference on Automated Software Engineering, November 2013. To appear.Google ScholarDigital Library
- M. P. Robillard, E. Bodden, D. Kawrykow, M. Mezini, and T. Ratchford. Automated api property inference techniques. IEEE Transactions on Software Engineering, 39(5):613--637, 2013. Google ScholarDigital Library
- J. Yang, D. Evans, D. Bhardwaj, T. Bhat, and M. Das. Perracotta: mining temporal api rules from imperfect traces. In ICSE '06: Proceedings of the 28th international conference on Software engineering, pages 282--291, New York, NY, USA, 2006. ACM. Google ScholarDigital Library
Index Terms
- Automata-based Pattern Mining from Imperfect Traces
Recommendations
Performance and characteristic analysis of maximal frequent pattern mining methods using additional factors
Various data mining methods have been proposed to handle large-scale data and discover interesting knowledge hidden in the data. Maximal frequent pattern mining is one of the data mining techniques suggested to solve the fatal problem of traditional ...
Interesting pattern mining in multi-relational data
Mining patterns from multi-relational data is a problem attracting increasing interest within the data mining community. Traditional data mining approaches are typically developed for single-table databases, and are not directly applicable to multi-...
Identification of adverse disease agents and risk analysis using frequent pattern mining
Highlights- An improved algorithm is proposed to construct FP-tree from transactional datasets.
AbstractLife-threatening illnesses such as cancer, cirrhosis of the liver, and hepatitis have become crucial problems for humanity. The risk of mortality can be deflated by early detection of symptoms and providing the best possible diagnosis. ...
Comments