Research Areas
- algorithms and data structures
- computability and complexity
- formal languages, grammars and automata
- formal methods of software engineering
- logic, theorem proving and verification
- programming language concepts and compilers
- semantics of programs and specifications
Students
- Nicolas Robinson-O'Brien, MSc in Computer Science, 2020
A formal correctness proof of Borůvka's minimum spanning tree algorithm
Supervisor: Walter Guttmann - Sean Welsh, PhD in Philosophy, 2019
Exploratory moral code: formalizing normative decisions using non-modal deontic logic and tiered utility
Supervisors: Jack Copeland, Michael-John Turp, Christoph Bartneck and Walter Guttmann - Logan Glasson, BSc(Hons) in Computer Science, 2017
Lazy Execution in Imperative Languages
Supervisor: Walter Guttmann - Jonathan Wardell Avery, BSc(Hons) in Computer Science, 2015
A Similarity Ranking of Python Programs
Supervisors: Kourosh Neshatian and Walter Guttmann
