University of Oxford Logo University of OxfordDepartment of Computer Science - Home
Linked in
Linked in
Follow us on twitter
On Facebook
James Worrell James Worrell
Professor of Computer Science
Department of Computer Science, University of Oxford
Fellow of Green Templeton College
Office: 416 Wolfson Building
Address: Department of Computer Science,
Wolfson Building, Parks Road, Oxford OX1 3QD, UK
Tel: +44 (0)1865 273 843 / Fax: +44 (0)1865 273 839

      Logic in computer science; linear dynamical systems; automated verification
      EPSRC Established-Career Fellowship: Verification of Linear Dynamical Systems
      Publications (See also DBLP)
      Short CV

Recent Papers:
      Polynomial Invariants for Affine Programs. (with E. Hrushovski, J. Ouaknine, A. Pouly). LICS 2018.
      The Polyhedral Escape Problem is Decidable. (with J. Ouaknine and J, Sousa-Pinto). Accepted to HSCC 2017.
      On the Skolem Problem for Continuous Linear Dynamical Systems. (with V. Chonev and J. Ouaknine). ICALP 2016.
      Proving the Herman Protocol Conjecture. (with M. Bruna, R. Grigore, S. Kiefer and J. Ouaknine). Submitted.
      On the Complexity of Linear Arithmetic with Divisibility. (with A. Lechner and J. Ouaknine). LICS 2015.
      Linear Recurrence Sequences and Loop Termination. (with J. Ouaknine). ACM SIGLOG News, April 2015.
      Three Variables Suffice for Real-Time Logic (with T. Antonopoulos, P. Hunter and S. Raza). FOSSACS 2015.
      On the Complexity of Matrix Powering in Low Dimensions (with E. Galby and J. Ouaknine). STACS 2015.
      The Polyhedron-Hitting Problem (with V. Chonev and J. Ouaknine). SODA 2015.
      On Termination of Integer Linear Loops (with J. Ouaknine and J. Sousa-Pinto). SODA 2015.
      Complexity of Equivalence and Learning for Multiplicity Tree Automata (with I. Marusic). MFCS 2014.
      Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences (with J. Ouaknine). ICALP 2014.
      Effecitve Positivity Problems for Simple Linear Recurrence Sequences (with J. Ouaknine). ICALP 2014.
      Positivity Problems for Low-Order Linear Recurrence Sequences (with J. Ouaknine). SODA 2014.

Program Committees
      48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
      22nd International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2019)
      30th International Conference on Concurrency Theory (CONCUR 2019)
      Developments in Language Theory, 23rd International Conference (DLT 2019)
      17th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2019)
      43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)

Invited Talks
      POPL 2021. Copenhagen (online), Janunary 17-22, 2021
      SAS 2020. Chicago, November 18-20, 2020
      MOVEP 2020. Grenoble, June 22-26, 2019
      LICS 2019. Vancouver, June 24-27, 2019
      Highlights 2018. Berlin, Sept 18-21, 2018
      LATA 2018. Tel Aviv, April 9-11, 2018
      ISSAC 2017. Kaiserslautern, July 25-28, 2017

      Michaelmas 2015: Computational Learning Theory
      Hilary 2016: Logic and Proof
      Some lecture notes and expository material can be found here
Current Graduate Students
      Mehran Hosseini
      Pascale Gourdeau
Former Graduate Students
      Rastislav Lehardt
      Antonia Lechner
      Ines Marusic
      Joao Sousa-Pinto
      Ventsislav Chonev
      Mark Jenkins