Demo Data from EDBT 2026 / reviewers in the wild / expert
Steve M. Shaner
dblp:25/3758
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 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 |
Program verification · 77% Requirements engineering and software design · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program verification
modular verification |
0.1 | 1 | 2007 | Modular verification of higher-order methods with mandatory calls specified by model programs · OOPSLA 2007 |
Requirements engineering and software design
design patterns |
0.0 | 1 | 2007 | Modular verification of higher-order methods with mandatory calls specified by model programs · OOPSLA 2007 |
Methods — techniques the papers use, named apart from their topics
trace-based specification · 0.1higher-order logic · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services
Hridesh Rajan, Jia Tao 0001, Steve M. Shaner, Gary T. Leavens |
ESOP | 3 |
| 2007 | Modular verification of higher-order methods with mandatory calls specified by model programsabstractWhat we call a''higher-order method" (HOM) is a method that makes mandatory calls to other dynamically-dispatched methods. Examples include template methods as in the Template method design pattern and notify methods in the Observer pattern. HOMs are particularly difficult to reason about, because standard pre- and postcondition specifications cannot describe the mandatory calls. For reasoning about such methods, existing approaches use either higher order logic or traces, but both are complex and verbose. Steve M. Shaner, Gary T. Leavens, David A. Naumann |
OOPSLA | 1 |