Faron Moller

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 21

Top Topics

Teacher Training

Computer Science

Top Venues

Sci. Comput. Program.

Publications

Phillip James, Faron Moller, Filippos Pantekis
OnTrack: Reflecting on domain specific formal methods for railway designs. Sci. Comput. Program. 233 (2024)
Olga Petrovska, Lee Clift, Faron Moller, Rebecca Pearsall
Incorporating Generative AI into Software Development Education. CEP (2024)
Casey Hopkins, Faron Moller
Institute of Coding in Wales Digital Skills Bootcamps - Micro-Credentials: A Pilot Project. CEP (2024)
Faron Moller
Technocamps: 30 Years of Digital Education and Professional Development Throughout Wales. UKICER (2023)
Casey Hopkins, Faron Moller, Laura Robert
Institute of Coding in Wales Digital Skills Bootcamps - A Model for Stackable Micro-credentials. UKICER (2023)
Olga Petrovska, Lee Clift, Faron Moller
Generative AI in Software Development Education: Insights from a Degree Apprenticeship Programme. UKICER (2023)
Graham Mcneill, Max Sondag, Stewart Powell, Phoebe Asplin, Cagatay Turkay, Faron Moller, Daniel Archambault
From Asymptomatics to Zombies: Visualization-Based Education of Disease Modeling for Children. CHI (2023)
Faron Moller, Geinor Styles, Luke Clement
Digital Outreach via Theatre Productions. UKICER (2023)
Phillip James, Faron Moller, Markus Roggenbach
Software Model Checking of Interlocking Programs. Applicable Formal Methods for Safe Industrial Products (2023)
Tom Crick, Faron Moller
Technocamps: Highlighting 20 Years of Transforming Digital Education in Wales. ITiCSE (2) (2023)
Phillip James, Lauren Powell, Liam O'Reilly, Faron Moller
Hands-on Security Testing in a University Lab Environment. ITiCSE (2020)
Ulrich Berger, Faron Moller
Report on BCTCS & AlgoUK 2020. Bull. EATCS 131 (2020)
Antonio Cerone, Markus Roggenbach, James Davenport, Casey Denner, Marie Farrell, Magne Haveraaen, Faron Moller, Philipp Koerner, Sebastian Krings, Peter Csaba Ölveczky, Bernd-Holger Schlingloff, Nikolay Shilov, Rustam Zhumagambetov
Rooting Formal Methods within Higher Education Curricula for Computer Science and Software Engineering - A White Paper. CoRR (2020)
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 V. Shilov, Rustam Zhumagambetov
Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -. FMFun (2019)
Faron Moller, Liam O'Reilly
Teaching Discrete Mathematics to Computer Science Students. FMTea (2019)
Filippos Pantekis, Phillip James, Liam O'Reilly, Daniel Archambault, Faron Moller
Visualising Railway Safety Verification. FTSCS (2019)
Faron Moller, Stewart Powell
Teaching Computing via a School Placement. CEP (2019)
Faron Moller, Stewart Powell
Technoteach: Supporting Computing Teachers Across Wales. WiPSCE (2019)
Faron Moller, Liam O'Reilly, Stewart Powell, Casey Denner
Teaching Them Early: Formal Methods in School. FMFun (2019)
Chris Chilton, Marta Z. Kwiatkowska, Faron Moller, Xu Wang
A Specification Theory of Real-Time Processes. Concurrency, Security, and Puzzles (2017)
Phillip James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Helen Treharne, Xu Wang
OnTrack: The Railway Verification Toolset - Extended Abstract. ISoLA (2) (2016)
Tom Crick, Faron Moller
Technocamps: Advancing Computer Science Education in Wales. WiPSCE (2015)
Phillip James, Faron Moller, Nguyen Hoang Nga, Markus Roggenbach, Steve A. Schneider, Helen Treharne
Techniques for modelling and verifying railway interlockings. Int. J. Softw. Tools Technol. Transf. 16 (6) (2014)
Phillip James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve A. Schneider, Helen Treharne
On modelling and verifying railway interlockings: Tracking train lengths. Sci. Comput. Program. 96 (2014)
Lloyd Roberts, Mike Smith, Faron Moller, Markus Roggenbach
Visualising Timed CSP Train Simulations for Capacity. TPCG (2014)
Phillip James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve A. Schneider, Helen Treharne, Matthew Trumble, David M. Williams
Verification of Scheme Plans Using CSP $$||$$ | | B. SEFM Workshops (2013)
Jan A. Bergstra, Jens Blanck, Faron Moller, Stanley S. Wainer
Guest Editorial. Comput. J. 56 (1) (2013)
Phillip James, Andy Lawrence, Faron Moller, Markus Roggenbach, Monika Seisenberger, Anton Setzer, Karim Kanso, Simon Chadwick
Verification of Solid State Interlocking Programs. SEFM Workshops (2013)
Catherine Ball, Faron Moller, Reena Pau
The mindstorm effect: a gender analysis on the influence of LEGO mindstorms in computer science education. WiPSCE (2012)
Yoshinao Isobe, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach
Safety and Line Capacity in Railways - An Approach in Timed CSP. IFM (2012)
Markus Roggenbach, Faron Moller, Steve A. Schneider, Helen Treharne, Hoang Nga Nguyen
Railway modelling in CSP||B: the double junction case study. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 53 (2012)
Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Steve A. Schneider, Helen Treharne
Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B. Haifa Verification Conference (2012)
Karim Kanso, Faron Moller, Anton Setzer
Automated Verification of Signalling Principles in Railway Interlocking Systems. Electron. Notes Theor. Comput. Sci. 250 (2) (2009)
Arnold Beckmann, Faron Moller
On the Complexity of Parity Games. BCS Int. Acad. Conf. (2008)
Will Harwood, Faron Moller, Anton Setzer
Weak Bisimulation Approximants. CSL (2006)
Julian C. Bradfield, Faron Moller
Preface. INFINITY (2004)
Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
DP lower bounds for equivalence-checking and model-checking of one-counter automata. Inf. Comput. 188 (1) (2004)
Faron Moller, Scott A. Smolka, Jirí Srba
On the computational complexity of bisimulation, redux. Inf. Comput. 194 (2) (2004)
Faron Moller, Scott A. Smolka
On the Computational Complexity of Bisimulation, Redux. PCK50 (2003)
Petr Jancar, Antonín Kucera, Faron Moller
Deciding Bisimilarity between BPA and BPP Processes. CONCUR (2003)
Faron Moller, Alexander Moshe Rabinovich
: on the expressive power of monadic path logic. Inf. Comput. 184 (1) (2003)
Faron Moller
Formal Methods in Computation. Comput. J. 45 (1) (2002)
Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. FoSSaCS (2002)
Yoram Hirshfeld, Faron Moller
Pushdown automata, multiset automata, and Petri nets. Theor. Comput. Sci. 256 (1-2) (2001)
Petr Jancar, Antonín Kucera, Faron Moller
Simulation and Bisimulation over One-Counter Processes. STACS (2000)
Yoram Hirshfeld, Faron Moller
On the star height of unary regular behaviours. Proof, Language, and Interaction (2000)
Faron Moller, Alexander Moshe Rabinovich
On the Expressive Power of CTL. LICS (1999)
Petr Jancar, Javier Esparza, Faron Moller
Petri Nets and Regular Processes. J. Comput. Syst. Sci. 59 (3) (1999)
Petr Jancar, Faron Moller, Zdenek Sawa
Simulation Problems for One-Counter Machines. SOFSEM (1999)
Petr Jancar, Faron Moller
Techniques for Decidability and Undecidability of Bisimilarity. CONCUR (1999)
Faron Moller
A Taxonomy of Infinite State Processes. Electron. Notes Theor. Comput. Sci. 18 (1998)
Faron Moller
Preface. INFINITY (1997)
Faron Moller
Infinite Results. CONCUR (1996)
Yoram Hirshfeld, Mark Jerrum, Faron Moller
A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. Math. Struct. Comput. Sci. 6 (3) (1996)
Yoram Hirshfeld, Mark Jerrum, Faron Moller
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Theor. Comput. Sci. 158 (1&2) (1996)
Faron Moller
Logics for Concurrency: Structure Versus Automata. ACM Comput. Surv. 28 (4es) (1996)
Yoram Hirshfeld, Faron Moller
Decidability Results in Automata and Process Theory. Banff Higher Order Workshop (1995)
Faron Moller, Scott A. Smolka
On the Computational Complexity of Bisimulation. ACM Comput. Surv. 27 (2) (1995)
Petr Jancar, Faron Moller
Checking Regular Properties of Petri Nets. CONCUR (1995)
Yoram Hirshfeld, Mark Jerrum, Faron Moller
A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes FOCS (1994)
Yoram Hirshfeld, Faron Moller
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. CONCUR (1994)
Søren Christensen, Yoram Hirshfeld, Faron Moller
Decidable Subsets of CCS. Comput. J. 37 (4) (1994)
Björn Victor, Faron Moller
The Mobility Workbench - A Tool for the pi-Calculus. CAV (1994)
Robin Milner, Faron Moller
Unique Decomposition of Processes. Theor. Comput. Sci. 107 (2) (1993)
Søren Christensen, Yoram Hirshfeld, Faron Moller
Bisimulation Equivalence is Decidable for Basic Parallel Processes. CONCUR (1993)
Søren Christensen, Yoram Hirshfeld, Faron Moller
Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes LICS (1993)
Faron Moller, Chris M. N. Tofts
Behavioural Abstraction in TCCS. ICALP (1992)
Jan Friso Groote, Faron Moller
Verification of Parallel Systems via Decomposition. CONCUR (1992)
Faron Moller, Chris M. N. Tofts
An overview of TCCS. RTS (1992)
Faron Moller, Chris M. N. Tofts
Relating Processes With Respect to Speed. CONCUR (1991)
Robin Milner, Faron Moller
Unique decomposition of processes. Bull. EATCS 41 (1990)
Faron Moller
The Importance of the Left Merge Operator in Process Algebras. ICALP (1990)
Faron Moller, Chris M. N. Tofts
A Temporal Calculus of Communicating Systems. CONCUR (1990)
Faron Moller
The Nonexistence of Finite Axiomatisations for CCS Congruences LICS (1990)