Data-driven synthesis for object-oriented frameworks
Name
Solar-Lezama_Data-driven synthesis.pdf
Size
847.43 KB
Format
Adobe PDF
Checksum (MD5)
be472ce8bc26ce5953f006fe0edc0599
Author(s) • •
Yessenov, Kuat T.
Xu, Zhilei
Solar-Lezama, Armando
Date Issued
October 2011
Journal
Proceedings of the 2011 ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA '11)
Publisher
Association for Computing Machinery (ACM)
Citation
Kuat Yessenov, Zhilei Xu, and Armando Solar-Lezama. 2011. Data-driven synthesis for object-oriented frameworks. SIGPLAN Not. 46, 10 (October 2011), 65-82.
Version
Author's final manuscript
Abstract
Software construction today often involves the use of large frameworks. The challenge in this type of programming is that object-oriented frameworks tend to grow exceedingly intricate; they spread functionality among numerous classes, and any use of the framework requires knowledge of many interacting components. We present a system named MATCHMAKER that from a simple query synthesizes code that interacts with the framework. The query consists of names of two framework classes, and our system produces code enabling interaction between them. MATCHMAKER relies on a database of dynamic program traces called DELIGHT that uses novel abstraction-based indexing techniques to answer queries about the evolution of heap connectivity in a matter of seconds.
The paper evaluates the performance and effectiveness of MATCHMAKER on a number of benchmarks from the Eclipse framework. The paper also presents the results of a user study that showed a 49% average productivity improvement from the use of our tool.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2048066.2048075