Faron Moller

According to our database, Faron Moller authored at least 73 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Incorporating Generative AI into Software Development Education.

Olga Petrovska, Lee Clift, Faron Moller, Rebecca Pearsall

Proceedings of the 8th Conference on Computing Education Practice, 2024

Institute of Coding in Wales Digital Skills Bootcamps - Micro-Credentials: A Pilot Project.

Casey Hopkins, Faron Moller

Proceedings of the 8th Conference on Computing Education Practice, 2024

2023

Generative AI in Software Development Education: Insights from a Degree Apprenticeship Programme.

Olga Petrovska, Lee Clift, Faron Moller

Proceedings of the 2023 Conference on United Kingdom & Ireland Computing Education Research, 2023

Digital Outreach via Theatre Productions.

Faron Moller, Geinor Styles, Luke Clement

Proceedings of the 2023 Conference on United Kingdom & Ireland Computing Education Research, 2023

Technocamps: 30 Years of Digital Education and Professional Development Throughout Wales.

Faron Moller

Proceedings of the 2023 Conference on United Kingdom & Ireland Computing Education Research, 2023

Institute of Coding in Wales Digital Skills Bootcamps - A Model for Stackable Micro-credentials.

Casey Hopkins, Faron Moller, Laura Robert

Proceedings of the 2023 Conference on United Kingdom & Ireland Computing Education Research, 2023

Technocamps: Highlighting 20 Years of Transforming Digital Education in Wales.

Tom Crick, Faron Moller

Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 2, 2023

From Asymptomatics to Zombies: Visualization-Based Education of Disease Modeling for Children.

Graham Mcneill, Max Sondag, Stewart Powell, Phoebe Asplin, Cagatay Turkay, Faron Moller, Daniel Archambault

Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems, 2023

Software Model Checking of Interlocking Programs.

Phillip James, Faron Moller, Markus Roggenbach

Proceedings of the Applicable Formal Methods for Safe Industrial Products, 2023

2020

Report on BCTCS & AlgoUK 2020.

Ulrich Berger, Faron Moller

Bull. EATCS, 2020

Hands-on Security Testing in a University Lab Environment.

Phillip James, Lauren Powell, Liam O'Reilly, Faron Moller

Proceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education, 2020

2019

Technoteach: Supporting Computing Teachers Across Wales.

Faron Moller, Stewart Powell

Proceedings of the 14th Workshop in Primary and Secondary Computing Education, 2019

Teaching Discrete Mathematics to Computer Science Students.

Faron Moller, Liam O'Reilly

Proceedings of the Formal Methods Teaching - Third International Workshop and Tutorial, 2019

Visualising Railway Safety Verification.

Filippos Pantekis, Phillip James, Liam O'Reilly, Daniel Archambault, Faron Moller

Proceedings of the Formal Techniques for Safety-Critical Systems, 2019

Teaching Them Early: Formal Methods in School.

Faron Moller, Liam O'Reilly, Stewart Powell, Casey Denner

Proceedings of the Formal Methods - Fun for Everybody - First International Workshop, 2019

Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -.

Antonio Cerone, Markus Roggenbach, James H. Davenport, Casey Denner, Marie Farrell, Magne Haveraaen, Faron Moller, Philipp Körner, Sebastian Krings, Peter Csaba Ölveczky, Bernd-Holger Schlingloff, Nikolay V. Shilov, Rustam Zhumagambetov

Proceedings of the Formal Methods - Fun for Everybody - First International Workshop, 2019

Teaching Computing via a School Placement.

Faron Moller, Stewart Powell

Proceedings of the 3rd Conference on Computing Education Practice, 2019

2017

A Specification Theory of Real-Time Processes.

Chris Chilton, Marta Z. Kwiatkowska, Faron Moller, Xu Wang

Proceedings of the Concurrency, Security, and Puzzles, 2017

2016

