Demo Data from EDBT 2026 / reviewers in the wild / expert
Hannah Gommerstadt
dblp:173/9442
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3 · 2 first-author · 1 since 2021
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 |
Programming languages and type systems · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems › type systems › gradual typing
blame assignment |
0.2 | 1 | 2016 | Monitors and blame assignment for higher-order session types · POPL 2016 |
Programming languages and type systems › type systems › behavioral type systems
session types |
0.2 | 1 | 2016 | Monitors and blame assignment for higher-order session types · POPL 2016 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Session-typed concurrent contracts
Hannah Gommerstadt, Limin Jia 0001, Frank Pfenning |
J. Log. Algebraic Methods Program. | 1 |
| 2018 | Session-Typed Concurrent ContractsabstractIn sequential languages, dynamic contracts are usually expressed as boolean functions without externally observable effects, written within the language. We propose an analogous notion of concurrent contracts for languages with session-typed message-passing concurrency. Concurrent contracts are partial identity processes that monitor the bidirectional communication along channels and raise an alarm if a contract is violated. Concurrent contracts are session-typed in the usual way and must also satisfy a transparency requirement, which guarantees that terminating compliant programs with and without the contracts are observationally equivalent. We illustrate concurrent contracts with several examples. We also show how to generate contracts from a refinement session-type system and show that the resulting monitors are redundant for programs that are well-typed. Hannah Gommerstadt, Limin Jia 0001, Frank Pfenning |
ESOP | 1 |
| 2016 | Monitors and blame assignment for higher-order session typesabstractSession types provide a means to prescribe the communication behavior between concurrent message-passing processes. However, in a distributed setting, some processes may be written in languages that do not support static typing of sessions or may be compromised by a malicious intruder, violating invariants of the session types. In such a setting, dynamically monitoring communication between processes becomes a necessity for identifying undesirable actions. In this paper, we show how to dynamically monitor communication to enforce adherence to session types in a higher-order setting. We present a system of blame assignment in the case when the monitor detects an undesirable action and an alarm is raised. We prove that dynamic monitoring does not change system behavior for welltyped processes, and that one of an indicated set of possible culprits must have been compromised in case of an alarm. Limin Jia 0001, Hannah Gommerstadt, Frank Pfenning |
POPL | 2 |