Michael Norrish

Michael Norrish is an Associate Professor at the School of Computing, Australian National University (ANU), specializing in formal methods, programming language semantics, and interactive theorem proving. His career spans roles at NICTA, Data61, and ANU, with a focus on mechanised mathematics and verified systems.

• PhD in Computer Science (University of Cambridge, 1999)
• Undergraduate degree from Victoria University of Wellington

His research bridges interactive theorem-proving (ITP) systems like HOL4 with real-world systems verification, particularly in programming languages and compilers. He leads the CakeML project, developing a verified compiler for functional languages. His work intersects formal verification with practical system design, including projects on reproducibility debt in scientific software and verified processors.

Recent publications highlight verified compilation techniques, reproducibility challenges, and Kolmogorov complexity formalization. He actively participates in conference program committees (e.g., CPP, PLDI) and promotes trustworthy systems development through tools like HOL4.

• Current affiliations: ANU, CakeML Project, Trustworthy Systems Research Group (UNSW)
• Collaborations: Chalmers University (postdoc opportunities), seL4 microkernel ecosystem