MAPO: Mining API usages from open source repositories

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2006, Pages 54-57

  Xie, Tao ^a   Pei, Jian ^b  

^a North Carolina State University   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

application programming interfaces; mining software repositories; program comprehension

Indexed keywords

CLASS LIBRARIES; CLIENT CODE; CODE SEARCH ENGINE; FREQUENT SEQUENCES; MINING SOFTWARE REPOSITORIES; OPEN SOURCE REPOSITORIES; POST-PROCESSOR; PREPROCESSORS; PROGRAM COMPREHENSION; RELEVANT DOCUMENTS; SOFTWARE PRODUCTIVITY; SOFTWARE SYSTEMS; SOURCE CODES; SOURCE FILES; SUPPORTING TOOL; USAGE MINING; USAGE PATTERNS;

APPLICATION PROGRAMMING INTERFACES (API); COMPUTER PROGRAMMING; COMPUTER SOFTWARE REUSABILITY; INFORMATION RETRIEVAL; SEARCH ENGINES; SOFTWARE ENGINEERING;

WORLD WIDE WEB;

EID: 77953967695     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137983.1137997     Document Type: Conference Paper

References (20)

1. CodeBase, 2005. http://www.codase.com/.
2. DocJar, 2005. http://www.docjar.com/.
3. The Koders source code search engine, 2005. http://www.koders.com.
4. PMD, 2005. http://pmd.sourceforge.net/.
5. SPARS-J, 2005. http://demo.spars.info/.
6. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases, pages 487-499, Sept. 1994.
7. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering, pages 3-14, Taipei, Taiwan, Mar. 1995.
8. G. Ammons, R. Bodik, and J. R. Larus. Mining specifications. In Proc. 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 4-16, 2002.
9. M. Dahm and J. van Zyl. Byte Code Engineering Library, April 2003. http://jakarta.apache.org/bcel/.
10. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data, pages 1-12, May 2000.
11. D. S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of the ACM, 24:644-675, 1977.
12. R. Holmes and G. C. Murphy. Using structural context to recommend source code examples. In Proc. 27th International Conference on Software Engineering, pages 117-125, 2005.
13. K. Inoue, R. Yokomori, H. Fujiwara, T. Yamamoto, M. Matsushita, and S. Kusumoto. Ranking significance of software components based on use relations. IEEE Transactions on Software Engineering, 31(3):213-225, March 2005.
14. Z. Li and Y. Zhou. PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code. In Proc. ESEC/FSE, pages 306-315, 2005.
15. B. Livshits and T. Zimmermann. DynaMine: finding common error patterns by mining software revision histories. In Proc. ESEC/FSE, pages 296-305, 2005.
16. L. Mariani and M. Pezzè. Behavior capture and test: Automated analysis of component integration. In Proc. 10th International Conference on Engineering of Complex Computer Systems, pages 292-301, June 2005.
17. A. Michail. Data mining library reuse patterns using generalized association rules. In Proc. 22nd International Conference on Software Engineering, pages 167-176, 2000.
18. A. V. Raman and J. D. Patrick. The sk-strings method for inferring pfsa. In Proc. Workshop on Automata Induction, Grammatical Inference and Language Acquisition, 1997.
19. J. Wang and J. Han. BIDE: Efficient mining of frequent closed sequences. In Proc. 20th International Conference on Data Engineering, pages 79-90, 2004.
20. C. C. Williams and J. K. Hollingsworth. Recovering system specific rules from software repositories. In Proc. 2005 International Workshop on Mining Software Repositories, pages 1-5, 2005.