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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Shaye Koenig

dblp:59/5732 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1982
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 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 · 100%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 77% Transaction processing and concurrency control · 23%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
program transformation		 0.011982
Finite Differencing of Computable Expressions · ACM Trans. Program. Lang. Syst. 1982
Compilers and program optimization › loop optimization
strength reduction		 0.011982
Finite Differencing of Computable Expressions · ACM Trans. Program. Lang. Syst. 1982
Database system architecture and tuning
derived data maintenance		 0.011981
A Transformational Framework for the Automatic Control of Derived Data · VLDB 1981

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

transformational framework · 0.0semantics-preserving transformation · 0.0
YearPublicationVenuePosition
1982 Finite Differencing of Computable Expressions
abstract
Finite differencing is a program optimization method that generalizes strength reduction, and provides an efficient implementation for a host of program transformations including "iterator inversion."Finite differencing is formally specified in terms of more basic transformations shown to preserve program semantics.Estimates of the speedup that the technique yields are given.A full illustrative example of algorithm derivation is presented.
Robert Paige, Shaye Koenig
 ACM Trans. Program. Lang. Syst.2
1981 A Transformational Framework for the Automatic Control of Derived Data
Shaye Koenig, Robert Paige
 VLDB1