Jungloid mining: Helping to navigate the API jungle

ACM SIGPLAN Notices

Volumn 40, Issue 6, 2005, Pages 48-61

  Mandelin, David ^a   Xu, Lin ^a   Bodík, Rastislav ^a   Kimelman, Doug ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM   (United States)

Author keywords

Mining; Program synthesis; Reuse

Indexed keywords

PROGRAM SYNTHESIS; PROGRAMMER; QUERIES; REUSE;

BINARY CODES; DATA MINING; QUERY LANGUAGES; UTILITY PROGRAMS;

COMPUTER PROGRAMMING;

EID: 33745230004     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1064978.1065018     Document Type: Article

References (19)

1. R. Alur, P. Černý, P. Madhusudan, and W. Nam. Synthesis of interface specifications for Java classes.
2. G. Ammons, R. Bodík, and J. Larus. Mining specifications. ACM SIGPLAN Notices, 37(1):4-16, Jan. 2002.
3. J. Arthorne and C. Laffra. Official Eclipse 3.0 FAQs. Addison-Wesley Professional, 2004.
4. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst., 9(3):319-349, 1987.
5. S. Horwitz and T. Reps. The use of program dependence graphs in software engineering. In Proceedings of the 14th international conference on Software engineering, pages 392-411. ACM Press, 1992.
6. A. J. Ko, B. A. Myers, and H. H. Aung. Six learning barriers in end-user programming systems.
7. R. Komondoor and S. Horwitz. Effective, automatic procedure extraction. In Proceedings of the 11th IEEE International Workshop on Program Comprehension, page 33. IEEE Computer Society, 2003.
8. K. J. Lieberherr. Component enhancement: An adaptive reusability mechanism for groups of collaborating classes. In J. van Leeuwen, editor, information Processing '92, 12th World Computer Congress, pages 179-185, Madrid, Spain, 1992. Elsevier.
9. K. J. Lieberherr, W. Hürsch, I. Silva-Lepe, and C. Xiao. Experience with a graph-based propagation pattern programming tool. In G. F. et al., editor, International Workshop on CASE, pages 114-119, Montŕal, Canada, 1992. IEEE Computer Society.
10. M. Rittri. Retrieving library identifiers via equational matching of types, Jan. 24 1997.
11. D. W. Stringer-Calvert. Signature Matching for Ada Software Reuse. Master of engineering, Department of Computer Science, University of York, Mar. 1994.
12. R. E. Strom and S. Yemini. Typestate: A programming language concept for enhancing software reliability. IEEE Trans. Softw. Eng., 12(1):157-171, 1986.
13. J. van Baalen, P. Robinson, M. R. Lowry, and T. Pressburger. Explaining synthesized software. In Automated Software Engineering, pages 240-248, 1998.
14. M. Weiser. Program slicing. In Proceedings of the 5th international conference on Software engineering, pages 439-449. IEEE Press, 1981.
15. J. Whaley, M. C. Martin, and M. S. Lam. Automatic extraction of object-oriented component interfaces, July 11 2002.
16. Y. Ye and G. Fischer. Supporting reuse by delivering task-relevant and personalized information. In Proceedings of the 24th International Conference on Software Engineering (ICSE-02), pages 513-523, New York, May 19-25 2002. ACM Press.
17. D. M. Yellin and R. E. Strom. Protocol specifications and component adaptors. ACM Trans. Program. Lang. Syst., 19(2):292-333, 1997.
18. A. M. Zaremski and J. M. Wing. Signature matching: a tool for using software libraries, July 22 1996.
19. A. M. Zaremski and J. M. Wing. Specification matching of software components, Dec. 11 1997.