OXFORD UNIVERSITY COMPUTING LABORATORY

MSc in Computer Science - Projects suggested by academics

Alexandru Baltag

Coalgebraic methods in computer science: modelling infinite objects, infinite databases and processes with potentially infinite behaviour

Combining Information by Communication: the dynamics of belief merge

Domain Theory

Dynamic-logical approaches to Quantum Computation

Finite model theory and its connections with complexity issues

Logic in Computer Science: logics for concurrent dynamic systems

Logic in Computer Science: logics for modelling information flow in multi-agent systems

Probabilistic Methods in Computer Science

Probability-Based Settings for Knowledge Update and Belief Revision

Rationality in Games and the Players' Evolving Beliefs

Semantics for concurrency

Set-theoretical topology

Michael Benedikt

Data Cleaning

XML transformation and update languages

Ani Calinescu

Biologically-inspired computing

Complex Systems

Modelling and reasoning about complex agent-based networked systems, such as the Internet, financial markets and biological systems

Pervasive Computing

Pervasive and ubiquitous computing

Stephen Cameron

Object-Oriented Splines Library

Robot Sheepdog

Bob Coecke

Quantum Computing and Quantum Information, Logic, Category Theory, Fundamental Physics

Oege de Moor

Projects in the Programming Tools Group

Alastair Donaldson

ABI-aware verification for system-level software

Software model checking for GPGPUs

Georg Gottlob

Programming with Alternation

Jotun Hein

Bioinformatics Projects

Peter Jeavons

Bioinformatics

Computational Biology

Constraint Satisfaction Problems

Geraint Jones

Compilation of a CSP-like language

Design by calculation

Logic circuit workbench

Modelling of arithmetic circuits

Techniques for the design of parallel programs and integrated circuits which provide confidence in their correctness

Stephan Kreutzer

A Game Characterisation for Inflationary Modal Logics

Computing Tree-Decompositions of Graphs

Daniel Kroening

Bug Hunting in Linux

Decision Procedures

Model Checking Multi-Cycle Paths

Separation Logic in SMT Solvers

Marta Kwiatkowska

Investigation of efficient binary decision diagram (BDD) heuristics for the modelling language of the PRISM model checker

Probabilistic Modelling and Verification

Gavin Lowe

A Casper Front End for ProVerif

Analysis of Parameterised Systems using CSP and FDR

Analysis of Security Protocols

Case studies with CSP and FDR

Case studies with probabilistic CSP

Secure Channels in CSO

Dan Olteanu

G-Store: A Storage Manager for Graph Data

Modelling Uncertainty in XML

SIGMOD 2010 Programming Contest

Uncertain Database Management Systems

Luke Ong

Foundational Structures for Concurrency

Game Semantics and Linear Logic

Lambda Calculus

Luke Ong's Projects

Semantics of Programming Languages

Types, Proofs and Categorical Logic

Joel Ouaknine

Model Checking / Timed Automata / Probabilistic Systems

David Parker

Probabilistic Model Checking and PRISM

Stephen Pulman

Efficient inference for natural language

Measures of document similarity

Michael Spivey

A debugger for Oberon

Bytecode for GeomLab

JIT translator for Oberon

Programming Language Semantics

Symbolic Computing

Type-checking for GeomLab.

Bernard Sufrin

MSc and Undergraduate Projects

Irina Voiculescu

Geometric Modelling

James Worrell

A Probabilistic LTL Model Checker

Complexity of Probabilistic Bisimilarity

Presburger Arithmetic with Divisibility

Sum of Square Roots Problem

Verifying Timed Automata

Random Image
Random Image
Random Image