Oliver Nash is a researcher at Imperial College London, actively engaged in the formalisation of advanced mathematical concepts. His work bridges geometry and computational logic, with a focus on rigorous proof systems. Research Interests: Oliver's research lies at the intersection of geometry and the formalisation of mathematics. He specialises in using proof assistants to verify deep mathematical results, including topics such as the h-principle, sphere eversion, and Lie algebras. His work contributes to the growing field of certified mathematics, ensuring correctness through machine-checked proofs. Publication Trends: His recent publications at the CPP conference demonstrate a consistent focus on formalising foundational results in differential geometry and algebra. These works reflect a trend toward computational trust in mathematical proofs, particularly in complex geometric transformations and algebraic structures. Professional Activities: Oliver is an active contributor to the Certified Programs and Proofs (CPP) conference, presenting cutting-edge work in formal verification. He maintains a personal website detailing both his academic contributions and early explorations in computer graphics, such as raytracing and radiosity rendering from the early 2000s. Labs and Projects: While specific lab affiliations are not mentioned, his work is closely aligned with research groups in formal methods and interactive theorem proving, likely involving tools like Lean, Coq, or Isabelle.
Marcus Gerhold is an Assistant Professor in the Formal Methods and Tools group at the University of Twente's Faculty of Electrical Engineering, Mathematics and Computer Science. His research focuses on model-based testing for software reliability in critical infrastructures, particularly railway systems, alongside significant contributions to game design and programming language analysis. His educational background includes: PhD in Computer Science from University of Twente (2018): Choice and Chance: Model-based Testing of Stochastic Behaviour MSc in Mathematics from Friedrich Schiller Universität Jena (2013): Embeddings of Weighted Morrey Spaces BSc in Mathematics from Friedrich Schiller Universität Jena (2011): Entropy-, Approximation- and Kolmogorov Numbers on Quasi-Banach Spaces Gerhold's research integrates theoretical model-based testing with practical critical infrastructure applications . His work on railway conformance testing addresses EULYNX controller validation, while his game design research explores affective mirroring in NPCs and procedural dungeon generation. The code modernity analysis stream leverages static analysis to quantify legacy code evolution across languages like Python and PHP, revealing version identification challenges through deep learning. Publication trends show consistent focus on model-based testing methodologies (40%), railway safety applications (25%), and innovative game design/code analysis (35%). Recent work increasingly incorporates AI/ML techniques for UML assessment and Python version identification, while maintaining rigorous formal methods foundations. He actively mentors 63 students across all academic levels and contributes to major research initiatives: STORM_SAFE (ERDF, 2024): Daily Supervisor for WP1/WP2 on software reliability for critical infrastructures ZORRO (KIC grant, 2023): Daily Supervisor for WP4 on zero downtime in cyber-physical systems MISSION (MSCA RISE, 2021-2025): Interim coordinator (early 2024) for space systems modeling As part of the Formal Methods and Tools research group, Gerhold participates in European collaborations while serving on SAC-SVT 2024 and FormaliSE 2023 program committees.
Professor Massimiliano Gubinelli is the Wallis Professor of Mathematics at the University of Oxford and a Professorial Fellow at St. Anne's College. He leads the Stochastic Analysis Group within the Mathematical Institute, where his research focuses on stochastic analysis, constructive quantum field theory, and the intersection of probability theory with partial differential equations (PDEs) and renormalization group methods. His work spans statistical mechanics of multiscale systems, analysis of PDEs with random terms, homogenisation theory, mathematical quantum mechanics, path-integral formalisms, and non-commutative probability/geometry. He has pioneered paracontrolled distribution techniques to study singular stochastic PDEs and explored rough paths in ramification and transport equations. Recent publications highlight advancements in the sine-Gordon model via stochastic quantization, nonlinear PDEs with modulated dispersion, and ρ-irregularity in stochastic systems. His research bridges stochastic analysis, quantum field theory, and PDEs, emphasizing pathwise behavior and renormalization. Scientific Awards Junior member of the Institut Universitaire de France (2013–2018) Invited session speaker at the 2018 International Congress of Mathematicians (ICM) in Rio He contributes to scientific software development as a lead developer of TeXmacs , an open-source platform for technical documents, and teaches courses such as C8.1 Stochastic Differential Equations (MT22). No formal student advisement or grant details are provided.
Chelsea Edmonds is a Researcher in the Department of Computer Science at the University of Sheffield, working on the COVERT project focusing on formal verification and security. She completed her PhD at the University of Cambridge under Prof. Larry Paulson, formalising combinatorial structures in Isabelle/HOL. Previously, she was a Software Engineer at Boeing Australia and holds a dual degree from the University of Queensland. Education: PhD in Computer Science (University of Cambridge), 2024 Bachelor of Engineering (Software) & Bachelor of Science (Mathematics), University of Queensland, 2017 (First Class Honours, University Medal) Research Interests: Formal methods, proof assistants, combinatorial mathematics formalisation, security verification, and HCI aspects of theorem proving tools. Key contributions include probabilistic combinatorial formalisation and modular library design in Isabelle/HOL. Publications: Over 10 peer-reviewed papers, including work on the Lovász Local Lemma, Balog-Szemerédi-Gowers theorem, and Fisher’s inequality formalisation. Her research bridges theoretical mathematics and applied verification. Awards: Cambridge Australia Scholarship, British Federation of Women Graduates Academic Award, Distinguished Paper at CPP 2024. Active in outreach, including leadership roles in Women@CL and Robogals.
Patrick Massot is a Professor in the Department of Mathematics at the Faculty of Sciences of Orsay, University of Paris-Saclay, France. His work bridges pure mathematics and formal verification, with a focus on symplectic and contact geometry, and the formalization of advanced mathematical theories using the Lean proof assistant. His research interests include symplectic geometry , contact geometry , formalized mathematics , and differential topology . He has contributed significantly to the formalization of perfectoid spaces, the h-principle, and sphere eversion. His recent work emphasizes the educational use of proof assistants in teaching undergraduate mathematics. The most recent publications reflect a strong trend toward formal verification in mathematics, combining geometric intuition with rigorous computational proof. These works span topics such as convex integration, holonomic approximation, and the use of Lean for pedagogy. The underlying themes include flexibility in geometry, foundational rigor, and interdisciplinary collaboration between mathematics and computer science. Program Committee Member, CPP 2025 Author, Formalising the h-principle and sphere eversion (CPP 2023) Patrick Massot has advised no publicly listed students, and no specific grants are mentioned. However, his collaborative work with prominent mathematicians (e.g., Buzzard, Commelin, Giroux, Etnyre) suggests active research funding and participation in major projects such as the Liquid Tensor Experiment. He leads a formalized mathematics working group and was involved in a 2015–2016 working group on sheaf theory applied to Lagrangian submanifolds. These groups serve as hubs for collaborative research in formalization and geometric topology.
Chelsea Edmonds is a Postdoctoral Research Associate in the Department of Computer Science at the University of Sheffield, soon to begin as a Lecturer at the University of Western Australia in November 2025. She works on the COVERT grant EPSRC project investigating formal verification and security of concurrent programs, collaborating with Dr. Andrei Popescu and Prof. John Derrick. Her research interests focus on formalised mathematics , proof assistants (particularly Isabelle/HOL), and formal methods for security and concurrency . She develops modular libraries for formalised mathematics in combinatorics, aiming to mirror human intuitive proof techniques in formal environments. Her recent publications demonstrate expertise in applying probabilistic methods to combinatorial structures and formalising complex mathematical theorems. She has contributed significantly to the formal verification community through her work on the Lovász Local Lemma and the Balog–Szemerédi–Gowers Theorem. British Federation of Women Graduates Academic Award Distinguished Paper Award for Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma Top 10% of accepted papers award As an Associate Fellow with AdvanceHE, Edmonds is a passionate educator involved in STEM outreach and gender diversity initiatives for Women in STEM. She will be lecturing at the ANU Logic Summer School in December 2025 and the Midlands Graduate School. Her research on the COVERT project aims to develop verification tools for reasoning about security of programs on advanced architectures.
Dr. Scott Harper is an Assistant Professor in the School of Mathematics at the University of Birmingham and a 125th Anniversary Fellow. His research focuses on group theory, with grants from EPSRC and Leverhulme. He holds a PhD from the University of Bristol (2019) and MMath from the University of St Andrews (2015). Research Interests: Group theory, including generating sets, subgroup structures, derangements, and their connections to representation theory, geometric group theory, Lie theory, and combinatorics. Also interests in proof formalisation, mathematics education, and the philosophy of mathematical practice. Publications: Recent work includes studies on Kronecker classes, normal coverings, and minimal cover groups. His research emphasizes symmetry and its applications in finite and infinite groups. Awards: Gold Medal at STEM for Britain (2021), EPSRC Postdoctoral Fellowship, Leverhulme Early Career Fellowship. Grants & Teaching: Funded by EPSRC and Leverhulme. Previously taught at University of St Andrews and University of Bristol, focusing on advanced group theory and LaTeX for mathematics.
Angeliki Koutsoukou-Argyraki is affiliated with the University of Cambridge, specifically within the Department of Computer Science and Technology under the School of Technology. She actively contributes to research in formal verification and interactive theorem proving. Her research focuses on the formalisation of deep mathematical results using proof assistants, particularly Isabelle/HOL. Her work bridges theoretical computer science and pure mathematics, enabling machine-checked proofs of complex theorems. This positions her at the intersection of logic, automated reasoning, and formal methods. The available publication demonstrates a strong trend in formalising results from additive combinatorics and theoretical mathematics, indicating a specialization in rigorous, logic-based verification of mathematical proofs using computational tools. She has served on the program committees of the CPP (Certified Programs and Proofs) conference in 2021, 2023, and 2026, highlighting her recognition and active participation in the formal methods and programming languages community. While no labs or research teams are explicitly mentioned, her work is closely aligned with the activities of formal methods research groups at the University of Cambridge, particularly those engaged in theorem proving and verification of mathematical theories.
Paul Jackson is a Senior Lecturer in the School of Informatics at the University of Edinburgh and serves as Director of the Artificial Intelligence and its Applications Institute (AIAI). He is also affiliated with the Laboratory for Foundations of Computer Science (LFCS) and is an associate member of the Institute for Computing Systems Architecture (ICSA). His work bridges theoretical and applied aspects of formal methods in computer science. Education PhD and MS in Computer Science, Cornell University (1988–1995) MS in Physics, Cornell University (1986–1988) Undergraduate in Engineering, University of Cambridge (1981–1984) Paul Jackson's research focuses on formal verification, particularly the development and application of tools for verifying software, hardware, and hybrid systems. His primary interests include interactive theorem proving (using Lean, Isabelle, and KeYmaera), formal verification of hybrid and cyber-physical systems, non-linear arithmetic, and the integration of symbolic computation with deduction. He has worked extensively with the Nuprl theorem prover and contributed to tools like Victor for SPARK/Ada verification. His recent publications emphasize compositional verification, validated integration using Taylor models, invariant generation for polynomial systems, and dynamic proof presentation. He has been involved in multiple EPSRC and UKRI-funded projects, including work on trustworthy autonomous systems and cache coherence protocols. Scientific Awards and Recognition No specific awards are listed in the provided text. Paul Jackson has advised several PhD students, including Ramon Fernández Mir, Kristjan Liiva, Andrew Sogokon, and Grant Olney Passmore, many of whom have gone on to influential roles in academia and industry. He has held significant administrative roles, including Senior Tutor and Senior Director of Studies, and has contributed to major conferences such as CAV, CICM, and CADE as program committee member or chair. His teaching includes courses on formal verification, automated reasoning, and software engineering.
Corina Pasareanu is a Principal Scientist at Carnegie Mellon University's CyLab and Technical Professional Leader for Data Science at NASA Ames Research Center (working through KBR). She maintains strong affiliations with both CMU's School of Computer Science and NASA Ames, leading cutting-edge research at the intersection of formal verification, AI safety, and software security. She earned her Ph.D. in Computer Science from Kansas State University in 2001, following MS (1995) and BS (1994) degrees in Computer Science from University Politehcnica of Bucharest. Her academic foundation has propelled her to become a leading expert in verification techniques for complex software systems. Dr. Pasareanu's research program focuses on model checking, symbolic execution, compositional verification, and probabilistic software analysis, with growing emphasis on ensuring safety and reliability of AI systems. Her work bridges theoretical formal methods with practical applications in autonomous systems and security-critical domains. Recent efforts target verification challenges in large language models and vision-based autonomous systems, developing techniques to provide mathematical guarantees of system behavior despite AI component uncertainties. Analysis of her publication trends reveals a strategic evolution from foundational verification techniques toward increasingly complex AI systems, with strong emphasis on practical applications in safety-critical contexts. Her work consistently connects theoretical advances in formal methods with real-world security and safety challenges. Her scientific contributions have earned exceptional recognition: ACM Fellow and IEEE ASE Fellow ETAPS Test of Time Award (2021) ASE Most Influential Paper Award (2018) ESEC/FSE Test of Time Award (2018) ISSTA Retrospective Impact Paper Award (2018) Multiple historical impact awards including ACM Impact Paper Award (2010) and ICSE Most Influential Paper Award (2010) Dr. Pasareanu actively mentors the next generation of computer scientists, currently advising PhD students Aymeric Fromherz (with Bryan Parno), Yoshiki Takashima, Zichao Zhang, and Chi Zhang (all with Limin Jia), plus postdoc Ravi Mangal. She has secured substantial research funding from NSF, DARPA, AWS, NASA, and industry partners for projects including 'LLM Self-Defense Against Adversarial Attacks,' 'Trinity: Neurosymbolic Learning and Reasoning,' and 'HUGS: Human-Guided Software Testing.' Her leadership extends to Program Co-Chair for ICSE 2025 and multiple other major conferences, plus service on steering committees for ICSE, ETAPS, TACAS, and ISSTA. As Principal Scientist at CMU CyLab, she leads research teams developing verification techniques for AI systems, with particular focus on autonomous vehicles and large language models. Her NASA Ames work applies formal methods to space-related autonomous systems, while her collaborations with industry partners translate theoretical advances into practical tools. She remains at the forefront of addressing verification challenges for increasingly complex AI technologies, with upcoming keynotes at CAV 2025 and FormaliSE 2025 demonstrating her continued leadership in the field.
Ane Maria Gerdes Døhl is a Doctoral Research Fellow in Philosophy at the University of Oslo. Her research examines the history of formalisation between Leibniz and Russell, connecting historical concepts to contemporary AI knowledge representation systems. Teaching experience includes serving as teaching assistant for introductory logic and philosophy of mind courses. Her educational background includes a Joint Honours in Mathematics and Philosophy from University of St Andrews and an MA from University of Oslo. She received the Scholarship from the Centre for Philosophy and the Sciences for her MA thesis on Truth in First Degree Entailment.
Alceste Scalas is an Associate Professor at the Department of Applied Mathematics and Computer Science, Technical University of Denmark (DTU). His research focuses on formal methods in concurrency, multiparty session types, distributed systems, and programming language theory. Scalas leads the Software Systems Engineering group and actively supervises PhD students in areas such as secure distributed systems and formal verification of communication protocols. His work integrates theoretical contributions (e.g., process algebra formalisms, Petri net encodings) with practical applications like verified network APIs and automated test synthesis for RESTful systems. Recent projects include COTS (OpenAPI test synthesis) and P4R-Type (verified P4 control plane tools). Scalas' research has been applied to secure cloud-edge systems (TaRDIS project), hybrid verification methodologies, and SDN protocol validation. He co-develops tools like Effpi for verified message-passing programs and PSTMonitor for session-type monitoring. He supervises PhD candidates working on secure distributed applications, formal methods in blockchain (Algorand smart contracts), and concurrency patterns in actor systems. His work bridges theoretical computer science with real-world system verification challenges.
Lambèr Royakkers is a Professor of Ethics of Technology at the Department of Philosophy and Ethics, Faculty of Industrial Engineering & Innovation Sciences, Eindhoven University of Technology. He also holds a 0.5 FTE position as Associate Professor of Military Ethics at the Netherlands Defence Academy since 2007. Education: Philosophy and Social Sciences – Eindhoven University of Technology (1991) Technical Mathematics – Eindhoven University of Technology (1993) Law – Tilburg University (1999) PhD in Law – Tilburg University (1996), dissertation on formalisation of normative rules with deontic logic Research Interests: Royakkers’ research is interdisciplinary, positioned at the intersection of ethics, law, and technology, with a pronounced emphasis on military contexts. His work critically examines ethical and legal dilemmas arising from modern military technologies. He currently leads the NWO-funded project ‘Moral fitness of military personnel in a networked operational environment’ , aimed at understanding and enhancing ethical decision-making within technologically mediated military operations. His scholarly output includes the forthcoming book Ethics, Engineering and Technology (co-authored with Ibo van de Poel, Blackwell 2011), which consolidates his contributions to the ethical evaluation of engineering practices and technological innovation. Contact & Affiliations: Primary: Eindhoven University of Technology, Department of Philosophy and Ethics, Faculty of Industrial Engineering & Innovation Sciences Secondary: Netherlands Defence Academy – Associate Professor of Military Ethics (0.5 FTE) Email: L.M.M.Royakkers@tue.nl Phone: +31 (0)40 247 4693 Postal Address: P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Dr. Chelsea Edmonds is a Postdoctoral Research Associate in the School of Computer Science at the University of Sheffield, working on the COVERT EPSRC grant project focused on verification and formal modeling of security properties for programs running on concurrent architectures using the Isabelle/HOL proof assistant. She is an active member of the Foundations of Computation research group and will be transitioning to a permanent faculty position as Lecturer (equivalent to Assistant Professor) at the University of Western Australia starting November 2025. Dr. Edmonds completed her PhD in formalised mathematics at the University of Cambridge under the supervision of Prof. Lawrence Paulson, fully funded by a prestigious Cambridge Australia Scholarship. Prior to her doctoral studies, she earned dual degrees in Mathematics and Software Engineering with first class honours and a university medal from the University of Queensland, followed by two years of industry experience as a Software Engineer. Her research program centers on theorem proving, formal methods, and verification with special expertise in the Isabelle/HOL proof assistant. She develops modular approaches to formalising mathematical concepts and verifying security properties of concurrent programs, bridging theoretical computer science with practical applications in secure software development. Her methodology emphasizes creating reusable formal frameworks that capture intuitive mathematical reasoning. Dr. Edmonds' publication record reveals a clear trajectory in formalising combinatorial mathematics and developing techniques for formal probabilistic reasoning. Her award-winning work on the Lovász Local Lemma represents a significant contribution to formal methods, addressing notable gaps between intuitive probabilistic arguments and formal verification. She has pioneered reusable frameworks for formal probabilistic proofs that enhance the verification capabilities for combinatorial structures. British Federation of Women Graduates Academic Award for PhD research Women in Technology Young Achiever Award GradConnection Top100 Future Leader Australia award (2017) Distinguished Paper Award at ACM CPP 2024 (Top 10% of accepted papers) As an Associate Fellow of the Higher Education Academy (AFHEA), Dr. Edmonds is deeply committed to STEM education and outreach, particularly supporting women in computer science. She has lectured at the Midlands Graduate School and will be teaching at the ANU Logic Summer School in December 2025. Her current research is supported by the COVERT EPSRC grant, collaborating with researchers at Surrey and Kent universities on advanced verification tools for secure concurrent programming. Dr. Edmonds maintains active collaborations within the international formal methods community, regularly presenting her work at major conferences and institutions including Heidelberg University. She contributes to the development of formal methods communities through teaching advanced Isabelle/HOL techniques for program verification and formal mathematics.
Håkon Robbestad Gylterud is an Associate Professor in the Department of Informatics at the University of Bergen, Norway. His academic work bridges mathematics and computer science, with a strong focus on logical foundations and formal systems. University: University of Bergen School: Faculty of Mathematics and Natural Sciences Department: Department of Informatics Position: Associate Professor His research centers on dependent type theory and homotopy type theory (HoTT), aiming to formalize mathematical reasoning and computational structures. He explores foundational concepts such as multisets, iterative sets, and data structures with symmetries within type-theoretic frameworks. His interests extend to category theory, algebra, topology, and the computer formalization of mathematics, emphasizing constructivity and rigorous logical modeling. The recent publications highlight a consistent trend in applying homotopy type theory to diverse mathematical structures—ranging from multisets and sets to planar graphs and category-theoretic constructions. These works demonstrate a deep engagement with univalent foundations and higher-dimensional reasoning, contributing to the theoretical robustness of type systems. No scientific awards are explicitly mentioned in the provided texts. Håkon advises research through collaborative publications, particularly with scholars like Jonathan Cubides and Daniel Gratzer. While no formal grants are listed, his sustained research output suggests active funding and academic support. He leads or contributes to research groups such as the Programming Theory group at UiB. He is involved in several research projects, including Algebraic Type Theory, Multisets and Sets in HoTT, Quoting Operations, and the Anti-Pattern Game. These initiatives reflect both serious theoretical inquiry and creative, interdisciplinary exploration.
