Formal Analysis, Theory and Algorithms (FATA)

Formal Analysis, Theory and Algorithms (FATA)

Formal Analysis, Theory and Algorithms(FATA)

Professor Simon Gay, Section Lead, explains the work of the Formal Analysis, Theory and Algorithms research section.

Overview

The FATA section is led by Professor Simon Gay. It develops and applies mathematics and logic to the design and analysis of algorithms and complex computational systems. We are especially interested in bringing the clarity and insight of formal theories to hard application problems of real practical significance. For example, we have 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
  • bigraphs

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.


Section members


Group photo, May 2017. Left to right: Prof. Simon Gay, Dr Alice Miller, Dr Ornela Dardha, Prof. Muffy Calder, Dr David Manlove, Ms Laura Voinea, Ms Sofiat Olamiji Olaosebikan, Dr Gethin Norman, Mr Craig Reilly, Dr Michele Sevegnani.

Academic Staff: 

Honorary Research Fellow:

Research Staff:

Research Students:


Projects

Current:

Past:


Seminar series

FATA seminars are usually held on Tuesdays from 1pm to 2pm, see the Events tab for more details. If you would like to visit us to give a talk, please contact the FATA seminar convenor, Michele Sevegnani.