Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
VLDB 2026 Research / reviewers in the wild / expert

Rebecca Parsons Selke

dblp:81/6464 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1989
—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
Compilers and program optimization · 61% Programming languages and type systems · 39%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › language semantics
graph rewriting semantics		 0.011989
A Rewriting Semantics for Program Dependence Graphs · POPL 1989
Compilers and program optimization › dependence analysis
program dependence graph		 0.011989
A Rewriting Semantics for Program Dependence Graphs · POPL 1989
Compilers and program optimization
program transformation		 0.011989
A Rewriting Semantics for Program Dependence Graphs · POPL 1989
Programming languages and type systems › language semantics › formal semantics
operational semantics		 0.011989
A Rewriting Semantics for Program Dependence Graphs · POPL 1989

Methods — techniques the papers use, named apart from their topics

operational semantics · 0.0graph rewriting · 0.0
YearPublicationVenuePosition
1989 A Rewriting Semantics for Program Dependence Graphs
abstract
Program dependence graphs are an important program representation technique for use in vectorization, parallelization and programming environments. We present a graph rewriting semantics for program dependence graphs and prove the equivalence between the program dependence graphs semantics and the operational semantics for programs. We then propose a framework for studying program transformations using program dependence graphs and a programming language calculus based on this rewriting semantics.
Rebecca Parsons Selke
 POPL1