Demo Data from EDBT 2026 / reviewers in the wild / expert
Reuben Olinsky
dblp:09/1994
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2Software 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
3 papers |
Operating systems · 71% Compilers and program optimization · 20% Programming languages and type systems · 10% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% | |
| Network and information security
1 paper |
Systems and software security · 100% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Operating systems › operating system design
library operating systems |
0.3 | 2 | 2013 | Composing OS extensions safely and efficiently with Bascule · EuroSys 2013 Rethinking the library OS from the top down · ASPLOS 2011 |
Cloud and datacenter computing
virtualization |
0.1 | 1 | 2011 | Rethinking the library OS from the top down · ASPLOS 2011 |
Compilers and program optimization › compiler back end
calling conventions |
0.1 | 1 | 2006 | Staged allocation: a compositional technique for specifying and implementing procedure calling conventions · POPL 2006 |
Compilers and program optimization
compiler construction |
0.1 | 1 | 2006 | Staged allocation: a compositional technique for specifying and implementing procedure calling conventions · POPL 2006 |
Programming languages and type systems › program specification
specification composition |
0.1 | 1 | 2006 | Staged allocation: a compositional technique for specifying and implementing procedure calling conventions · POPL 2006 |
Systems and software security
operating system security |
0.0 | 1 | 2011 | Rethinking the library OS from the top down · ASPLOS 2011 |
Methods — techniques the papers use, named apart from their topics
system design · 0.4user-mode library · 0.2test suite generation · 0.1formal semantics · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Composing OS extensions safely and efficiently with BasculeabstractLibrary OS (LibOS) architectures implement the OS personality as a user-mode library, giving each application the flexibility to choose its LibOS. This approach is appealing for many reasons, not least the ability to extend or customise the LibOS. Recent work with Drawbridge [29] showed that an existing commodity OS (Windows 7) could be refactored to produce a LibOS while retaining application compatibility. Andrew Baumann, Pedro Fonseca 0001, Lisa Glendenning, Jacob R. Lorch, Barry Bond, Reuben Olinsky, Galen C. Hunt |
EuroSys | 7 |
| 2011 | Rethinking the library OS from the top downabstractThis paper revisits an old approach to operating system construc-tion, the library OS, in a new context. The idea of the library OS is that the personality of the OS on which an application depends runs in the address space of the application. A small, fixed set of abstractions connects the library OS to the host OS kernel, offering the promise of better system security and more rapid independent evolution of OS components. Donald E. Porter, Silas Boyd-Wickizer, Jon Howell, Reuben Olinsky, Galen C. Hunt |
ASPLOS | 4 |
| 2006 | Staged allocation: a compositional technique for specifying and implementing procedure calling conventionsabstractWe present staged allocation, a technique for specifying calling conventions by composing tiny allocators called stages. A specification written using staged allocation has a precise, formal semantics, and it can be executed directly inside a compiler. Specifications of nine standard C~calling conventions range in size from 15 to 30 lines each. An implementation of staged allocation takes about 250 lines of ML or 650~lines of C++. Each specification can be used not only to help a compiler implement the calling convention but also to generate a test suite. Reuben Olinsky, Christian Lindig, Norman Ramsey |
POPL | 1 |