VLDB 2026 Research / reviewers in the wild / expert
Sulekha Kulkarni
dblp:187/9715
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 1 first-author
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 analysis · 75% Software maintenance and evolution · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis
static analysis |
0.6 | 2 | 2018 | User-guided program reasoning using Bayesian inference · PLDI 2018 Accelerating program analyses by cross-program training · OOPSLA 2016 |
Program analysis
false alarm reduction |
0.3 | 1 | 2018 | User-guided program reasoning using Bayesian inference · PLDI 2018 |
Software maintenance and evolution › issue management
incident triage |
0.3 | 1 | 2018 | User-guided program reasoning using Bayesian inference · PLDI 2018 |
Program analysis › static analysis › interprocedural analysis
call graph analysis |
0.1 | 1 | 2016 | Accelerating program analyses by cross-program training · OOPSLA 2016 |
Methods — techniques the papers use, named apart from their topics
datalog · 0.6bayesian inference · 0.3offline training · 0.2machine learning · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | User-guided program reasoning using Bayesian inferenceabstractProgram analyses necessarily make approximations that often lead them to report true alarms interspersed with many false alarms. We propose a new approach to leverage user feedback to guide program analyses towards true alarms and away from false alarms. Our approach associates each alarm with a confidence value by performing Bayesian inference on a probabilistic model derived from the analysis rules. In each iteration, the user inspects the alarm with the highest confidence and labels its ground truth, and the approach recomputes the confidences of the remaining alarms given this feedback. It thereby maximizes the return on the effort by the user in inspecting each alarm. We have implemented our approach in a tool named Bingo for program analyses expressed in Datalog. Experiments with real users and two sophisticated analyses---a static datarace analysis for Java programs and a static taint analysis for Android apps---show significant improvements on a range of metrics, including false alarm rates and number of bugs found. Mukund Raghothaman, Sulekha Kulkarni, Kihong Heo, Mayur Naik |
PLDI | 2 |
| 2016 | Accelerating program analyses by cross-program trainingabstractPractical programs share large modules of code. However, many program analyses are ineffective at reusing analysis results for shared code across programs. We present POLYMER, an analysis optimizer to address this problem. POLYMER runs the analysis offline on a corpus of training programs and learns analysis facts over shared code. It prunes the learnt facts to eliminate intermediate computations and then reuses these pruned facts to accelerate the analysis of other programs that share code with the training corpus. We have implemented POLYMER to accelerate analyses specified in Datalog, and apply it to optimize two analyses for Java programs: a call-graph analysis that is flow- and context-insensitive, and a points-to analysis that is flow- and context-sensitive. We evaluate the resulting analyses on ten programs from the DaCapo suite that share the JDK library. POLYMER achieves average speedups of 2.6× for the call- graph analysis and 5.2× for the points-to analysis. Sulekha Kulkarni, Ravi Mangal, Xin Zhang 0035, Mayur Naik |
OOPSLA | 1 |