Michael Norrish

4.1k total citations · 1 hit paper
56 papers, 1.8k citations indexed

About

Michael Norrish is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Michael Norrish has authored 56 papers receiving a total of 1.8k indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Artificial Intelligence, 27 papers in Computational Theory and Mathematics and 17 papers in Hardware and Architecture. Recurrent topics in Michael Norrish's work include Logic, programming, and type systems (30 papers), Formal Methods in Verification (23 papers) and Security and Verification in Computing (17 papers). Michael Norrish is often cited by papers focused on Logic, programming, and type systems (30 papers), Formal Methods in Verification (23 papers) and Security and Verification in Computing (17 papers). Michael Norrish collaborates with scholars based in Australia, United Kingdom and Sweden. Michael Norrish's co-authors include Harvey Tuch, Gerwin Klein, June Andronick, Kai Engelhardt, Simon Winwood, Philip Derrin, David Cock, Thomas Sewell, Kevin Elphinstone and Rafal Kolanski and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and Journal of the ACM.

In The Last Decade

Michael Norrish

46 papers receiving 1.6k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

seL4

2009 893 citations Gerwin Klein, Kevin Elphinstone et al. ANU Open Research (Australian National University) profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Michael Norrish Australia	14	1.4k	605	523	494	453	56	1.8k
Thomas Sewell Australia	9	1.2k 0.9×	563 0.9×	477 0.9×	291 0.6×	446 1.0×	20	1.4k
June Andronick Australia	11	1.2k 0.8×	545 0.9×	439 0.8×	285 0.6×	435 1.0×	32	1.5k
Rafal Kolanski Australia	9	1.1k 0.8×	502 0.8×	419 0.8×	260 0.5×	405 0.9×	14	1.3k
Harvey Tuch Australia	10	1.1k 0.8×	528 0.9×	462 0.9×	308 0.6×	419 0.9×	13	1.4k
David Cock Australia	8	1.2k 0.8×	506 0.8×	477 0.9×	231 0.5×	493 1.1×	18	1.4k
Kevin Elphinstone Australia	17	1.5k 1.1×	1.0k 1.7×	816 1.6×	285 0.6×	559 1.2×	45	2.0k
Philip Derrin Australia	7	956 0.7×	463 0.8×	381 0.7×	239 0.5×	366 0.8×	9	1.2k
Dhammika Elkaduwe Australia	6	904 0.6×	442 0.7×	361 0.7×	215 0.4×	350 0.8×	7	1.1k
Simon Winwood Australia	5	887 0.6×	423 0.7×	346 0.7×	215 0.4×	354 0.8×	10	1.1k
Adam Chlipala United States	23	1.2k 0.9×	491 0.8×	388 0.7×	590 1.2×	184 0.4×	77	1.6k

Countries citing papers authored by Michael Norrish

Since Specialization

Citations

This map shows the geographic impact of Michael Norrish'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 Michael Norrish with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Norrish more than expected).

Fields of papers citing papers by Michael Norrish

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Norrish. 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 Michael Norrish. The network helps show where Michael Norrish may publish in the future.

Co-authorship network of co-authors of Michael Norrish

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Norrish. A scholar is included among the top collaborators of Michael Norrish based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Norrish. Michael Norrish is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Myreen, Magnus O., et al.. (2025). Fast, Verified Computation for HOL ITPs. Journal of Automated Reasoning. 69(1).

2.

Treude, Christoph, et al.. (2024). Reproducibility Debt: Challenges and Future Pathways. ANU Open Research (Australian National University). 462–466.

3.

Treude, Christoph, et al.. (2024). Characterising reproducibility debt in scientific software: A systematic literature review. Journal of Systems and Software. 222. 112327–112327. 1 indexed citations

4.

Norrish, Michael. (2021). C formalised in HOL. CL Technical Reports. 4 indexed citations

5.

Norrish, Michael, et al.. (2021). TCP, UDP, and Sockets: Volume 3: The Service-level Specification. CL Technical Reports.

6.

Kumar, Ramana, et al.. (2020). Proof-Producing Synthesis of CakeML from Monadic HOL Functions. Journal of Automated Reasoning. 64(7). 1287–1306. 5 indexed citations

7.

Norrish, Michael, et al.. (2020). Mechanisation of the AKS Algorithm. Journal of Automated Reasoning. 65(2). 205–256. 1 indexed citations

8.

Gretton, Charles, et al.. (2019). A Verified Compositional Algorithm for AI Planning. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

9.

Norrish, Michael, et al.. (2018). Formally Verified Algorithms for Upper-Bounding State Space Diameters. Journal of Automated Reasoning. 61(1-4). 485–520. 6 indexed citations

10.

Wang, Kunshan, Stephen M. Blackburn, Antony L. Hosking, & Michael Norrish. (2018). Hop, Skip, & Jump. ACM SIGPLAN Notices. 53(3). 1–16. 2 indexed citations

11.

Bishop, Steve, Matthew Fairbairn, Michael Norrish, et al.. (2018). Engineering with Logic. Journal of the ACM. 66(1). 1–77. 8 indexed citations

12.

Norrish, Michael, et al.. (2017). Proof Pearl: Bounding Least Common Multiples with Triangles. Journal of Automated Reasoning. 62(2). 171–192. 1 indexed citations

13.

Norrish, Michael, et al.. (2015). Exploiting symmetries by planning for a descriptive quotient. Griffith Research Online (Griffith University, Queensland, Australia). 1479–1486. 3 indexed citations

14.

Gretton, Charles, et al.. (2014). Mechanising Theoretical Upper Bounds in Planning. International Conference on Automated Planning and Scheduling. 1 indexed citations

15.

Norrish, Michael, et al.. (2013). A mechanisation of some context-free language theory in HOL4. Journal of Computer and System Sciences. 80(2). 346–362.

16.

Klein, Gerwin, Kevin Elphinstone, Gernot Heiser, et al.. (2009). seL4. ANU Open Research (Australian National University). 207–220. 893 indexed citations breakdown →

17.

Norrish, Michael. (2006). Mechanising λ-calculus using a classical first order theory of terms with permutations. LISP and Symbolic Computation. 19(2-3). 169–195. 10 indexed citations

18.

Bishop, Steve, et al.. (2006). Engineering with logic. 55–66. 33 indexed citations

19.

Bishop, Steve, Matthew Fairbairn, Michael Norrish, et al.. (2006). Engineering with logic. ACM SIGPLAN Notices. 41(1). 55–66. 3 indexed citations

20.

Dennis, Louise A., et al.. (2003). The PROSPER toolkit. International Journal on Software Tools for Technology Transfer. 4(2). 189–210. 3 indexed citations

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.

Explore authors with similar magnitude of impact