Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

CSE Conference and Workshop Papers

2012

Semantic search; program composition; code reuse; SMT solvers; constraints

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

Finding Suitable Programs: Semantic Search With Incomplete And Lightweight Specifications, Kathryn T. Stolee Jan 2012

Finding Suitable Programs: Semantic Search With Incomplete And Lightweight Specifications, Kathryn T. Stolee

CSE Conference and Workshop Papers

Finding suitable code for reuse is a common task for programmers. Two general approaches dominate the code search literature: syntactic and semantic. While queries for syntactic search are easy to compose, the results are often vague or irrelevant. On the other hand, a semantic search may return relevant results, but current techniques require developers to write specifications by hand, are costly as potentially matching code need to be executed to verify congruence with the specifications, or only return exact matches. In this work, we propose an approach for semantic search in which programmers specify lightweight, incomplete specifications and an SMT …