James Worrell
where else to find them
what they talk about
where they keep going back
- POPL4 editions2021–2026
on a stage with
all 13 in the filters
who talks about the same things
- Mahsa Shirmohammadi2 talks
- Joël Ouaknine2 talks
- Toghrul Karimov2 talks
- Anton Varonka2 talks
- Sharon Shoham13 talks
- Thomas Reps20 talks
| title | conference | date |
|---|---|---|
| Determination Problems for Orbit Closures and Matrix Groups | POPL 2026 | 2026-01-11 |
Gives a concrete algorithm: a polynomial-space procedure that decides, given an algebraic variety and a number s, whether the variety equals the orbit closure… | ||
| On Learning Polynomial Recursive Programs | POPL 2024 | 2024-01-14 |
Introduces P-finite automata, a generalisation of weighted automata whose transition weights are polynomials in the input position and which over a unary… | ||
| What's Decidable about Linear Loops? | POPL 2022 | 2022-01-16 |
The paper proves decidability of MSO model checking for discrete-time linear dynamical systems with semialgebraic predicates provided every predicate is either… | ||
| Dynamical Systems and Program Analysis | POPL 2021 | 2021-01-17 |
Algorithmic verdicts: termination of deterministic linear-update loops is decidable over the reals and rationals and (recently) decidable over the integers for… | ||
| Deciding ω-Regular Properties on Linear Recurrence Sequences | POPL 2021 | 2021-01-17 |
A procedure inputs a prefix‑independent ω‑regular condition and a linear recurrence sequence and decides whether the sequence’s sign word satisfies it, but… | ||
| Polynomial Invariants for Affine Programs | SAS 2020 | 2020-11-18 |
Claims an algorithm that computes a finite basis of all polynomial invariants for affine loops by reducing invariant synthesis to algebraic-geometry problems… | ||
| nothing matches | ||