Demo Data from EDBT 2026 / reviewers in the wild / expert
Spencer Van Koevering
dblp:320/0021
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 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.
| Theoretical computer science
1 paper |
Logic in computer science · 75% Automata and formal languages · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › algebraic logic
equational logic |
0.9 | 1 | 2025 | Weighted GKAT: Completeness and Complexity · ICALP 2025 |
Logic in computer science › algebraic logic › kleene algebra
kleene algebra with tests |
0.9 | 1 | 2025 | Weighted GKAT: Completeness and Complexity · ICALP 2025 |
Logic in computer science
program semantics |
0.9 | 1 | 2025 | Weighted GKAT: Completeness and Complexity · ICALP 2025 |
Automata and formal languages
weighted automata |
0.9 | 1 | 2025 | Weighted GKAT: Completeness and Complexity · ICALP 2025 |
Methods — techniques the papers use, named apart from their topics
operational semantics · 0.9bisimulation equivalence · 0.9axiomatization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Weighted GKAT: Completeness and ComplexityabstractWe propose Weighted Guarded Kleene Algebra with Tests (wGKAT), an uninterpreted weighted programming language equipped with branching, conditionals, and loops. We provide an operational semantics for wGKAT using a variant of weighted automata and introduce a sound and complete axiomatization. We also provide a polynomial time decision procedure for bisimulation equivalence. Spencer Van Koevering, Wojciech Rozowski, Alexandra Silva 0001 |
ICALP | 1 |
| 2022 | Provable Probabilistic Safety and Feasibility-Assured Control for Autonomous Vehicles using Exponential Control Barrier FunctionsabstractWith the increasing need for safe control in the domain of autonomous driving, model-based safety-critical control approaches are widely used, especially Control Barrier Function (CBF)-based approaches. Among them, Exponential CBF (eCBF) is particularly popular due to its realistic applicability to high-relative-degree systems. However, for most of the optimization-based controllers utilizing CBF-based constraints, solution feasibility is a common issue arising from potential conflict among different constraints. Moreover, how to incorporate uncertainty into the eCBF-based constraints in high-relative-degree systems to account for safety remains an open challenge. In this paper, we present a novel approach to extend an eCBF-based safe critical controller to a probabilistic setting to handle potential motion uncertainty from system dynamics. More importantly, we leverage an optimization-based technique to provide a solution feasibility guarantee in run time, while ensuring probabilistic safety. Lane changing and intersection handling are demonstrated as two use cases, and experiment results are provided to show the effectiveness of the proposed approach. Spencer Van Koevering, Yiwei Lyu 0002, John M. Dolan |
IV | 1 |