Mining temporal rules for software maintenance

Journal of Software Maintenance and Evolution

Volumn 20, Issue 4, 2008, Pages 227-247

  Lo, David ^a   Khoo, Siau Cheng ^b   Liu, Chao ^c  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Data mining; Dynamic analysis; Program comprehension; Program verification; Software evolution; Specification mining

Indexed keywords

BENCHMARKING; COMPUTER SOFTWARE MAINTENANCE; COMPUTER SOFTWARE SELECTION AND EVALUATION; CONVOLUTIONAL CODES; DIGITAL SIGNAL PROCESSING; FINANCE; LAWS AND LEGISLATION; MAINTENANCE; MINING; MODEL CHECKING; PROGRAM DEBUGGING; TEMPORAL LOGIC; VERIFICATION;

APPLICATION SERVERS; ARBITRARY LENGTHS; BENCHMARK DATA; CASE STUDIES; DATA MINING; DETECTING BUGS; DYNAMIC ANALYSIS; FORMAL ANALYSIS; LOGIC EXPRESSIONS; MINING RESULTS; MODEL CHECKERS; PROGRAM BEHAVIORS; PROGRAM COMPREHENSION; PROGRAM EXECUTIONS; PROGRAM VERIFICATION; SOFTWARE EVOLUTION; SOFTWARE VERIFICATIONS; SPECIFICATION MINING; TEMPORAL RULES;

CONCURRENCY CONTROL;

EID: 49749143787     PISSN: 1532060X     EISSN: 15320618     Source Type: Journal    
DOI: 10.1002/smr.375     Document Type: Conference Paper

References (32)

1. Canfora G, Cimitile A. Software maintenance. Handbook of Software Engineering and Knowledge Engineering. World Scientific: River Edge NJ, 2001; 1:91-120.
2. Clarke E, Grumberg O, Peled D. Model Checking. MIT Press: Cambridge MA, 1999.
3. Ammons G, Bodik R, Larus JR. Mining specification. Proceedings of Symposium on Principles of Programming Languages (POPL), 2002; 4-16.
4. Reiss SP, Renieris M. Encoding program executions. Proceedings of International Conference on Software Engineering (ICSE), 2001; 221-230.
5. Cook JE, Wolf AL. Discovering models of software processes from event-based data. ACM Transactions on Software Engineering and Methodology 1998; 7(3):215-249.
6. Lo D, Khoo SC. SMArTIC: Toward building an accurate, robust and scalable specification miner. Proceedings of International Symposium on the Foundations of Software Engineering (FSE), 2006; 265-275.
7. Yang J, Evans D, Bhardwaj D, Bhat T, Das M. Perracotta: Mining temporal API rules from imperfect traces. Proceedings of International Conference on Software Engineering (ICSE), 2006; 282-291.
8. Dwyer M, Avrunin G, Corbett J, Patterns in property specifications for finite-state verification. Proceedings of International Conference on Software Engineering (ICSE), 1999; 411-420.
9. Han J, Kamber M. Data Mining Concepts and Techniques. Morgan Kaufmann: Los Altos CA, 2006.
10. Ball T. The concept of dynamic analysis. Proceedings of European Software Engineering Conference/International Symposium on the Foundations of Software Engineering (ESEC/FSE), 1999; 216-234.
11. Huth M, Ryan M. Logic in Computer Science. Cambridge University Press: Cambridge, 2004.
12. Hopcroft J, Motwani R, Ullman J. Introduction to Automata Theory, Languages, and Computability. Addison-Wesley: Reading MA, 2001.
13. Yan X, Han J, Afhar R. CloSpan: Mining closed sequential patterns in large data sets. Proceedings of SIAM International Conference on Data Mining (SDM), 2003.
14. Wang J, Han J. BIDE: Efficient mining of frequent closed sequences. Proceedings of International Conference on Data Engineering (ICDE), 2004; 79-90.
15. Engler D, Chen DY, Hallem S, Chou A, Chelf B. Bugs as deviant behavior: A general approach to inferring errors in systems code. Proceedings of Symposium on Operating System Principles (SOSP), 2001; 57-72.
16. Agrawal R, Srikant R. Fast algorithms for mining association rules. Proceedings of International Conference on Very Large Data Bases (VLDB), 1994; 487-499.
17. Agrawal R, Srikant R. Mining sequential patterns. Proceedings of International Conference on Data Engineering (ICDE), 1995; 3-14.
18. Lo D, Khoo SC, Liu C. Mining recurrent rules from sequence database. NUS SoC Technical Report TR 12/07, 2007 [27 June 20081.
19. Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu MC. Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. Proceedings of International Conference on Data Engineering (ICDE), 2001; 215-224.
20. Corbett J, Dwyer M, Hatcliff J, Laubach S, Pasareanu CS, Robby, Zheng H. Bandera: Extracting finite-state models from Java source code. Proceedings of International Conference on Software Engineering (ICSE), 2000; 439-448.
21. JRat. http://jrat.sourceforge.net/ [27 June 2008].
22. Larus J, Schnarr E. EEL: Machine-independent executable editing. Proceedings of SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1995; 291-300.
23. Lo D, Khoo SC, Liu C. Efficient mining of iterative patterns for software specification discovery. Proceedings of SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2007; 460-469.
24. Kohavi R, Bradley C, Frasca B, Mason L, Zheng Z. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations 2000; 2:86-98.
25. Weimer W, Necula G. Mining temporal specifications for error detection. Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2005; 461-476.
26. Lo D, Khoo SC. QUARK: Empirical assessment of automaton-based specification miners. Proceedings of Working Conference on Reverse Engineering (WCRE), 2006; 51-60.
27. Apache. Jakarta commons/net. Available from: http://jakarta.apache.org/ commons/net/ [27 June 2008].
28. Hinton A, Kwiatkowska M, Norman G, Parker D. PRISM: A tool for automatic verification of probabilistic systems. Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2006; 441-444.
29. Ernst M, Cockrell J, Griswold W, Notkin D. Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering 2001; 27(2):99-123.
30. Zaidman A, Calders T, Demeyer S, Paredaens J. Applying web mining techniques to execution traces to support the program comprehension process. Proceedings of European Conference on Software Maintenance and Reengineering (CSMR), 2005; 134-142.
31. Hamou-Lhadj A, Lethbridge T. Summarizing the content of large traces to facilitate the understanding of the behaviour of a software system. Proceedings of International Conference on Program Comprehension (ICPC), 2006; 181-190.
32. Kuhn A, Greevy O. Exploiting analogy between traces and signal processing. Proceedings of International Conference on Software Maintenance (ICSM), 2006; 320-329.