Lars‐Åke Fredlund
Impact in
- Software top 5%
- Software Testing and Debugging Techniques
-
- Formal Methods in Verification
- Petri Nets in System Modeling
Papers in
-
- Logic, programming, and type systems 10
- Logic, Reasoning, and Knowledge 8
- Multi-Agent Systems and Negotiation 6
- Security and Verification in Computing 5
-
- Formal Methods in Verification 21
- Co-authors
- Hans Hansson (1 shared paper)H. Svensson (6 shared papers)Clara Benac Earle (19 shared papers)Thomas Arts (4 shared papers)Dilian Gurov (5 shared papers)Mads Dam (4 shared papers)Thomas Noll (2 shared papers)Jan Friso Groote (1 shared paper)
In The Last Decade
Lars‐Åke Fredlund
37 papers receiving 390 citations
Peers
Comparison fields: 5 of 31
- Software 150
- Computational Theory and Mathematics 268
- Hardware and Architecture 113
- Artificial Intelligence 257
- Computer Networks and Communications 165
Countries citing papers authored by Lars‐Åke Fredlund
This map shows the geographic impact of Lars‐Åke Fredlund'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 Lars‐Åke Fredlund with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lars‐Åke Fredlund more than expected).
Fields of papers citing papers by Lars‐Åke Fredlund
This network shows the impact of papers produced by Lars‐Åke Fredlund. 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 Lars‐Åke Fredlund. The network helps show where Lars‐Åke Fredlund may publish in the future.
Co-authors
The 13 scholars most cited alongside Lars‐Åke Fredlund, 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 42 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Time and Probability in Formal Design of Distributed Systems | 1994 | 119 |
| 2 | 2007 | 54 | |
| 3 | 1991 | 45 | |
| 4 | A framework for reasoning about Erlang code | 2001 | 32 |
| 5 | 2003 | 22 | |
| 6 | 2010 | 17 | |
| 7 | 2007 | 16 | |
| 8 | 1997 | 15 | |
| 9 | 2007 | 15 | |
| 10 | 2002 | 13 | |
| 11 | 2002 | 10 | |
| 12 | 2016 | 10 | |
| 13 | Toward Parametric Verification of Open Distributed Systems | 1998 | 9 |
| 14 | 2014 | 9 | |
| 15 | 1998 | 8 | |
| 16 | Model checking of multi-applet javacard applications | 2002 | 7 |
| 17 | 2014 | 7 | |
| 18 | 2006 | 6 | |
| 19 | 2005 | 6 | |
| 20 | 2005 | 6 |
About Lars‐Åke Fredlund
Lars‐Åke Fredlund is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Software and Information Systems, having authored 42 papers that have together received 467 indexed citations. Recurring topics across this work include Formal Methods in Verification (21 papers), Software Testing and Debugging Techniques (14 papers), Logic, programming, and type systems (10 papers), Distributed systems and fault tolerance (10 papers), Logic, Reasoning, and Knowledge (8 papers), Software Reliability and Analysis Research (7 papers), Multi-Agent Systems and Negotiation (6 papers) and Security and Verification in Computing (5 papers). The work is most often cited by research in Software (150 citations), Computational Theory and Mathematics (268 citations), Hardware and Architecture (113 citations), Artificial Intelligence (257 citations) and Computer Networks and Communications (165 citations). Lars‐Åke Fredlund has collaborated with scholars based in Spain, Sweden and Germany. Frequent co-authors include Hans Hansson, H. Svensson, Clara Benac Earle, Thomas Arts, Dilian Gurov, Mads Dam, Thomas Noll, Jan Friso Groote, John Hughes and John Derrick. Their work appears in journals such as Journal of Logical and Algebraic Methods in Programming, ACM SIGPLAN Notices, Science of Computer Programming, ACM SIGCOMM Computer Communication Review and Theoretical Computer Science.
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.