Formalizing the Institution for Event-B in the Coq Proof Assistant

Abstract

We formalize a fragment of the theory of institutions sufficient to establish basic facts about the institution for Event-B, and its relationship with the institution for first-order predicate logic. We prove the satisfaction condition for and encode the institution comorphism embedding in .

Document

If you cannot see the document below, the PDF document is most likely not freely accessible. In this case, please try to access the document via this link.

Reference

% BibTex
@inproceedings{Reynolds21,
  author       = {Conor Reynolds},
  editor       = {Alexander Raschke and
                  Dominique M{\'{e}}ry},
  title        = {Formalizing the Institution for Event-B in the Coq Proof Assistant},
  booktitle    = {Rigorous State-Based Methods - 8th International Conference, {ABZ}
                  2021, Ulm, Germany, June 9-11, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12709},
  pages        = {162--166},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-77543-8\_17},
  doi          = {10.1007/978-3-030-77543-8\_17},
  timestamp    = {Tue, 15 Jun 2021 17:24:03 +0200},
  biburl       = {https://dblp.org/rec/conf/asm/Reynolds21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}