University of Oxford Logo University of OxfordDepartment of Computer Science - Home
On Facebook
Facebook
Follow us on twitter
Twitter
Linked in
Linked in
Flickr
Flickr
Google plus
Google plus
Digg
Digg
Pinterest
Pinterest
Stumble Upon
Stumble Upon

Michael Vanden Boom

I am a Departmental Lecturer in Computer Science at the University of Oxford.

From November 2012 to September 2015, I was a research assistant for Professor Michael Benedikt. During Academic Year 2014−2015, I was also a Stipendiary Lecturer in Computer Science at Merton College, responsible for organising and running undergraduate computer science tutorials in college.

I completed my DPhil (PhD) at the University of Oxford between October 2009−October 2012 under the supervision of Professor Luke Ong.


Research Interests

I am interested in solving problems about logic and automata arising in verification and database theory.


Publications

List of publications on DBLP.
List of publications with downloads.

Selected Talks

A Step Up in Expressiveness of Decidable Fixpoint Logics.
Oxford OASIS Seminar. Oxford, April 2016. [slides]
Fixpoint logics with tree-like models.
Oxford Information Systems Seminar. Oxford, November 2015. [slides]
Interpolation with decidable fixpoint logics.
Highlights of Logic, Automata, and Games. Prague, September 2015. [slides]
Automata-logic connection for guarded logics
Invited talk at special session of CiE. Bucharest, July 2015. [slides]
Effective interpolation for guarded logics.
Imperial College Logic Seminar. London, December 2014. [slides]
Interpolation for guarded logics.
Highlights of Logic, Automata, and Games. Paris, September 2014. [slides]
Automata characterizations of WMSO.
LIAFA, University of Paris 7, LAAG Seminar. Paris, March 2014.
(2 hour blackboard tutorial)
Deciding the weak definability of Buechi definable tree languages.
Queen Mary Theory Group Seminar. London, November 2013. [slides]

Teaching

For Academic Year 2016−2017, I am
I have previously given lectures for
I have given tutorials or classes for the following courses:
  • Functional Programming
  • Design and Analysis of Algorithms
  • Linear Algebra
  • Introduction to Formal Proof
  • Models of Computation
  • Logic and Proof
  • Foundations of Computer Science
  • Automata, Logic, and Games