OnTrack: The Railway Verification Toolset - Extended Abstract.

Phillip James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Helen Treharne, Xu Wang

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

2015

Technocamps: Advancing Computer Science Education in Wales.

Tom Crick, Faron Moller

Proceedings of the Workshop in Primary and Secondary Computing Education, 2015

2014

Techniques for modelling and verifying railway interlockings.

Phillip James, Faron Moller, Nguyen Hoang Nga, Markus Roggenbach, Steve A. Schneider, Helen Treharne

Int. J. Softw. Tools Technol. Transf., 2014

On modelling and verifying railway interlockings: Tracking train lengths.

Phillip James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve A. Schneider, Helen Treharne

Sci. Comput. Program., 2014

Visualising Timed CSP Train Simulations for Capacity.

Lloyd Roberts, Mike Smith, Faron Moller, Markus Roggenbach

Proceedings of the Theory and Practice of Computer Graphics, 2014

2013

Modelling Computing Systems - Mathematics for Computer Science.

Faron Moller, Georg Struth

Undergraduate Topics in Computer Science, Springer, ISBN: 978-1-84800-322-4, 2013

Guest Editorial.

Jan A. Bergstra, Jens Blanck, Faron Moller, Stanley S. Wainer

Comput. J., 2013

Verification of Scheme Plans Using CSP $$||$$ | | B.

Phillip James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve A. Schneider, Helen Treharne, Matthew Trumble, David M. Williams

Proceedings of the Software Engineering and Formal Methods, 2013

Verification of Solid State Interlocking Programs.

Phillip James, Andy Lawrence, Faron Moller, Markus Roggenbach, Monika Seisenberger, Anton Setzer, Karim Kanso, Simon Chadwick

Proceedings of the Software Engineering and Formal Methods, 2013

2012

Railway modelling in CSP||B: the double junction case study.

Markus Roggenbach, Faron Moller, Steve A. Schneider, Helen Treharne, Hoang Nga Nguyen

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012

The mindstorm effect: a gender analysis on the influence of LEGO mindstorms in computer science education.

Catherine Ball, Faron Moller, Reena Pau

Proceedings of the Workshop in Primary and Secondary Computing Education, 2012

Safety and Line Capacity in Railways - An Approach in Timed CSP.

Yoshinao Isobe, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach

Proceedings of the Integrated Formal Methods - 9th International Conference, 2012

Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B.

Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve A. Schneider, Helen Treharne

Proceedings of the Hardware and Software: Verification and Testing, 2012

2008

Automated Verification of Signalling Principles in Railway Interlocking Systems.

Karim Kanso, Faron Moller, Anton Setzer

Proceedings of the Eighth International Workshop on Automated Verification of Critical Systems, 2008

On the Complexity of Parity Games.

Arnold Beckmann, Faron Moller

Proceedings of the Visions of Computer Science, 2008

2006

Weak Bisimulation Approximants.

Will Harwood, Faron Moller, Anton Setzer

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2004

On the computational complexity of bisimulation, redux.

Faron Moller, Scott A. Smolka, Jirí Srba

Inf. Comput., 2004

DP lower bounds for equivalence-checking and model-checking of one-counter automata.

Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa

Inf. Comput., 2004

Preface.

Julian C. Bradfield, Faron Moller

Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

2003

Counting on CTL^*: on the expressive power of monadic path logic.

Faron Moller, Alexander Moshe Rabinovich

Inf. Comput., 2003

Deciding Bisimilarity between BPA and BPP Processes.

Petr Jancar, Antonín Kucera, Faron Moller

Proceedings of the CONCUR 2003, 2003

On the Computational Complexity of Bisimulation, Redux.

Faron Moller, Scott A. Smolka

Proceedings of the PCK50, 2003

2002

Formal Methods in Computation.

Faron Moller

Comput. J., 2002

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.

Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

Pushdown automata, multiset automata, and Petri nets.

