This could cover a broad range of systems/protocols, such as synchronization protocols, gossip protocols, ad-hoc networks, etc. and a wide variety of potential formal verification techniques, such as theorem-provers, model-checkers, SMT solvers, runtime verification, etc. Generally, we wish to study, formalise and utilise commonality and abstractions across these systems, for example in terms of sensor geography, shape, neighbours, movement, protocol, reliability, etc. The project is flexible within this general area given the applicant’s background and interests and a sample project is given below.

Verification for Large Populations Sensors or robot swarms may have simple underlying algorithms/programs that interact with each other to provide emergent behaviour. As well as simulations and real robot/sensor experiments, formal verification allows robot swarm or sensor engineers to check the required properties of the network do hold prior to deployment. One issue is that for large networks or populations, formal verification may not be viable. This project involves developing and applying formal verification techniques so they can be applied to large networks of individual robots or sensors.

Funding Notes

This is a fully funded position for UK/EU students and covers their tuition fee and living expenses for three years. Applicants should have or be about to achieve, either a first class degree or a distinction at masters level in Computer Science or Mathematical Logic. Applications can be made via View Website The closing date for applications is Monday 30th April 2018