Write a Blog >>
SPLASH 2017
Sun 22 - Fri 27 October 2017 Vancouver, Canada
Thu 26 Oct 2017 13:30 - 13:52 at Regency A - Mining Software Repositories and Parsing Chair(s): Wolfgang De Meuter

Frameworks and libraries provide application programming interfaces (APIs) that serve as building blocks in modern software development. As APIs present the opportunity of increased productivity, it also calls for correct use to avoid buggy code. The usage-based specification mining technique has shown great promise in solving this problem through a data-driven approach. These techniques leverage the use of the API in large corpora to understand the recurring usages of the APIs and infer behavioral specifications (preconditions and postconditions) from such usages. A challenge for such technique is thus inference in the presence of insufficient usages, in terms of both frequency and richness. We refer to this as a "sparse usage problem." This paper presents the first technique to solve the sparse usage problem in usage-based precondition mining. Our key insight is to leverage implicit beliefs to overcome sparse usage. An implicit belief (IB) is the knowledge implicitly derived from the fact about the code. An IB about a program is known implicitly to a programmer via the language's constructs and semantics, and thus not explicitly written or specified in the code. The technical underpinnings of our new precondition mining approach include a technique to analyze the data and control flow in the program leading to API calls to infer preconditions that are implicitly present in the code corpus, a catalog of 35 code elements in total that can be used to derive implicit beliefs from a program, and empirical evaluation of all of these ideas. We have analyzed over 350 millions lines of code and 7 libraries that suffer from the sparse usage problem. Our approach realizes 6 implicit beliefs and we have observed that addition of single-level context sensitivity can further improve the result of usage based precondition mining. The result shows that we achieve overall 60% in precision and 69% in recall and the accuracy is relatively improved by 32% in precision and 78% in recall compared to base usage-based mining approach for these libraries.

Thu 26 Oct

splash-2017-OOPSLA
13:30 - 15:00: OOPSLA - Mining Software Repositories and Parsing at Regency A
Chair(s): Wolfgang De MeuterVrije Universiteit Brussel
splash-2017-OOPSLA13:30 - 13:52
Talk
Samantha Syeda KhairunnesaIowa State University, Hoan Anh NguyenIowa State University, USA, Tien NguyenUniversity of Texas at Dallas, Hridesh RajanIowa State University
DOI
splash-2017-OOPSLA13:52 - 14:15
Talk
Crista LopesUniversity of California, Irvine, Petr MajReactorLabs, Pedro MartinsUniversity of California at Irvine, USA, Vaibhav SainiUniversity of California at Irvine, USA, Di YangUniversity of California at Irvine, USA, Jakub ZitnyCzech Technical University, Czechia, Hitesh SajnaniMicrosoft , Jan VitekNortheastern University, USA
DOI
splash-2017-OOPSLA14:15 - 14:37
Talk
Davood MazinanianConcordia University, Canada, Ameya KetkarOregon State University, USA, Nikolaos TsantalisConcordia University, Canada, Danny DigSchool of EECS at Oregon State University
DOI
splash-2017-OOPSLA14:37 - 15:00
Talk
Michael D. AdamsUniversity of Utah, USA, Matthew MightUniversity of Utah, USA
DOI