Staff research interests
- Paul Anderson
- Large Scale System Configuration, GRID Fabric Management, Systems Administration.
- Stuart Anderson
- Design and analysis of dependable systems, formal proof in systems development.
- David Aspinall
- Computer security (particularly proof-carrying code), type systems for specification and programming languages, and proof development environments.
- Julian Bradfield
- Modal and temporal logics, model-checking, concurrency, independence logics, descriptive complexity and set theory, UML and modelling languages.
- Alan Bundy
- Understanding the processes of mathematical reasoning and discovery, including the processes of inference, learning, analogy, proof analysis and problem formalisation. In particular, the development of "proof plans".
- Peter Buneman
- Databases: data models, query languages, semistructured data, data provenance, databases and programming languages. Programming languages: functional programming and type systems. Bioinformatics and scientific databases. Mathematical phylogeny.
- Mary Cryan
- Randomized algorithms, especially algorithms for sampling and counting; learning theory; algorithms for computational biology.
- Kousha Etessami
- Automated verification, model checking, modeling and analysis of reactive and concurrent systems, testing, temporal logic and automata, algorithms and computational complexity, applications of logic, databases.
- Michael Fourman
- Formal models of digital systems, system-design tools, proof assistants, categorical semantics, propositional planning.
- Stephen Gilmore
- Formal methods of program development, formal specifications, software engineering, concurrent systems.
- Jane Hillston
- Stochastic process algebras, Markov processes and performance modelling.
- Paul Jackson
- Mechanical theorem proving, reactive systems, linear temporal logic.
- Mark Jerrum
- Computational complexity, randomised algorithms, stochastic processes, random structures.
- Kyriakos Kalorkoti
- Computational complexity, computer algebra, decision problems in group theory.
- John Longley
- Higher type computability, semantics of programming languages, program verification.
- Gordon Plotkin
- Applications of logic, especially: the denotational and operational semantics of programming languages; type-theory; domain-theoretic and categorical analyses of computation; general proof theory; the semantics of natural language; process calculi and computational biology.
- John Power
- Category Theory.
- Dave Robertson
- Design and deployment of multi-agent systems; large-scale, automated design and transformation of knowledge bases and problem solvers; agent-oriented software engineering.
- Donald Sannella
- Algebraic specification and formal software development; correctness of modular systems; types nd functional programming; resource certification for mobile code.
- Alexander Simpson
- Category theory, domain theory, logic, type theory.
- Alan Smaill
- Constructive logics and non-realist semantics; reflection principles and their application within automated reasoning systems; theorem proving in relation to programming.
- Ian Stark
- Semantics of computation, functional programming, concurrency, category theory and domain theory.
- Mark Steedman
- Computational linguistics, artificial intelligence, formal grammar, spoken intonation, statistical parsing, spoken language processing, animated conversational agents, computational musical analysis.
- Perdita Stevens
- Software engineering, concurrency, logic, verification.
- Colin Stirling
- Models of concurrent computation, modal and temporal logics, verification of program properties.
- Stratis Viglas
- Database systems, query optimixation, data stream processing, database theory,XML, peer-to-peer networks.
This list is generated daily from the School of Informatics Database. If you think that some information is incorrect, please contact the database administrator.