default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFaron Moller
Person information
- affiliation: Swansea University, UK
- affiliation (former): Uppsala University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Phillip James, Faron Moller, Filippos Pantekis:
OnTrack: Reflecting on domain specific formal methods for railway designs. Sci. Comput. Program. 233: 103057 (2024)- [c54]Casey Hopkins
, Faron Moller:
Institute of Coding in Wales Digital Skills Bootcamps - Micro-Credentials: A Pilot Project. CEP 2024: 21-24 - [c53]Olga Petrovska, Lee Clift, Faron Moller, Rebecca Pearsall:
Incorporating Generative AI into Software Development Education. CEP 2024: 37-40 - [e5]Troy K. Astarte, Duncan Hull, Fiona McNeill, Faron Moller:
Proceedings of the 2024 Conference on United Kingdom & Ireland Computing Education Research, UKICER 2024, Manchester, United Kingdom, September 5-6, 2024. ACM 2024, ISBN 979-8-4007-1177-0 [contents] - 2023
- [c52]Phillip James, Faron Moller, Markus Roggenbach:
Software Model Checking of Interlocking Programs. Applicable Formal Methods for Safe Industrial Products 2023: 130-146 - [c51]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: 839:1-839:17 - [c50]Tom Crick, Faron Moller:
Technocamps: Highlighting 20 Years of Transforming Digital Education in Wales. ITiCSE (2) 2023: 670 - [c49]Faron Moller, Geinor Styles, Luke Clement:
Digital Outreach via Theatre Productions. UKICER 2023: 17:1 - [c48]Faron Moller:
Technocamps: 30 Years of Digital Education and Professional Development Throughout Wales. UKICER 2023: 18:1 - [c47]Olga Petrovska, Lee Clift, Faron Moller:
Generative AI in Software Development Education: Insights from a Degree Apprenticeship Programme. UKICER 2023: 19:1 - [c46]Casey Hopkins, Faron Moller, Laura Robert:
Institute of Coding in Wales Digital Skills Bootcamps - A Model for Stackable Micro-credentials. UKICER 2023: 21:1 - [e4]Troy Astarte, Faron Moller, Keith Quille, Seán Russell:
Proceedings of the 2023 Conference on United Kingdom & Ireland Computing Education Research, Swansea, Wales, UK, September 7-8, 2023. ACM 2023 [contents] - 2020
- [j18]Ulrich Berger, Faron Moller:
Report on BCTCS & AlgoUK 2020. Bull. EATCS 131 (2020) - [c45]Phillip James, Lauren Powell, Liam O'Reilly, Faron Moller:
Hands-on Security Testing in a University Lab Environment. ITiCSE 2020: 68-74 - [i1]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:
Rooting Formal Methods within Higher Education Curricula for Computer Science and Software Engineering - A White Paper. CoRR abs/2010.05708 (2020)
2010 – 2019
- 2019
- [c44]Faron Moller, Stewart Powell:
Teaching Computing via a School Placement. CEP 2019: 3:1-3:4 - [c43]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:
Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -. FMFun 2019: 1-26 - [c42]Faron Moller, Liam O'Reilly, Stewart Powell, Casey Denner:
Teaching Them Early: Formal Methods in School. FMFun 2019: 173-190 - [c41]Filippos Pantekis, Phillip James, Liam O'Reilly, Daniel Archambault, Faron Moller:
Visualising Railway Safety Verification. FTSCS 2019: 95-105 - [c40]Faron Moller, Liam O'Reilly:
Teaching Discrete Mathematics to Computer Science Students. FMTea 2019: 150-164 - [c39]Faron Moller, Stewart Powell:
Technoteach: Supporting Computing Teachers Across Wales. WiPSCE 2019: 9:1-9:2 - 2017
- [c38]Chris Chilton, Marta Z. Kwiatkowska, Faron Moller, Xu Wang:
A Specification Theory of Real-Time Processes. Concurrency, Security, and Puzzles 2017: 18-38 - 2016
- [c37]Phillip James, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach, Helen Treharne, Xu Wang:
OnTrack: The Railway Verification Toolset - Extended Abstract. ISoLA (2) 2016: 294-296 - 2015
- [c36]Tom Crick, Faron Moller:
Technocamps: Advancing Computer Science Education in Wales. WiPSCE 2015: 121-126 - 2014
- [j17]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: 315-336 (2014) - [j16]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): 685-711 (2014) - [c35]Lloyd Roberts, Mike Smith, Faron Moller, Markus Roggenbach:
Visualising Timed CSP Train Simulations for Capacity. TPCG 2014: 91-93 - 2013
- [b1]Faron Moller, Georg Struth:
Modelling Computing Systems - Mathematics for Computer Science. Undergraduate Topics in Computer Science, Springer 2013, ISBN 978-1-84800-321-7, pp. I-XVI, 1-500 - [j15]Jan A. Bergstra, Jens Blanck, Faron Moller, Stanley S. Wainer:
Guest Editorial. Comput. J. 56(1): 2 (2013) - [c34]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: 189-204 - [c33]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: 253-268 - 2012
- [j14]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) - [c32]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: 193-208 - [c31]Yoshinao Isobe, Faron Moller, Hoang Nga Nguyen, Markus Roggenbach:
Safety and Line Capacity in Railways - An Approach in Timed CSP. IFM 2012: 54-68 - [c30]Catherine Ball, Faron Moller, Reena Pau:
The mindstorm effect: a gender analysis on the influence of LEGO mindstorms in computer science education. WiPSCE 2012: 141-142
2000 – 2009
- 2008
- [c29]Arnold Beckmann, Faron Moller:
On the Complexity of Parity Games. BCS Int. Acad. Conf. 2008: 237-248 - [c28]Karim Kanso, Faron Moller, Anton Setzer:
Automated Verification of Signalling Principles in Railway Interlocking Systems. AVoCS 2008: 19-31 - 2006
- [c27]Will Harwood, Faron Moller, Anton Setzer:
Weak Bisimulation Approximants. CSL 2006: 365-379 - 2005
- [e3]Julian C. Bradfield, Faron Moller:
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, INFINITY 2004, London, UK, September 4, 2004. Electronic Notes in Theoretical Computer Science 138(3), Elsevier 2005 [contents] - 2004
- [j13]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): 1-19 (2004) - [j12]Faron Moller, Scott A. Smolka, Jirí Srba:
On the computational complexity of bisimulation, redux. Inf. Comput. 194(2): 129-143 (2004) - [c26]Julian C. Bradfield, Faron Moller:
Preface. INFINITY 2004: 1 - 2003
- [j11]Faron Moller, Alexander Moshe Rabinovich:
Counting on CTL*: on the expressive power of monadic path logic. Inf. Comput. 184(1): 147-159 (2003) - [c25]Faron Moller, Scott A. Smolka:
On the Computational Complexity of Bisimulation, Redux. PCK50 2003: 55-59 - [c24]Petr Jancar, Antonín Kucera, Faron Moller:
Deciding Bisimilarity between BPA and BPP Processes. CONCUR 2003: 157-171 - 2002
- [j10]Faron Moller:
Formal Methods in Computation. Comput. J. 45(1): 1 (2002) - [c23]Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa:
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. FoSSaCS 2002: 172-186 - 2001
- [j9]Yoram Hirshfeld, Faron Moller:
Pushdown automata, multiset automata, and Petri nets. Theor. Comput. Sci. 256(1-2): 3-21 (2001) - [p1]Olaf Burkart, Didier Caucal, Faron Moller, Bernhard Steffen:
Verification on Infinite Structures. Handbook of Process Algebra 2001: 545-623 - 2000
- [c22]Yoram Hirshfeld, Faron Moller:
On the star height of unary regular behaviours. Proof, Language, and Interaction 2000: 497-510 - [c21]Petr Jancar, Antonín Kucera, Faron Moller:
Simulation and Bisimulation over One-Counter Processes. STACS 2000: 334-345
1990 – 1999
- 1999
- [j8]Petr Jancar, Javier Esparza, Faron Moller:
Petri Nets and Regular Processes. J. Comput. Syst. Sci. 59(3): 476-503 (1999) - [c20]Petr Jancar, Faron Moller:
Techniques for Decidability and Undecidability of Bisimilarity. CONCUR 1999: 30-45 - [c19]Faron Moller, Alexander Moshe Rabinovich:
On the Expressive Power of CTL. LICS 1999: 360-368 - [c18]Petr Jancar, Faron Moller, Zdenek Sawa:
Simulation Problems for One-Counter Machines. SOFSEM 1999: 404-413 - 1998
- [c17]Faron Moller:
A Taxonomy of Infinite State Processes. MFCS Workshop on Concurrency 1998: 3-22 - 1997
- [c16]Faron Moller:
Preface. INFINITY 1997: 1 - [e2]Faron Moller:
Second International Workshop on Verification of Infinite State Systems, Infinity 1997, Bologna, Italy, July 11-12, 1997. Electronic Notes in Theoretical Computer Science 9, Elsevier 1997 [contents] - 1996
- [j7]Faron Moller:
Logics for Concurrency: Structure Versus Automata. ACM Comput. Surv. 28(4es): 50 (1996) - [j6]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): 251-259 (1996) - [j5]Yoram Hirshfeld, Mark Jerrum, Faron Moller:
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Theor. Comput. Sci. 158(1&2): 143-159 (1996) - [c15]Faron Moller:
Infinite Results. CONCUR 1996: 195-216 - [e1]Faron Moller, Graham M. Birtwistle:
Logics for Concurrency - Structure versus Automata (8th Banff Higher Order Workshop, Banff, Canada, August 27 - September 3, 1995, Proceedings). Lecture Notes in Computer Science 1043, Springer 1996, ISBN 3-540-60915-6 [contents] - 1995
- [j4]Faron Moller, Scott A. Smolka:
On the Computational Complexity of Bisimulation. ACM Comput. Surv. 27(2): 287-289 (1995) - [c14]Yoram Hirshfeld, Faron Moller:
Decidability Results in Automata and Process Theory. Banff Higher Order Workshop 1995: 102-148 - [c13]Petr Jancar, Faron Moller:
Checking Regular Properties of Petri Nets. CONCUR 1995: 348-362 - 1994
- [j3]Søren Christensen, Yoram Hirshfeld, Faron Moller:
Decidable Subsets of CCS. Comput. J. 37(4): 233-242 (1994) - [c12]Björn Victor, Faron Moller:
The Mobility Workbench - A Tool for the pi-Calculus. CAV 1994: 428-440 - [c11]Yoram Hirshfeld, Faron Moller:
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. CONCUR 1994: 48-63 - [c10]Yoram Hirshfeld, Mark Jerrum, Faron Moller:
A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes. FOCS 1994: 623-631 - 1993
- [j2]Robin Milner, Faron Moller:
Unique Decomposition of Processes. Theor. Comput. Sci. 107(2): 357-363 (1993) - [c9]Søren Christensen, Yoram Hirshfeld, Faron Moller:
Bisimulation Equivalence is Decidable for Basic Parallel Processes. CONCUR 1993: 143-157 - [c8]Søren Christensen, Yoram Hirshfeld, Faron Moller:
Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes. LICS 1993: 386-396 - 1992
- [c7]Jan Friso Groote, Faron Moller:
Verification of Parallel Systems via Decomposition. CONCUR 1992: 62-76 - [c6]Faron Moller, Chris M. N. Tofts:
An overview of TCCS. RTS 1992: 98-103 - [c5]Faron Moller, Chris M. N. Tofts:
Behavioural Abstraction in TCCS. ICALP 1992: 559-570 - 1991
- [c4]Faron Moller, Chris M. N. Tofts:
Relating Processes With Respect to Speed. CONCUR 1991: 424-438 - 1990
- [j1]Robin Milner, Faron Moller:
Unique decomposition of processes. Bull. EATCS 41: 226-233 (1990) - [c3]Faron Moller, Chris M. N. Tofts:
A Temporal Calculus of Communicating Systems. CONCUR 1990: 401-415 - [c2]Faron Moller:
The Importance of the Left Merge Operator in Process Algebras. ICALP 1990: 752-764 - [c1]Faron Moller:
The Nonexistence of Finite Axiomatisations for CCS Congruences. LICS 1990: 142-153
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
