Alexis Le Glaunec
where else to find them
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski2 editions2024–2025
- OOPSLA2 editions2023–2024
on a stage with
all 7 in the filters
who talks about the same things
- Konstantinos Mamouras11 talks
- Lingkun Kong3 talks
- Agnishom Chattopadhyay3 talks
- Margus Veanes6 talks
- Olli Saarikivi3 talks
- Clément Pit-Claudel17 talks
| title | conference | date |
|---|---|---|
| Membership Testing for Semantic Regular Expressions | PLDI 2025 | 2025-06-16 |
Presents a concrete two-pass NFA-based algorithm that converts a SemRE and input into a linear-size query graph then runs DP to check satisfiable paths… | ||
| HybridSA: GPU Acceleration of Multi-Pattern Regex Matching using Bit Parallelism | OOPSLA 2024 | 2024-10-20 |
HybridSA is a heterogeneous CPU–GPU engine that compiles regexes (Glushkov NFAs) into bit masks and runs bit-parallel shift-and extensions as many small CUDA… | ||
| Static Analysis for Checking the Disambiguation Robustness of Regular Expressions | PLDI 2024 | 2024-06-24 |
Defines robustness as agreement between POSIX vs greedy match extraction and proves the decision problem PSPACE-complete. Builds a greedy NFA model and reduces… | ||
| Regular Expression Matching using Bit Vector Automata | OOPSLA 2023 | 2023-10-23 |
Presents a new automaton model called NBVA that simulates nondeterministic counter automata by manipulating per-state bit vectors, using rotations, single-bit… | ||
| nothing matches | ||