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 research interests span asymptotic properties of groups, symbolic dynamics, linear dynamical systems, formal methods, and decision problems. Much of my recent work considers the Skolem and Positivity Problems, two long-standing open decision problems, for recurrence sequences.

Download my CV.

g.j.kenison@ljmu.ac.uk

Interests
  • Automated Verification
  • Dynamical Systems
  • Formal Methods
  • Program Analysis
  • Program Synthesis
Education
  • PhD in Mathematics, 2017

    University of Warwick

  • Master of Mathematics, 2013

    University of Warwick

Publications and Preprints

(2024). Linear Loop Synthesis for Quadratic Invariants. International Symposium on Theoretical Aspects of Computer Science, STACS ‘24.

PDF Cite DOI arXiv

(2023). (Un)Solvable Loop Analysis.

Cite arXiv

(2023). Positivity Problems for Reversible Linear Recurrence Sequences. International Colloquium on Automata, Languages, and Programming, ICALP ‘23.

PDF Cite DOI

(2023). The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. International Symposium on Symbolic and Algebraic Computation, ISSAC ‘23.

PDF Cite DOI arXiv

(2023). From Polynomial Invariants to Linear Loops. International Symposium on Symbolic and Algebraic Computation, ISSAC ‘23.

PDF Cite DOI arXiv

(2022). Solving Invariant Generation for Unsolvable Loops. International Static Analysis Symposium, SAS ‘22.

Cite DOI arXiv

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

PDF Cite DOI dagstuhl

(2021). On Positivity and Minimality for Second-Order Holonomic Sequences. Mathematical Foundations in Computer Science, MFCS `21.

PDF Cite DOI dagstuhl

(2021). On Inequality Decision Problems for Low-Order Holonomic Sequences.

PDF Cite

(2020). On the Skolem Problem and prime powers. International Symposium on Symbolic and Algebraic Computation, ISSAC `20.

PDF Cite DOI arXiv

Recent Posts