Chelsea Edmonds

School of Computer Science

Research Associate in Formal Modelling Verification

Chelsea Edmonds
Profile picture of Chelsea Edmonds
C.L.Edmonds@sheffield.ac.uk

Full contact details

Chelsea Edmonds
School of Computer Science
Regent Court (DCS)
211 Portobello
Sheffield
S1 4DP
Profile

I'm a postdoctoral researcher in formal verification, currently working on the verification and formal modelling of security properties for programs running on advanced concurrent architectures (as part of the COVERT EPSRC grant) using the proof assistant Isabelle/HOL. Previously, I completed my PhD in formalised mathematics at the University of Cambridge (supervised by Prof. Lawrence Paulson), fully funded by a Cambridge Australia Scholarship. My PhD research resulted in five peer-reviewed publications, including a distinguished paper, and earned a British Federation of Women Graduates Academic Award. Before my PhD, I studied for a Bachelor of Science (Mathematics) and Bachelor of Engineering (Software), graduating with first class honours and a university medal from the University of Queensland, and worked as a Software Engineer.  

Beyond my research, I'm a passionate educator (AFHEA) and ambassador for STEM outreach and women in computer science. I've been honoured to receive several awards in recognition of my leadership and service in this space, including a Women in Technology Young Achiever Award and GradConnection Top100 Future Leader Australia award in 2017.

Research interests
  • Theorem proving
  • Formal methods
  • Verification
  • Security
  • Formalised mathematics
Publications

Journal articles

Chapters

Conference proceedings papers

Preprints

  • Edmonds C & Paulson LC (2023) Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma. RIS download Bibtex download
  • Edmonds C, Koutsoukou-Argyraki A & Paulson LC (2022) Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL. RIS download Bibtex download
  • Edmonds C & Paulson LC (2022) Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics. RIS download Bibtex download
  • Edmonds C & Paulson L (2021) A Modular First Formalisation of Combinatorial Design Theory. RIS download Bibtex download
Research group

Foundations of Computation