Faron Moller - RankMe

82 papers A* 8A 1B 14Journal 20Unranked 32

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