Overview

The group develops and applies mathematics and logic to the design and analysis of algorithms and complex computational systems. The group is especially interested in bringing the clarity and insight of formal theories to hard application problems of real practical significance. For example, the group has interests in:

• algorithms for matching problems
• combinatorial search and optimization
• computational biology
• constraint programming
• graph algorithms
• modelling and analysis of complex and reactive systems
• phase transition phenomena in combinatorial problems
• probabilistic model checking
• process algebras
• programming language semantics and type systems
• quantum computation
• string algorithms
• telecommunications software and protocol analysis
• theorem proving and deductive reasoning

Many projects are collaborative, as the group aims to apply formal ideas to problems of genuine interest outside the formal community itself. Collaboration involves, for example, life scientists and communication system designers, companies in the telecommunications, software and pharmaceutical sectors, as well as government organisations.