Margus Veanes
where else to find them
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski2 editions2023–2026
all 4 in the filters
on a stage with
all 17 in the filters
who talks about the same things
- Olli Saarikivi3 talks
- Ian Erik Varatalu2 talks
- Ekaterina Zhuchko3 talks
- Tomáš Vojnar4 talks
- Nikolaj Bjørner9 talks
- Konstantinos Mamouras11 talks
| title | conference | date |
|---|---|---|
| EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination | PLDI 2026 | 2026-06-15 |
Introduces Extended Regular Expressions with Quantifiers (EREQ) that translate wMSO to a regex-like formalism via a linear-time translation and eliminate… | ||
| Symbolic Automata: omega-Regularity Modulo Theories | POPL 2025 | 2025-01-19 |
Generalizes symbolic automata to omega-regular languages by introducing symbolic transition terms and symbolic derivatives, defines Alternating Buchi (ABW_A)… | ||
| RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and(…) | POPL 2025 | 2025-01-19 |
RE# is a derivative-based regex engine built on symbolic derivatives that avoids backtracking, adds intersection and complement plus restricted lookarounds… | ||
| Lean Formalization of Extended Regular Expression Matching with Lookarounds | CPP 2024 | 2024-01-15 |
Formalizes an extended regular‑expression matcher in Lean 4 formalization that models predicates with an effective Boolean algebra, represents positions as… | ||
| Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics | PLDI 2023 | 2023-06-17 |
A derivative-based algorithm produces input-linear matching without actual backtracking while preserving PC (backtracking) semantics and supporting anchors and… | ||
| Regex Matching with Counting-Set Automata | OOPSLA 2020 | 2020-11-15 |
Paper builds a counting-set automata implementation (a CA prototype in Microsoft’s automata library) that determinises regexes with counters without exploding… | ||
| nothing matches | ||