EDBT 2026 Demo / reviewers in the wild / expert
Aaron Todd
dblp:145/0976
· DBLP profile ↗
1ranked-venue papers
0as 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 · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 77% Concurrent programming · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems
language design |
0.2 | 1 | 2014 | Taming the parallel effect zoo: extensible deterministic parallelism with LVish · PLDI 2014 |
Parallel and multicore computing › deterministic execution
deterministic parallelism |
0.2 | 1 | 2014 | Taming the parallel effect zoo: extensible deterministic parallelism with LVish · PLDI 2014 |
Parallel and multicore computing
parallel programming models |
0.2 | 1 | 2014 | Taming the parallel effect zoo: extensible deterministic parallelism with LVish · PLDI 2014 |
Concurrent programming
determinism |
0.1 | 1 | 2014 | Taming the parallel effect zoo: extensible deterministic parallelism with LVish · PLDI 2014 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Taming the parallel effect zoo: extensible deterministic parallelism with LVishabstractA fundamental challenge of parallel programming is to ensure that the observable outcome of a program remains deterministic in spite of parallel execution. Language-level enforcement of determinism is possible, but existing deterministic-by-construction parallel programming models tend to lack features that would make them applicable to a broad range of problems. Moreover, they lack extensibility: it is difficult to add or change language features without breaking the determinism guarantee. Lindsey Kuper, Aaron Todd, Sam Tobin-Hochstadt, Ryan Newton |
PLDI | 2 |