Yoram Hirshfeld, Faron Moller

Theor. Comput. Sci., 2001

Verification on Infinite Structures.

Olaf Burkart, Didier Caucal, Faron Moller, Bernhard Steffen

Proceedings of the Handbook of Process Algebra, 2001

2000

Simulation and Bisimulation over One-Counter Processes.

Petr Jancar, Antonín Kucera, Faron Moller

Proceedings of the STACS 2000, 2000

On the star height of unary regular behaviours.

Yoram Hirshfeld, Faron Moller

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

Petri Nets and Regular Processes.

Petr Jancar, Javier Esparza, Faron Moller

J. Comput. Syst. Sci., 1999

Simulation Problems for One-Counter Machines.

Petr Jancar, Faron Moller, Zdenek Sawa

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

On the Expressive Power of CTL.

Faron Moller, Alexander Moshe Rabinovich

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Techniques for Decidability and Undecidability of Bisimilarity.

Petr Jancar, Faron Moller

Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998

A Taxonomy of Infinite State Processes.

Faron Moller

Proceedings of the MFCS '98 Workshop on Concurrency, 1998

1997

Preface.

Faron Moller

Proceedings of the Second International Workshop on Verification of Infinite State Systems, 1997

1996

A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes.

Yoram Hirshfeld, Mark Jerrum, Faron Moller

Theor. Comput. Sci., 1996

A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes.

Yoram Hirshfeld, Mark Jerrum, Faron Moller

Math. Struct. Comput. Sci., 1996

Logics for Concurrency: Structure Versus Automata.

Faron Moller

ACM Comput. Surv., 1996

Infinite Results.

Faron Moller

Proceedings of the CONCUR '96, 1996

1995

On the Computational Complexity of Bisimulation.

Faron Moller, Scott A. Smolka

ACM Comput. Surv., 1995

Checking Regular Properties of Petri Nets.

Petr Jancar, Faron Moller

Proceedings of the CONCUR '95: Concurrency Theory, 1995

Decidability Results in Automata and Process Theory.

Yoram Hirshfeld, Faron Moller

Proceedings of the Logics for Concurrency, 1995

1994

Decidable Subsets of CCS.

Søren Christensen, Yoram Hirshfeld, Faron Moller

Comput. J., 1994

A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes

Yoram Hirshfeld, Mark Jerrum, Faron Moller

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes.

Yoram Hirshfeld, Faron Moller

Proceedings of the CONCUR '94, 1994

The Mobility Workbench - A Tool for the pi-Calculus.

Björn Victor, Faron Moller

Proceedings of the Computer Aided Verification, 6th International Conference, 1994

1993

Unique Decomposition of Processes.

Robin Milner, Faron Moller

Theor. Comput. Sci., 1993

Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes

Søren Christensen, Yoram Hirshfeld, Faron Moller

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Bisimulation Equivalence is Decidable for Basic Parallel Processes.

Søren Christensen, Yoram Hirshfeld, Faron Moller

Proceedings of the CONCUR '93, 1993

1992

Behavioural Abstraction in TCCS.

Faron Moller, Chris M. N. Tofts

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

An overview of TCCS.

Faron Moller, Chris M. N. Tofts

Proceedings of the Fourth Euromicro workshop on Real-Time Systems, 1992

Verification of Parallel Systems via Decomposition.

Jan Friso Groote, Faron Moller

Proceedings of the CONCUR '92, 1992

1991

Relating Processes With Respect to Speed.

Faron Moller, Chris M. N. Tofts

Proceedings of the CONCUR '91, 1991

1990

The Nonexistence of Finite Axiomatisations for CCS Congruences

Faron Moller

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

The Importance of the Left Merge Operator in Process Algebras.

Faron Moller

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

A Temporal Calculus of Communicating Systems.

Faron Moller, Chris M. N. Tofts

Proceedings of the CONCUR '90, 1990