Year: 2014
Type: conference-paper
Abstract: 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.
Institution: University of California, Berkeley
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Awards: SHF: Small: Programming Support for Checkpointing and Replay, SHF: Small: Specifying and Verifying Essential Deterministic Behavior of Concurrent Programs, SHF: Small: Directed Testing and Debugging of Concurrent Programs, SHF: Small: Programming Abstractions for Algorithmic Software Synthesis, Collaborative Research: Expeditions in Computer Augmented Program Engineering (ExCAPE): Harnessing Synthesis for Software Design
OpenAlex ID: W2115733813
