Faron Moller

Faron Moller
FLSW FBCS FIMA
Faron Moller
Born
Faron George Moller

(1962-02-25) 25 February 1962 (age 62)
Trail, British Columbia, Canada
Alma mater
Scientific career
FieldsTheoretical computer science[1]
InstitutionsSwansea University
University of Strathclyde
University of Edinburgh
Swedish Institute for Computer Science
Royal Institute of Technology
Uppsala University
ThesisAxioms for Concurrency (1989)
Doctoral advisorRobin Milner
Websitewww.swansea.ac.uk/staff/f.g.moller Edit this at Wikidata

Faron George Moller (born February 25, 1962, in Trail, British Columbia) is a Canadian-born British computer scientist and expert on theoretical computer science, particularly infinite-state automata theory and temporal logic.[1] His work has focussed on structural decomposition techniques for analysing abstract models of computing systems. He is founding director of the Swansea Railway Verification Group;[2] Director of Technocamps; and Head of the Institute of Coding in Wales. In 2023, he was elected General Secretary of the Learned Society of Wales.[3][4][5][6]

Education

Moller studied mathematics and computer science as an undergraduate at the University of British Columbia, and then as a Masters student at the University of Waterloo, before going on to do a PhD supervised by Robin Milner in the Laboratory for Foundations of Computer Science at the University of Edinburgh. [7][8]

Career and research

Moller has held posts at the University of Strathclyde, University of Edinburgh, The Swedish Institute for Computer Science, The Royal Institute of Technology in Stockholm, and Uppsala University before moving to Wales as Professor of Computer Science at Swansea University in 2000.

Moller serves as director of Technocamps,[9][10] a pan-Wales schools outreach programme aimed at introducing and reinforcing Computer Science and Digital Competency within all Welsh schools and inspiring young people to study computing-based topics; and Head of the Institute of Coding in Wales.[11]

Awards and honours

Moller is a Fellow of the Learned Society of Wales (FLSW), a Fellow of the British Computer Society ( FBCS) and Fellow of the Institute of Mathematics and its Applications (FIMA), and served as President of the British Colloquium for Theoretical Computer Science for 15 years (2004-2019).[citation needed] He is a Chartered Mathematician, a Chartered Scientist, and a Chartered IT Professional.

References

  1. ^ a b Faron Moller publications indexed by Google Scholar Edit this at Wikidata
  2. ^ "Swansea Railway Verification Group".
  3. ^ F Moller, Infinite Results, in U Montanari and V Sassone (eds.), Lecture Notes in Computer Science, Volume 1119, Springer Verlag (1996), pp195–216.
  4. ^ O Burkart, D Caucal, F Moller and B Steffen, Verification over Infinite States, in J Bergstra, A Ponse and S A Smolka (eds.), Handbook of Process Algebra, Elsevier (2001), pp545–623.
  5. ^ F Moller, S A Smolka and J Srba, On the Computational Complexity of Bisimulation, Redux, Information and Computation, Volume 194(2), Elsevier (2004), pp129–143. doi:10.1016/j.ic.2004.06.003
  6. ^ F Moller and G Struth, Modelling Computing Systems, Springer-Verlag 2013. ISBN 9781848003217
  7. ^ Faron Moller at the Mathematics Genealogy Project Edit this at Wikidata
  8. ^ Faron Moller at DBLP Bibliography Server Edit this at Wikidata
  9. ^ Casey Hopkins, Faron Moller (2024) Institute of Coding in Wales Digital Skills Bootcamps – Micro-Credentials: A Pilot Project CEP '24: Proceedings of the 8th Conference on Computing Education Practice doi:10.1145/3633053.3633055
  10. ^ https://www.technocamps.com
  11. ^ https://instituteofcoding.org