VLDB 2026 Research / reviewers in the wild / expert
Sascha Kuzins
dblp:31/2393
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3
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
2 papers |
Programming languages and type systems · 92% Program analysis · 8% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems
aspect-oriented programming |
0.1 | 2 | 2005 | Optimising aspectJ · PLDI 2005 Adding trace matching with free variables to AspectJ · OOPSLA 2005 |
Programming languages and type systems
language design |
0.1 | 2 | 2005 | Adding trace matching with free variables to AspectJ · OOPSLA 2005 Optimising aspectJ · PLDI 2005 |
Program analysis › dynamic analysis › trace analysis
trace alignment |
0.0 | 1 | 2005 | Adding trace matching with free variables to AspectJ · OOPSLA 2005 |
Methods — techniques the papers use, named apart from their topics
regular pattern matching · 0.1free variables · 0.1compiler optimization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | abc: The AspectBench Compiler for AspectJ
Chris Allan, Pavel Avgustinov, Aske Simon Christensen, Laurie J. Hendren, Sascha Kuzins, Jennifer Lhoták, Ondrej Lhoták, Oege de Moor, Damien Sereni, Ganesh Sittampalam, Julian Tibble |
GPCE | 5 |
| 2005 | Adding trace matching with free variables to AspectJabstractAn aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspect can make are confined to the current action: it is not possible to directly observe the history of a computation.Recently, there have been several interesting proposals for new history-based language features, most notably by Douence et al. and by Walker and Viggers. In this paper, we present a new history-based language feature called tracematches that enables the programmer to trigger the execution of extra code by specifying a regular pattern of events in a computation trace. We have fully designed and implemented tracematches as a seamless extension of AspectJ.A key innovation in our tracematch approach is the introduction of free variables in the matching patterns. This enhancement enables a whole new class of applications in which events can be matched not only by the event kind, but also by the values associated with the free variables. We provide several examples of applications enabled by this feature.After introducing and motivating the idea of tracematches via examples, we present a detailed semantics of our language design, and we derive an implementation from that semantics. The implementation has been realised as an extension of the abc compiler for AspectJ. Chris Allan, Pavel Avgustinov, Aske Simon Christensen, Laurie J. Hendren, Sascha Kuzins, Ondrej Lhoták, Oege de Moor, Damien Sereni, Ganesh Sittampalam, Julian Tibble |
OOPSLA | 5 |
| 2005 | Optimising aspectJ
Pavel Avgustinov, Aske Simon Christensen, Laurie J. Hendren, Sascha Kuzins, Jennifer Lhoták, Ondrej Lhoták, Oege de Moor, Damien Sereni, Ganesh Sittampalam, Julian Tibble |
PLDI | 4 |