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; infinite-state, probabilistic, and real-time verification
Publications (See also DBLP)
On the Complexity of Matrix Powering in Low Dimensions (with E. Galby and J. Ouaknine). Submitted 2015.
The Polyhedron-Hitting Problem (with V. Chonev and J. Ouaknine). Accepted to SODA 2015.
On Termination of Integer Linear Loops (with J. Ouaknine and J. Sousa-Pinto). Accepted to 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.
8th International Workshop on Reachability Problems (RP 2014)
17th Conference on Foundations of Software Science and Computation Structures (FOSSACS 2014)
25th International Conference on Concurrency Theory (CONCUR 2014)
AutoMathA 2015: Jewels of Automata: from Mathematics to Applications. Leipzig, May 6th--9th, 2015.
Michaelmas 2014: Computational Learning Theory
Michaelmas 2013: Probability and Computing
Hilary 2014: Logic and Proof
Tulip: model checking LTL on interval Markov chains.