Faron Moller
Impact in
- Software top 2%
- Model-Driven Software Engineering Techniques
- Software Testing and Debugging Techniques
- Computational Theory and Mathematics top 0.5%
- Formal Methods in Verification
- Petri Nets in System Modeling
- semigroups and automata theory
Papers in
-
- Formal Methods in Verification 47
- semigroups and automata theory 18
- Petri Nets in System Modeling 15
- Computability, Logic, AI Algorithms 9
-
- Logic, programming, and type systems 22
- Co-authors
- Yoram Hirshfeld (11 shared papers)Chris Tofts (4 shared papers)Björn Victor (1 shared paper)Petr Jančar (9 shared papers)Mark Jerrum (3 shared papers)Søren Christensen (2 shared papers)Bernhard Steffen (1 shared paper)Olaf Burkart (1 shared paper)
- Journals
- Information and Computation (3 papers)Theoretical Computer Science (3 papers)Lecture notes in computer science (26 papers)Science of Computer Programming (2 papers)ACM Computing Surveys (2 papers)
- Partner nations
- United KingdomSwedenCzechia
In The Last Decade
Faron Moller
75 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 69
- Software 382
- Computational Theory and Mathematics 1.3k
- Artificial Intelligence 903
- Hardware and Architecture 104
- Computer Science Applications 73
Countries citing papers authored by Faron Moller
This map shows the geographic impact of Faron Moller's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Faron Moller with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Faron Moller more than expected).
Fields of papers citing papers by Faron Moller
This network shows the impact of papers produced by Faron Moller. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Faron Moller. The network helps show where Faron Moller may publish in the future.
Co-authors
The 25 scholars most cited alongside Faron Moller, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 82 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2001 | 156 | |
| 2 | 1994 | 154 | |
| 3 | 1993 | 105 | |
| 4 | 1996 | 105 | |
| 5 | 1996 | 80 | |
| 6 | 2006 | 78 | |
| 7 | 1996 | 64 | |
| 8 | 1991 | 61 | |
| 9 | Logics for Concurrency: Structure Versus Automata | 1996 | 60 |
| 10 | 1995 | 55 | |
| 11 | 2018 | 47 | |
| 12 | 2009 | 46 | |
| 13 | 2014 | 42 | |
| 14 | 2002 | 40 | |
| 15 | 2003 | 32 | |
| 16 | 2023 | 31 | |
| 17 | 2003 | 28 | |
| 18 | 2005 | 28 | |
| 19 | 2013 | 26 | |
| 20 | 2014 | 25 |
About Faron Moller
Faron Moller is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Software, Computer Science Applications and Computer Networks and Communications, having authored 82 papers that have together received 1.7k indexed citations. Recurring topics across this work include Formal Methods in Verification (47 papers), Logic, programming, and type systems (22 papers), semigroups and automata theory (18 papers), Petri Nets in System Modeling (15 papers), Software Testing and Debugging Techniques (12 papers), Model-Driven Software Engineering Techniques (10 papers), Teaching and Learning Programming (10 papers) and Computability, Logic, AI Algorithms (9 papers). The work is most often cited by research in Software (382 citations), Computational Theory and Mathematics (1.3k citations), Artificial Intelligence (903 citations), Hardware and Architecture (104 citations) and Computer Science Applications (73 citations). Faron Moller has collaborated with scholars based in United Kingdom, Sweden and Czechia. Frequent co-authors include Yoram Hirshfeld, Chris Tofts, Björn Victor, Petr Jančar, Mark Jerrum, Søren Christensen, Bernhard Steffen, Olaf Burkart, Didier Caucal and Alexander Rabinovich. Their work appears in journals such as Information and Computation, Theoretical Computer Science, Lecture notes in computer science, Science of Computer Programming and ACM Computing Surveys.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.