Demo Data from EDBT 2026 / reviewers in the wild / expert
John Marrero
dblp:60/7055
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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 |
Software maintenance and evolution · 87% Concurrent programming · 13% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software maintenance and evolution › refactoring
concurrency refactoring |
0.1 | 1 | 2009 | Refactoring sequential Java code for concurrency via concurrent libraries · ICSE 2009 |
Software maintenance and evolution
refactoring |
0.1 | 1 | 2009 | Refactoring sequential Java code for concurrency via concurrent libraries · ICSE 2009 |
Parallel and multicore computing
parallelization of sequential computations |
0.0 | 1 | 2009 | Refactoring sequential Java code for concurrency via concurrent libraries · ICSE 2009 |
Parallel and multicore computing
parallel programming models |
0.0 | 1 | 2009 | Refactoring sequential Java code for concurrency via concurrent libraries · ICSE 2009 |
Methods — techniques the papers use, named apart from their topics
program analysis · 0.2automated transformation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Refactoring sequential Java code for concurrency via concurrent librariesabstractParallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 package java.util.concurrent (j.u.c.) supports writing concurrent programs: much of the complexity of writing thread-safe and scalable programs is hidden in the library. To use this package, programmers still need to reengineer existing code. This is tedious because it requires changing many lines of code, is error-prone because programmers can use the wrong APIs, and is omission-prone because programmers can miss opportunities to use the enhanced APIs. This paper presents our tool, Concurrencer, that enables programmers to refactor sequential code into parallel code that uses three j.u.c. concurrent utilities. Concurrencer does not require any program annotations. Its transformations span multiple, non-adjacent, program statements. A find-and-replace tool can not perform such transformations, which require program analysis. Empirical evaluation shows that concurrencer refactors code effectively: concurrencer correctly identifies and applies transformations that some open-source developers overlooked, and the converted code exhibits good speedup. Danny Dig, John Marrero, Michael D. Ernst |
ICSE | 2 |