Demo Data from EDBT 2026 / reviewers in the wild / expert
Rickard A. Åberg
dblp:07/4807
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software 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 |
Software maintenance and evolution · 77% Programming languages and type systems · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software maintenance and evolution › software evolution
automated software evolution |
0.0 | 1 | 2003 | On the automatic evolution of an OS kernel using temporal logic and AOP · ASE 2003 |
Programming languages and type systems
aspect-oriented programming |
0.0 | 1 | 2003 | On the automatic evolution of an OS kernel using temporal logic and AOP · ASE 2003 |
Methods — techniques the papers use, named apart from their topics
temporal logic · 0.0aspect-oriented programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | On the automatic evolution of an OS kernel using temporal logic and AOPabstractAutomating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. This task is particularly complicated when considering a large program, even when the modifications appear to be systematic. We illustrate this situation in the context of evolving the Linux kernel to support Bossa, an event-based framework for process-scheduler development. To support Bossa, events must be added at points scattered throughout the kernel. In each case, the choice of event depends on properties of one or a sequence of instructions. To describe precisely the choice of event, we propose to guide the event insertion by using a set of rules, amounting to an aspect that describes the control-flow contexts in which each event should be generated. In this paper, we present our approach and describe the set of rules that allows proper event insertion. These rules use temporal logic to describe sequences of instructions that require events to be inserted. We also give an overview of an implementation that we have developed to automatically perform this evolution. Rickard A. Åberg, Julia Lawall, Mario Südholt, Gilles Muller, Anne-Françoise Le Meur |
ASE | 1 |