Comprehending implementation recipes of framework-provided concepts through dynamic analysis

Authors:
Abbas Heydarnoori;Krzysztof Czarnecki
Affiliations:
University of Waterloo, Waterloo, ON, Canada;University of Waterloo, Waterloo, ON, Canada
Venue:
Companion to the 22nd ACM SIGPLAN conference on Object-oriented programming systems and applications companion
Year:
2007

Citing 9
Cited 0

Dynamic program slicing

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Data clustering: a review

ACM Computing Surveys (CSUR)
Data mining library reuse patterns using generalized association rules

Proceedings of the 22nd international conference on Software engineering
Locating Features in Source Code

IEEE Transactions on Software Engineering
Mining Non-Redundant Association Rules

Data Mining and Knowledge Discovery
Using structural context to recommend source code examples

Proceedings of the 27th international conference on Software engineering
MAPO: mining API usages from open source repositories

Proceedings of the 2006 international workshop on Mining software repositories
XSnippet: mining For sample code

Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Mining implementation recipes of framework-provided concepts in dynamic framework API interaction traces

Companion to the 22nd ACM SIGPLAN conference on Object-oriented programming systems and applications companion

Quantified Score

Hi-index	0.01

Visualization

Abstract

Application developers often use example applications as a guide to learn how to implement a framework-provided concept. To ease applying this technique, we present a novel framework comprehension technique called FUDA. FUDA integrates a new dynamic slicing approach with clustering and data mining techniques to generate the implementation recipes of a desired concept.