Computer Science
University | Department | Staff | Technocamps

Faron G Moller, BSc (UBC), MMath (Waterloo), PhD (Edinburgh), CITP, CMath, CSci, FLSW, FBCS, FIMA
Professor of Computer Science

Research: Concurrency theory, particularly verification problems for infinite state automata; modal and temporal logic.

Courses:
CS_116: Modelling Computing Systems
CS_332: Designing Algorithms
CS_M23: Formal Methods for System Reliability


Contact:
tel: (+44) (0)1792 295 160
fax: (+44) (0)1792 295 708
email: F.G.Moller@swansea.ac.uk
post: Department of Computer Science, Swansea University,
Singleton Park, Swansea SA2 8PP,  UK

Useful links

Selected Recent Publications

  1. Rupert Ward, Tom Crick, James H. Davenport, Paul Hanna, Alan Hayes, Alastair Irons, Keith Miller, Faron Moller, Tom Prickett, Julie Walters, Using skills profiling to enable badges and micro-credentials to be incorporated into higher education courses. Journal of Interactive Media in Education 2023. DOI: https://doi.org/10.5334/jime.807
  2. Faron Moller and Geinor Styles and Luke Clement and Debbie Webster, Theatre Meets STEM Outreach: A Marriage Made in South Wales. Theatre About Science 2023: Coimbra, November 2023.
  3. Tom Crick and Faron Moller, Technocamps: Highlighting 20 Years of Transforming Digital Education in Wales. Proceedings of ITiCSE 2023: Innovation and Technology in Computer Science Education, ACM, Turku, July 2023.
  4. Graham McNeill, Max Sondag, Stewart Powell, Phoebe Asplin, Cagatay Turkay, Faron Moller and Dan Archambault, From Asymptotics to Zombies: Visualization-Based Education of Disease Modeling for Children. Proceedings of CHI'23: Human Factors in Computing Systems, ACM, Hamburg, April 2023.
  5. Faron Moller, Stewart Powell, Phoebe Asplin, Dan Archambault, Cagatay Turkay, Graham McNeill and Max Sondag, Modelling Zombies and Other Diseases. Proceedings of CTE-STEM'22: Sixth APSCE International Conference on Computational Thinking and STEM Education, pages 18-21, TU Delft Open Publishing, Delft, June 2022.
  6. Simon Chadwick,Phillip James, Faron Moller, Markus Roggenbach and Thomas Werner, A Journey through Software Model Checking of Interlocking Programs. Springer Lecture Notes in Computer Science 13036:495-497, 2021. Proceedings of ISoLa 2021, Rhodes, October 2021.
  7. Faron Moller, Liam O'Reilly, Stewart Powell and Casey Denner, Teaching Them Early: Formal Methods in School. Springer Communications in Computer and Information Science 1301:173-190, 2021.
  8. Antonio Cerone, Markus Roggenbach, James Davenport, Casey Denner, Marie Farrell, Magne Haveraaen, Faron Moller, Philipp Körner, Sebastian Krings, Peter Csaba Ölveczky, Bernd-Holger Schlingloff, Nikolay Shilov,and Rustam Zhumagambetov, Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering. Springer Communications in Computer and Information Science 1301:1-26, 2021.
  9. Phillip James, Lauren Powell, Liam O'Reilly and Faron Moller, Hands-on security testing in a university lab environment. Proceedings of ITiCSE 2020: Innovation and Technology in Computer Science Education, pp68-74, ACM, Trondheim, June 2020.
  10. Filippos Pantekis, Phillip James, Liam O'Reilly, Daniel Archambault and Faron Moller, Visualising railway safety verification. Springer Communications in Computer and Information Science 1165:95-105, 2020.
  11. Faron Moller and Liam O'Reilly, On Teaching Discrete Mathematics to Freshman Computer Science Students. Journal of Higher Education Theory and Practice 19(8):25-38, 2019.
  12. Faron Moller and Liam O'Reilly, Teaching Discrete Mathematics to Computer Science Students. Springer Lecture Notes in Computer Science 11758:150-164, 2019.
  13. Faron Moller and Stewart Powell, Technoteach: Supporting Computing Teachers Across Wales. Proceedings of WiPSCE'19: the 14th Workshop in Primary and Secondary Computing Education, Article No 9, pp1-2, ACM Press, Glasgow, October 2019.
  14. Faron Moller and Stewart Powell, Teaching computing via a school placement. Proceedings of CEP'19: the 3rd Conference on Computing Education Practice, ACM Press, Durham, January 2019.
  15. Faron Moller and Tom Crick, A university-based model for supporting computer science curriculum reform. Journal of Computers in Education 5(4):415-434, 2018.
  16. Chris Chilton, Marta Kwiatkowska, Faron Moller and Xu Wang, A specification theory of real-time processes. Springer Lecture Notes in Computer Science 10160:1-21, 2017.
  17. Phil James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Helen Treharne and Xu Wang, OnTrack: The Railway Verification Toolset (Extended Abstract). Springer Lecture Notes in Computer Science 9953:294-296, 2016.
  18. Tom Crick and Faron Moller, A National Engagement Model for Developing Computer Science Education in Wales. Proceedings of ISSEP'16: the 9th International Conference on Informatics in Schools, pp1-12, Munster, October 2016. http://issep2016.ens-cachan.fr/ISSEP_2016_Proceedings.pdf
  19. Tom Crick and Faron Moller, Technocamps: Advancing Computer Science Education in Wales. Proceedings of WiPSCE'15: the 10th Workshop in Primary and Secondary Computing Education, J. Gal-Exer, S Sentance and J Vahrenhold (editors), ACM Press, pp 121-126, London, November 2015.
  20. Phil James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve Schneider and Helen Treharne, Decomposing scheme plans to manage verification complexity. Proceedings of FORMS/FORMAT 2014: the 10th Symposium of Formal Methods. (Received Best paper presentation award at the conference.)
  21. Phil James, Faron Moller, Hoang Nga Nguyen Markus Roggenbach, Steve Schneider and Helen Treharne, Towards the verification of bidirectional railway models in CSP||B. Proceedings of AVOCS'14: 14th International Workshop on Automated Verification of Critical Systems, Twente, September 2014.)
  22. Phil James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve Schneider and Helen Treharne, On modelling and verifying railway interlockings: Tracking train lengths. Science of Computer Programming, 96:315-336, 2014.
  23. Phil James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve Schneider and Helen Treharne, Techniques for modelling and verifying railway interlockings. International Journal of Software Tools for Technology Transfer, 16:685-711, 2014.
  24. Lloyd Roberts, Mike Smith, Faron Moller and Markus Roggenbach, Visualising Timed CSP Train Simulations for Capacity. Proceedings of TPCG'14: Theory and Practice of Computer Graphics, pp91-93, Leeds, September 2014.)
  25. Phil James, Karim Kanso, Andrew Lawrence, Faron Moller, Markus Roggenbach, Monika Seisenberger, Anton Setzer and Simon Chadwick, Verification of solid state interlocking programs. Springer Lecture Notes in Computer Science 8368:253-268, 2014.
  26. Phil James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve Schneider, M Trumble, Helen Treharne and D Williams, Verification of scheme plans using CSP||B. Springer Lecture Notes in Computer Science 8368:189-204, 2014.
  27. Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve Schneider and Helen Treharne, Defining and model checking abstractions of complex railway models using CSP||B. Springer Lecture Notes in Computer Science 7857:193-208, 2013.
  28. Faron Moller and Liam O'Reilly, Formal Methods for First Years. Proceedings of FWFM'13: Fun With Formal Methods Workshop, affiliated with the 25th Int. Conf. on Computer Aided Verification (CAV 2013), Saint Petersburg, July 2013.
  29. Catherine Ball, Faron Moller and Reena Pau, The Mindstorm Effect: A Gender Analysis on the Influence of LEGO Mindstorms in Computer Science Education. Proceedings of WiPSCE'12: Workshop in Primary and Secondary Computing Education, Hamburg, November 2012.
  30. Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve Schneider and Helen Treharne, Railway modelling in CSP||B: The double junction case study. Electronic Communications of the EASST, Vol 53 (15 pages).
  31. Yoshinao Isobe, Faron Moller, Hoang Nga Nguyen and Markus Roggenbach, Safety and line capacity in railways. Proceedings of iFM'12: The 9th International Conference on Integrated Formal Methods. Springer Lecture Notes in Computer Science 7321:54-68, Pisa, June 2012.
  32. Marc Fontaine, Andy Gimblett, Faron Moller, Hoang Nga Nguyen and Markus Roggenbach, Timed CSP Simulator. Proceedings of iFM'12 Posters & Tool demos session: The 9th International Conference on Integrated Formal Methods pages 41-45, Pisa, June 2012.
  33. Yoshinao Isobe, Faron Moller, Hoang Nga Nguyen and Markus Roggenbach, Using CSP||B and ProB for railway modelling. Proceedings of iFM'12 Posters & Tool demos session: The 9th International Conference on Integrated Formal Methods pages 31-35, Pisa, June 2012.
  34. Karim Kanso, Faron Moller and Anton Setzer, Automated Verification of Signalling Principles in Railway Interlockings. Electronic Notes in Theoretical Computer Science 250:19-31, 2009.
  35. Arnold Beckmann and Faron Moller, On the Complexity of Parity Games. Proceedings of BCS'08: Visions of Computer Science, London, September 2008, pp237-247.
  36. Will Harwood, Faron Moller and Anton Setzer, Weak Bisimulation Approximants. Proceedings of CSL'06: The 15th International Conference on Computer Science Logic, Lecture Notes in Computer Science 4207:365-379, Szeged, Hungary, September 2006.
  37. Will Harwood and Faron Moller, Weak Bisimulation Approximants. Selected Papers from the CALCO Young Researchers Workshop (CALCO-jnr 2005), Peter Mosses, John Power and Monika Seisenberger (editors), Research Report CSR 18-2005, pages 27-39, Swansea University, 2005.
  38. Julian Bradfield and Faron Moller, Preface to the Proceedings of the 6th International Workshop on Verification of Infinite-State Systems (Infinity 2004). Electronic Notes in Theoretical Computer Science 138(3):1, 2005.
  39. Faron Moller, Scott Smolka and Jiri Srba, On the Computational Complexity of Bisimulation, Redux. Information and Computation 194(2):129-143, 2004.
  40. Petr Jancar, Antonin Kucera, Faron Moller and Zdenek Sawa, DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation 188(1):1-19, 2004.
  41. Faron Moller and Alexander Rabinovich, Counting on CTL*: On the Expressive Power of Monadic Path Logic. Information and Computation 184:147-159, 2003.
  42. Petr Jancar, Antonin Kucera and Faron Moller, Deciding bisimilarity between BPA and BPP processes. Proceedings of CONCUR'03: The 14th International Conference on Concurrency Theory, R. Amadio and D. Lugiez (editor), Lecture Notes in Computer Science 2761:159-173, Marseille, September 2003.
  43. Petr Jancar, Antonin Kucera, Faron Moller and Zdenek Sawa, Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Proceedings of FOSSACS'02: Foundations of Software Science and Computation Structures, M. Nielsen (editor), Lecture Notes in Computer Science 2303:173-187, Grenoble, April 2002.
  44. Yoram Hirshfeld and Faron Moller, Pushdown automata, multiset automata, and Petri nets. Theoretical Computer Science 256:3-21, April 2001.
  45. Johan Larsson and Faron Moller, Algorithm = Iterator + Visitor. Journal of Object Oriented Programming (online, http://www.joopmag.com), December 2001.
  46. Olaf Burkart, Didier Caucal, Faron Moller and Bernhard Steffen, Verification over Infinite States. Chapter in the Handbook of Process Algebra, J. Bergstra, A. Ponse and S.A. Smolka (editors), pp545-623, Elsevier Publishers, 2001.
  47. Yoram Hirshfeld and Faron Moller, On the star height of unary regular behaviours. In Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling, and M. Tofte (editors), pp497-509, MIT Press, 2000.
  48. Petr Jancar, Antonin Kucera and Faron Moller, Simulation and bisimulation over one-counter processes. Proceedings of STACS'00: The 17th International Symposium on Theoretical Aspects of Computer Science, H. Reichel and S. Tison (editors), Lecture Notes in Computer Science 1770:334-345, Lille, February 2000.
  49. Javier Esparza, Petr Jancar and Faron Moller, Petri nets and regular processes. Journal of Computer and Systems Sciences 59(3):476-503, December 1999.
  50. Petr Jancar and Faron Moller, Techniques for decidability and undecidability for bisimilarity. Proceedings of CONCUR'99: The 10th International Conference on Concurrency Theory, J.C.M. Baeten and S. Mauw (editors), Lecture Notes in Computer Science 1664:30-45, Eindhoven, August 1999.
  51. Faron Moller and Alexander Rabinovich, On the expressive power of CTL*. Proceedings of LICS'99: The 14th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, pp360-369, Trento, July 1999.
  52. Petr Jancar, Faron Moller and Zdenek Sawa, Simulation problems for one-counter machines. Proceedings of SOFSEM'99: The 26th Seminar on Current Trends in Theory and Practice of Informatics, J. Pavelka, G. Tel and M. Bartosek (editors), Lecture Notes in Computer Science 1725:404-413, Milovy, November/December 1999.
  53. Faron Moller. A Taxonomy of Infinite State Processes. Electronic Notes in Theoretical Computer Science 18, 1998.
  54. Faron Moller. The Specification of an Asynchronous Router. IEEE Aerospace and Electronics Systems Magazine 12(3):38-44, 1997.
  55. Faron Moller. Logics for concurrency: structure versus automata. ACM Computing Surveys 28(A)(4), December 1996.
  56. Various Authors. Strategic directions in concurrency research.
    57. (Contributing author, edited by R. Cleaveland and S. Smolka.) ACM Computing Surveys 28(4):607-625, December 1996.
  57. Yoram Hirshfeld, Mark Jerrum and Faron Moller. A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Journal of Mathematical Structures in Computer Science 6:251-259, 1996.
  58. Yoram Hirshfeld, Mark Jerrum and Faron Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science 158:143-159, 1996.
  59. Faron Moller, Infinite Results. Proceedings of CONCUR'96: The 7th International Conference on Concurrency Theory, U. Montanari and V. Sassone (editors), Lecture Notes in Computer Science 1119:195-216, Pisa, August 1996.