Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Joel Galenson

dblp:51/7791 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 1 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Program synthesis and code generation · 64% Programming languages and type systems · 18% Program verification · 18%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation › code generation from natural language
code snippet synthesis
0.212014
CodeHint: dynamic and interactive synthesis of code snippets · ICSE 2014
Program synthesis and code generation
interactive program synthesis
0.212014
CodeHint: dynamic and interactive synthesis of code snippets · ICSE 2014
Programming languages and type systems
program specification
0.112010
Programming with angelic nondeterminism · POPL 2010
Program verification › refinement
refinement calculus
0.112010
Programming with angelic nondeterminism · POPL 2010
Algorithms and data structures › search algorithms
backtracking
0.012010
Programming with angelic nondeterminism · POPL 2010

Methods — techniques the papers use, named apart from their topics

refinement calculus · 0.2
YearPublicationVenuePosition
2014 CodeHint: dynamic and interactive synthesis of code snippets
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.
Joel Galenson, Philip Reames, Rastislav Bodík, Björn Hartmann, Koushik Sen
ICSE1
2013 The Compiler Forest
Mihai Budiu, Joel Galenson, Gordon D. Plotkin
ESOP2
2011 Yada: Straightforward parallel programming
David Gay, Joel Galenson, Mayur Naik, Katherine A. Yelick
Parallel Comput.2
2010 Programming with angelic nondeterminism
abstract
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the formal basis of regular expressions; and Floyd relied on it to concisely express backtracking algorithms such as N-queens.
Rastislav Bodík, Satish Chandra 0001, Joel Galenson, Doug Kimelman, Nicholas Tung, Shaon Barman, Casey Rodarmor
POPL3