I was a postdoc at the University of Manchester working on a variety of things. I’m part of the Autonomy and Verification group.
I spent my PhD encoding the theory of institutions in the Rocq Prover. Formerly known as the Coq proof assistant. You can read about the name change on their website. (It’s all on GitHub.) There are six or so concrete logics encoded there as of this writing, depending on how you count it.
I wrote lots of teaching resources while I was a PhD student at Maynooth. You can see a small selection of them here.
2025
Adventures in FRET and Specification.
Farrell, M., Luckcuck, M., Monahan, R., Reynolds, C., and Sheridan, O. In Leveraging Applications of Formal Methods, (Cham), Springer Nature Switzerland, 106–123.
Farrell, M., Luckcuck, M., Monahan, R., Reynolds, C., and Sheridan, O. In Leveraging Applications of Formal Methods, (Cham), Springer Nature Switzerland, 106–123.
@inproceedings{farrell_adventures_2025, address = {Cham}, title = {Adventures in {FRET} and {Specification}}, isbn = {978-3-031-75380-0}, doi = {10.1007/978-3-031-75380-0_7}, abstract = {This paper gives an overview of previous work in which the authors used NASA’s Formal Requirement Elicitation Tool (FRET) to formalise requirements. We discuss four case studies where we used FRET to capture the system’s requirements. These formalised requirements subsequently guided the case study specifications in a combination of formal paradigms. For each case study we summarise insights gained during this process, exploring the expressiveness and the potential interoperability of these approaches. Our experience confirms FRET’s suitability as a framework for the elicitation and understanding of requirements and for providing traceability from requirements to specification.}, language = {en}, booktitle = {Leveraging {Applications} of {Formal} {Methods}}, publisher = {Springer Nature Switzerland}, author = {Farrell, Marie and Luckcuck, Matt and Monahan, Rosemary and Reynolds, Conor and Sheridan, Oisín}, editor = {Margaria, Tiziana and Steffen, Bernhard}, year = {2025}, pages = {106–123}, }
2024
Reasoning about logical systems in the Coq proof assistant.
Reynolds, C., and Monahan, R. Science of Computer Programming, 233, 103054.
Reynolds, C., and Monahan, R. Science of Computer Programming, 233, 103054.
@article{reynolds_reasoning_2024, title = {Reasoning about logical systems in the {Coq} proof assistant}, volume = {233}, issn = {0167-6423}, url = {https://www.sciencedirect.com/science/article/pii/S0167642323001363}, doi = {10/gs7f2x}, abstract = {The theory of institutions provides an abstract mathematical framework for specifying logical systems and their semantic relationships. Institutions are based on category theory and have deep roots in a well-developed branch of algebraic specification. However, there are no machine-assisted proofs of correctness for institution-theoretic constructions—chiefly satisfaction conditions for institutions and their (co)morphisms—making them difficult to incorporate into mainstream formal methods. This paper therefore provides the details of our approach to formalizing a fragment of the theory of institutions in the Coq proof assistant. We instantiate this framework with the institutions FOPEQ for first-order predicate logic and EVT for the Event-B specification language, and define some institution-independent constructions, all of which serve as an illustration and evaluation of the overall approach.}, urldate = {2023-11-30}, journal = {Science of Computer Programming}, author = {Reynolds, Conor and Monahan, Rosemary}, month = mar, year = {2024}, pages = {103054}, }
FRETting and Formal Modelling: A Mechanical Lung Ventilator.
Farrell, M., Luckcuck, M., Monahan, R., Reynolds, C., and Sheridan, O. In Rigorous State-Based Methods, (Cham), Springer Nature Switzerland, 360–383.
Farrell, M., Luckcuck, M., Monahan, R., Reynolds, C., and Sheridan, O. In Rigorous State-Based Methods, (Cham), Springer Nature Switzerland, 360–383.
@inproceedings{farrell_fretting_2024, address = {Cham}, title = {{FRETting} and {Formal} {Modelling}: {A} {Mechanical} {Lung} {Ventilator}}, isbn = {978-3-031-63790-2}, shorttitle = {{FRETting} and {Formal} {Modelling}}, doi = {10.1007/978-3-031-63790-2_28}, abstract = {In this paper, we use NASA’s Formal Requirements Elicitation Tool (FRET) and the Event-B formal method to model and verify the requirements for the ABZ 2024 case study, the Mechanical Lung Ventilator. We use the FRET requirements to guide the development of a formal design model in Event-B. We provide details about the artefacts produced and reflect on our experience of using these tools in this case study. We focus on the Functional and Controller requirements for the system, as given in the case study documentation. This paper provides a first step towards using Event-B as part of a FRET-guided verification workflow in a large case study.}, language = {en}, booktitle = {Rigorous {State}-{Based} {Methods}}, publisher = {Springer Nature Switzerland}, author = {Farrell, Marie and Luckcuck, Matt and Monahan, Rosemary and Reynolds, Conor and Sheridan, Oisín}, editor = {Bonfanti, Silvia and Gargantini, Angelo and Leuschel, Michael and Riccobene, Elvinia and Scandurra, Patrizia}, year = {2024}, pages = {360–383}, }
2023
Machine-Assisted Proofs for Institutions.
Reynolds, C. PhD Thesis. Maynooth University.
Reynolds, C. PhD Thesis. Maynooth University.
@phdthesis{mu19948, title = {Machine-{Assisted} {Proofs} for {Institutions}}, url = {https://mural.maynoothuniversity.ie/id/eprint/19948/}, abstract = {Institution theory is the abstract study of logical systems using category theory. The theory has expanded since the ‘80s to encompass and relate a wide range of concrete logical systems. But inducting particular logical systems into the theory can be tiresome—often straightforward, but repetitive, technical, and prone to error. Worse, such work suffers from the very problem which motivates abstraction: we find ourselves proving the same things over and over again. In this thesis we will describe a framework for easing the process of constructing institutions and verifying their properties. The goal is primarily to expedite the verification of those proof obligations most commonly involved in constructing institutions. We start by encoding the institution for first-order predicate logic, turning later to the semantics for the Event-B modelling method. We then explore a particular logic combination of Event-B and linear temporal logic, as well as some interesting institution-independent constructions that enable generic logic combinations and translations—all of which will serve as useful work in its own right, but also as a demonstration of the framework.}, language = {English}, school = {Maynooth University}, author = {Reynolds, Conor}, year = {2023}, note = {Publisher: National University of Ireland Maynooth}, keywords = {coq, institutions}, }
2022
Machine-Assisted Proofs for Institutions in Coq.
Reynolds, C., and Monahan, R. In Theoretical Aspects of Software Engineering, (Cham), Springer International Publishing, 180–196.
Reynolds, C., and Monahan, R. In Theoretical Aspects of Software Engineering, (Cham), Springer International Publishing, 180–196.
@inproceedings{reynolds_machine-assisted_2022, address = {Cham}, title = {Machine-{Assisted} {Proofs} for {Institutions} in {Coq}}, copyright = {All rights reserved}, isbn = {978-3-031-10363-6}, doi = {10/gqfnb6}, booktitle = {Theoretical {Aspects} of {Software} {Engineering}}, publisher = {Springer International Publishing}, author = {Reynolds, Conor and Monahan, Rosemary}, editor = {Aït-Ameur, Yamine and Crăciun, Florin}, year = {2022}, pages = {180–196}, }
2021
Using Dafny to Solve the VerifyThis 2021 Challenges.
Farrell, M., Reynolds, C., and Monahan, R. In Proceedings of the 23rd ACM International Workshop on Formal Techniques for Java-like Programs, (New York, NY, USA), Association for Computing Machinery, 32–38.
Farrell, M., Reynolds, C., and Monahan, R. In Proceedings of the 23rd ACM International Workshop on Formal Techniques for Java-like Programs, (New York, NY, USA), Association for Computing Machinery, 32–38.
@inproceedings{farrell_using_2021, address = {New York, NY, USA}, series = {{FTfJP} 2021}, title = {Using {Dafny} to {Solve} the {VerifyThis} 2021 {Challenges}}, isbn = {978-1-4503-8543-5}, doi = {10/gp5v6h}, urldate = {2022-05-16}, booktitle = {Proceedings of the 23rd {ACM} {International} {Workshop} on {Formal} {Techniques} for {Java}-like {Programs}}, publisher = {Association for Computing Machinery}, author = {Farrell, Marie and Reynolds, Conor and Monahan, Rosemary}, month = jul, year = {2021}, pages = {32–38}, }
Formalizing the Institution for Event-B in the Coq Proof Assistant.
Reynolds, C. In Rigorous State-Based Methods, (Cham), Springer International Publishing, 162–166.
Reynolds, C. In Rigorous State-Based Methods, (Cham), Springer International Publishing, 162–166.
@inproceedings{reynolds_formalizing_2021, address = {Cham}, series = {Lecture {Notes} in {Computer} {Science}}, title = {Formalizing the {Institution} for {Event}-{B} in the {Coq} {Proof} {Assistant}}, copyright = {All rights reserved}, isbn = {978-3-030-77543-8}, doi = {10/gpjt7c}, language = {en}, booktitle = {Rigorous {State}-{Based} {Methods}}, publisher = {Springer International Publishing}, author = {Reynolds, Conor}, editor = {Raschke, Alexander and Méry, Dominique}, year = {2021}, pages = {162–166}, }