Key points are not available for this paper at this time.
There are many tools that help programmers find code fragments, but most are inexpressive and rely on static information. We present a new technique for synthesizing code that is dynamic (giving accurate results and allowing programmers to reason about concrete executions), easy-to-use (supporting a wide range of correctness specifications), and interactive (allowing users to refine the candidate code snippets). Our implementation, which we call CodeHint, generates and evaluates code at runtime and hence can synthesize real-world Java code that involves I/O, reflection, native calls, and other advanced language features. We have evaluated CodeHint in two user studies and show that its algorithms are efficient and that it improves programmer productivity by more than a factor of two.
Building similarity graph...
Analyzing shared references across papers
Loading...
Joel Galenson
University of California, Berkeley
Philip Reames
Rastislav Bodík
Google (United States)
University of California, Berkeley
Building similarity graph...
Analyzing shared references across papers
Loading...
Galenson et al. (Tue,) studied this question.
synapsesocial.com/papers/6a1072f1e1a472cb5efceca3 — DOI: https://doi.org/10.1145/2568225.2568250