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
Publications (See also DBLP)
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.
24th Annual Conference on Computer Science Logic (CSL 2015)
8th International Workshop on Reachability Problems (RP 2014)
25th International Conference on Concurrency Theory (CONCUR 2014)
AutoMathA 2015. Leipzig, May 6-9, 2015
CONCUR 2015. Madrid, September 1-4, 2015
FICS 2015. Berlin, September 11-12, 2015
RP 2015. Warsaw, September 21-23, 2015
FSTTCS 2015. Bangalore, December 16-18, 2015
Michaelmas 2014: Computational Learning Theory
Michaelmas 2013: Probability and Computing
Hilary 2015: Logic and Proof