George Kenison

George Kenison

Research Fellow

Liverpool John Moores University

About Me

I am a research fellow in Computer Science and Informatics at Liverpool John Moores University. Before moving to Liverpool, I was a research associate, at the Technische Universität Wien, working in Formal Verification and Program Analysis. I was previously a research associate in Infinite-State Systems and Dynamical Systems at the University of Oxford.

My academic interests lie in computational aspects of Algebraic Dynamical Systems and their applications in Verification and Program Analysis. My research advances scientific frontiers in the Theory of Computation and Computational Complexity through the design and analysis of algorithms.

Download my CV.

g.j.surname@ljmu.ac.uk

Interests
  • Theory of Computation
  • Computational Complexity
  • Algebraic Dynamical Systems
  • Program Analysis
  • Automated Verification
Education

  • PhD in Mathematics, 2017

    University of Warwick

  • Masters of Mathematics, 2013

    University of Warwick

Publications and Preprints

R. Ait El Manssour, G. Kenison, M. Shirmohammadi, A. Varonka (2024). Simple Linear Loops: Algebraic Invariants and Applications.

PDF Cite DOI arXiv

R. Ait El Manssour, G. Kenison, M. Shirmohammadi, J. Worrell (2024). Determination Problems for Orbit Closures and Matrix Groups.

PDF Cite DOI arXiv

G. Kenison (2024). The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters. International Colloquium on Automata, Languages, and Programming, ICALP ‘24.

PDF Cite DOI arXiv

D. Amrollahi, E. Bartocci, G. Kenison, L. Kovács, M. Moosbrugger, M. Stankovič (2024). (Un)Solvable Loop Analysis. Formal Methods in Systems Design.

Cite DOI arXiv

S. Hitarth, G. Kenison, L. Kovács, A. Varonka (2024). Linear Loop Synthesis for Quadratic Invariants. International Symposium on Theoretical Aspects of Computer Science, STACS ‘24.

PDF Cite DOI arXiv

G. Kenison, J. Nieuwveld, J. Ouaknine, J. Worrell (2023). Positivity Problems for Reversible Linear Recurrence Sequences. International Colloquium on Automata, Languages, and Programming, ICALP ‘23.

PDF Cite DOI

G. Kenison, K. Nosan, M. Shirmohammadi, J. Worrell (2023). The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. International Symposium on Symbolic and Algebraic Computation, ISSAC ‘23.

PDF Cite DOI arXiv

G. Kenison, L. Kovács, A. Varonka (2023). From Polynomial Invariants to Linear Loops. International Symposium on Symbolic and Algebraic Computation, ISSAC ‘23.

PDF Cite DOI arXiv

D. Amrollahi, E. Bartocci, G. Kenison, L. Kovács, M. Moosbrugger, M. Stankovič (2022). Solving Invariant Generation for Unsolvable Loops. International Static Analysis Symposium, SAS ‘22.

Cite DOI arXiv

G. Kenison (2022). On the Skolem Problem for Reversible Sequences. Mathematical Foundations in Computer Science, MFCS `22.

PDF Cite DOI dagstuhl

G. Kenison, O. Klurman, E. Lefaucheux, F. Luca, P. Moree, J. Ouaknine, M. A. Whiteland, J. Worrell (2021). On Positivity and Minimality for Second-Order Holonomic Sequences. Mathematical Foundations in Computer Science, MFCS `21.

PDF Cite DOI dagstuhl

G. Kenison, O. Klurman, E. Lefaucheux, F. Luca, P. Moree, J. Ouaknine, M. A. Whiteland, J. Worrell (2021). On Inequality Decision Problems for Low-Order Holonomic Sequences.

PDF Cite

G. Kenison, R. Lipton, J. Ouaknine, J. Worrell (2020). On the Skolem Problem and prime powers. International Symposium on Symbolic and Algebraic Computation, ISSAC `20.

PDF Cite DOI arXiv

G. Kenison, R. Sharp (2019). Statistics in conjugacy classes in free groups. Geom. Dedicata.

PDF Cite DOI arXiv

G. Kenison, R. Sharp (2017). Orbit counting in conjugacy classes for free groups acting on trees. J. Topol. Anal..

PDF Cite DOI arXiv

Recent Posts

Summer Workshops (2023)
I am co-organising two workshops in July 2023: WORReLL'23 (see here) and Autobóz 2023 (see here). WORReLL'23 WORRELL'23 is a one-day satellite workshop at ICALP'23. The aim of the workshop is to bring together researchers from the community and showcase cutting-edge research on Reachability, Recurrences, and Loops.
Jun 1, 2023 1 min read
Summer Workshops (2023)
Solving Invariant Generation for Unsolvable Loops
Marcel Moosbrugger presented our joint work (see here) on invariant generation for unsolvable loops at the ACM SIGPLAN 29th Static Analysis Symposium (SAS 2022). Abstract Automatically generating invariants, key to computer-aided analysis of probabilistic and deterministic programs and compiler optimisation, is a challenging open problem.
May 23, 2023 1 min read
Solving Invariant Generation for Unsolvable Loops
Dynamical Systems and Program Analysis
James (Ben) Worrell gave a keynote talk on algorithmic analysis of dynamical systems at the 48th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2021). During his talk, Ben presented some of our ongoing work on inequality decision problems for low-order holonomic sequences (see here).
Apr 6, 2022 2 min read
Dynamical Systems and Program Analysis
On minimality and positivity for second-order holonomic sequences
Slides on minimality and positivity for second-order holonomic sequences. Variations given at Mathematical Foundations of Computer Science 2021 (MFCS, Tallinn), the joint Forsyte (TU Wien) and Institute of Science & Technology Seminar, and the Open University Dynamical Systems Seminar.
Oct 1, 2021 1 min read
On minimality and positivity for second-order holonomic sequences
Holonomic techniques, periods, and decision problems
Joël Ouaknine gave an invited talk on holonomic techniques, periods, and decision problems at Foundations of Software Technology and Theoretical Computer Science conference (FSTTCS 2020). During his talk Joël presented some of our ongoing work on inequality decision problems for low-order holonomic sequences (see here).
Dec 4, 2020 1 min read
Holonomic techniques, periods, and decision problems
See all posts