Anthony W. Lin
where else to find them
what they talk about
all 5 in the filters
where they keep going back
on a stage with
all 14 in the filters
who talks about the same things
- Zhilin Wu3 talks
- Matthew Hague3 talks
- Lukáš Holík9 talks
- Ondřej Lengál8 talks
- Zhilei Han2 talks
- Taolue Chen4 talks
| title | conference | date |
|---|---|---|
| Understanding Transformers through the Lens of Logic and Automata | VMCAI 2026 | 2026-01-12 |
Claim: transformers without chain-of-thought map to logico-automata classes and explain why PARITY is hard; tools: reductions to circuit complexity (AC0/ATC0)… | ||
| Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis | CPP 2026 | 2026-01-12 |
First formalization of symbolic finite transducers and core algorithms in Isabelle/HOL, using an abstract Boolean-algebra label layer plus refinement to… | ||
| Parikh's Theorem Made Symbolic | POPL 2024 | 2024-01-14 |
Construction converts symbolic automata and parametric symbolic grammars into compact numeric abstractions: an algorithm computes polynomial-time existential… | ||
| Ramsey Quantifiers in Linear Arithmetics | POPL 2024 | 2024-01-14 |
Proves an elimination procedure for Ramsey quantifiers over Linear Integer, Real, and mixed arithmetic (LIA, LRA, LIRA) that, for existential input formulas… | ||
| CertiStr: A Certified String Solver | CPP 2022 | 2022-01-17 |
CertiStr is a certified solver for strings with concatenation and regular constraints, proven correct in Isabelle/HOL-certified OCaml extraction and… | ||
| Solving String Constraints with Regex-Dependent Functions through Transducers wi | POPL 2022 | 2022-01-16 |
Introduces a new automata model, prioritized streaming string transducers, that encodes JavaScript-style regex features (greedy/lazy star, capturing groups… | ||
| nothing matches | ||