Demo Data from EDBT 2026 / reviewers in the wild / expert
Yalin Ke
dblp:144/1504
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1Software engineering, systems software and programming languages · 1 · 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
1 paper |
Debugging and program repair · 67% Software maintenance and evolution · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Debugging and program repair
automated program repair |
0.2 | 1 | 2015 | Repairing Programs with Semantic Code Search (T) · ASE 2015 |
Debugging and program repair › automated program repair
patch generation |
0.2 | 1 | 2015 | Repairing Programs with Semantic Code Search (T) · ASE 2015 |
Software maintenance and evolution › code search
semantic code search |
0.2 | 1 | 2015 | Repairing Programs with Semantic Code Search (T) · ASE 2015 |
Methods — techniques the papers use, named apart from their topics
constraint solving · 0.2SMT constraints · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Repairing Programs with Semantic Code Search (T)abstractAutomated program repair can potentially reduce debugging costs and improve software quality but recent studies have drawn attention to shortcomings in the quality of automatically generated repairs. We propose a new kind of repair that uses the large body of existing open-source code to find potential fixes. The key challenges lie in efficiently finding code semantically similar (but not identical) to defective code and then appropriately integrating that code into a buggy program. We present SearchRepair, a repair technique that addresses these challenges by(1) encoding a large database of human-written code fragments as SMT constraints on input-output behavior, (2) localizing a given defect to likely buggy program fragments and deriving the desired input-output behavior for code to replace those fragments, (3) using state-of-the-art constraint solvers to search the database for fragments that satisfy that desired behavior and replacing the likely buggy code with these potential patches, and (4) validating that the patches repair the bug against program testsuites. We find that SearchRepair repairs 150 (19%) of 778 benchmark C defects written by novice students, 20 of which are not repaired by GenProg, TrpAutoRepair, and AE. We compare the quality of the patches generated by the four techniques by measuring how many independent, not-used-during-repairtests they pass, and find that SearchRepair-repaired programs pass 97.3% ofthe tests, on average, whereas GenProg-, TrpAutoRepair-, and AE-repaired programs pass 68.7%, 72.1%, and 64.2% of the tests, respectively. We concludethat SearchRepair produces higher-quality repairs than GenProg, TrpAutoRepair, and AE, and repairs some defects those tools cannot. Yalin Ke, Kathryn T. Stolee, Claire Le Goues, Yuriy Brun |
ASE | 1 |
| 2011 | A Block Gathering Based on Mobile Web Page Segmentation AlgorithmabstractCompared to html page, the mobile web page has different features. The mobile web page is arranged through some important tags such as;N;, which are called Gathering Node in this paper. Based on these Gathering Nodes, we proposed a Block Gathering Based Page Segmentation algorithm (BGBPS). The experiment shows that BGBPS algorithm has great effect on semantic segmentation of mobile web page. Yalin Ke, Yanxiang He |
TrustCom | 2 |