Demo Data from EDBT 2026 / reviewers in the wild / expert
Elven Shum
dblp:258/1002
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper |
Program synthesis and code generation · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program synthesis and code generation
programming by example |
0.4 | 1 | 2020 | Grammar Filtering for Syntax-Guided Synthesis · AAAI 2020 |
Program synthesis and code generation
syntax-guided synthesis |
0.4 | 1 | 2020 | Grammar Filtering for Syntax-Guided Synthesis · AAAI 2020 |
Methods — techniques the papers use, named apart from their topics
neural network · 0.4automated reasoning · 0.4SMT solver · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Grammar Filtering for Syntax-Guided SynthesisabstractProgramming-by-example (PBE) is a synthesis paradigm that allows users to generate functions by simply providing input-output examples. While a promising interaction paradigm, synthesis is still too slow for realtime interaction and more widespread adoption. Existing approaches to PBE synthesis have used automated reasoning tools, such as SMT solvers, as well as works applying machine learning techniques. At its core, the automated reasoning approach relies on highly domain specific knowledge of programming languages. On the other hand, the machine learning approaches utilize the fact that when working with program code, it is possible to generate arbitrarily large training datasets. In this work, we propose a system for using machine learning in tandem with automated reasoning techniques to solve Syntax Guided Synthesis (SyGuS) style PBE problems. By preprocessing SyGuS PBE problems with a neural network, we can use a data driven approach to reduce the size of the search space, then allow automated reasoning-based solvers to more quickly find a solution analytically. Our system is able to run atop existing SyGuS PBE synthesis tools, decreasing the runtime of the winner of the 2019 SyGuS Competition for the PBE Strings track by 47.65% to outperform all of the competing tools. Kairo Morton, William T. Hallahan, Elven Shum, Ruzica Piskac, Mark Santolucito |
AAAI | 3 |