VLDB 2026 Research / reviewers in the wild / expert
Edith Deak
dblp:91/3665
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1981
—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 · 100% | |
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
program transformation |
0.0 | 1 | 1981 | A Transformational Derivation of a Parsing Algorithm in a High-Level Language · IEEE Trans. Software Eng. 1981 |
Compilers and program optimization › program transformation › program derivation
transformational derivation |
0.0 | 1 | 1981 | A Transformational Derivation of a Parsing Algorithm in a High-Level Language · IEEE Trans. Software Eng. 1981 |
Automata and formal languages
parsing algorithms |
0.0 | 1 | 1981 | A Transformational Derivation of a Parsing Algorithm in a High-Level Language · IEEE Trans. Software Eng. 1981 |
Methods — techniques the papers use, named apart from their topics
partial correctness · 0.0correctness-preserving transformations · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | A Transformational Derivation of a Parsing Algorithm in a High-Level LanguageabstractThis paper presents a detailed algorithm derivation scenario, using correctness preserving source-to-source transfonnations. The algorithm derived is the Cocke-Younger nodal spans parsing algorithm. We describe a high-level SETL-like specification language, and give a partial correctness formalism and a set of transformation rules which enable the combination of algorithms whose partial correctness has already been established. Edith Deak |
IEEE Trans. Software Eng. | 1 |