{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:33:25Z","timestamp":1743096805959,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031103629"},{"type":"electronic","value":"9783031103636"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10363-6_13","type":"book-chapter","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T12:20:21Z","timestamp":1656678021000},"page":"180-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Machine-Assisted Proofs for\u00a0Institutions in\u00a0Coq"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6598-5512","authenticated-orcid":false,"given":"Conor","family":"Reynolds","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3886-4675","authenticated-orcid":false,"given":"Rosemary","family":"Monahan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,3]]},"reference":[{"key":"13_CR1","unstructured":"Amato, G., Maggesi, M., Parton, M., Brogi, C.P.: Universal Algebra in UniMath (2020). https:\/\/arxiv.org\/abs\/2007.04840"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-10007-5_41","volume-title":"Abstract Software Specifications","author":"RM Burstall","year":"1980","unstructured":"Burstall, R.M., Goguen, J.A.: The semantics of clear, a specification language. In: Bj\u00f8orner, D. (ed.) Abstract Software Specifications. LNCS, vol. 86, pp. 292\u2013332. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10007-5_41"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-48256-3_10","volume-title":"Theorem Proving in Higher Order Logics","author":"V Capretta","year":"1999","unstructured":"Capretta, V.: Universal algebra in type theory. In: Bertot, Y., Dowek, G., Th\u00e9ry, L., Hirschowitz, A., Paulin, C. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 131\u2013148. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48256-3_10"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chlipala, A.: Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant. MIT Press (2013). http:\/\/adam.chlipala.net\/cpdt\/","DOI":"10.7551\/mitpress\/9153.001.0001"},{"key":"13_CR5","unstructured":"Coq Development Team: The Coq Proof Assistant. https:\/\/coq.inria.fr\/"},{"key":"13_CR6","unstructured":"Farrell, M.: Event-B in the Institutional Framework: Defining a Semantics, Modularisation Constructs and Interoperability for a Specification Language. Ph.D. thesis, National University of Ireland Maynooth (2017). http:\/\/mural.maynoothuniversity.ie\/9911\/"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-12896-4_366","volume-title":"Logics of Programs","author":"JA Goguen","year":"1984","unstructured":"Goguen, J.A., Burstall, R.M.: Introducing institutions. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 221\u2013256. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/3-540-12896-4_366"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"JA Goguen","year":"1992","unstructured":"Goguen, J.A., Burstall, R.M.: Institutions: abstract model theory for specification and programming. J. ACM 39(1), 95\u2013146 (1992). https:\/\/doi.org\/10.1145\/147508.147524","journal-title":"J. ACM"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.entcs.2018.10.010","volume":"338","author":"E Gunther","year":"2018","unstructured":"Gunther, E., Gadea, A., Pagano, M.: Formalization of universal algebra in Agda. Electron. Notes Theor. Comput. Sci. 338, 147\u2013166 (2018). https:\/\/doi.org\/10.1016\/j.entcs.2018.10.010","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46675-9_1","volume-title":"Fundamental Approaches to Software Engineering","author":"A Knapp","year":"2015","unstructured":"Knapp, A., Mossakowski, T., Roggenbach, M., Glauer, M.: An institution for simple UML state machines. In: Egyed, A., Schaefer, I. (eds.) FASE 2015. LNCS, vol. 9033, pp. 3\u201318. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46675-9_1"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Mossakowski, T., Goguen, J., Diaconescu, R., Tarlecki, A.: What is a logic? In: Logica Universalis, pp. 111\u2013133. Birkh\u00e4user Basel (2007)","DOI":"10.1007\/978-3-7643-8354-1_7"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-71209-1_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Mossakowski","year":"2007","unstructured":"Mossakowski, T., Maeder, C., L\u00fcttich, K.: The heterogeneous tool set, Hets. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 519\u2013522. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_40"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-030-77543-8_17","volume-title":"Rigorous State-Based Methods","author":"C Reynolds","year":"2021","unstructured":"Reynolds, C.: Formalizing the institution for Event-B in\u00a0the coq proof assistant. In: Raschke, A., M\u00e9ry, D. (eds.) ABZ 2021. LNCS, vol. 12709, pp. 162\u2013166. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77543-8_17"},{"key":"13_CR14","unstructured":"Riehl, E.: Category Theory in Context. Dover Modern Math Originals, Dover Publications, Aurora (2017)"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2005.11.007","volume":"354","author":"M Roggenbach","year":"2006","unstructured":"Roggenbach, M.: CSP-CASL\u2014a new integration of process algebra and algebraic specification. Theor. Comput. Sci. 354(1), 42\u201371 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2005.11.007","journal-title":"Theor. Comput. Sci."},{"key":"13_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33170-1","volume-title":"Industrial Deployment of System Engineering Methods","year":"2013","unstructured":"Romanovsky, A., Thomas, M. (eds.): Industrial Deployment of System Engineering Methods. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-33170-1"},{"key":"13_CR17","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17336-3","volume-title":"Foundations of Algebraic Specification and Formal Software Development","author":"D Sannella","year":"2012","unstructured":"Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. An EATCS Series, Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-17336-3"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-14052-5_29","volume-title":"Interactive Theorem Proving","author":"M Sozeau","year":"2010","unstructured":"Sozeau, M.: Equations: a dependent pattern-matching compiler. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 419\u2013434. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14052-5_29"},{"key":"13_CR19","unstructured":"Univalent Foundations Program: Homotopy Type Theory: Univalent Foundations of Mathematics (2013). https:\/\/homotopytypetheory.org\/book. Institute for Advanced Study"},{"key":"13_CR20","unstructured":"Wiegley, J.: Category Theory in Coq. https:\/\/github.com\/jwiegley\/category-theory"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10363-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T08:09:32Z","timestamp":1656749372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10363-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031103629","9783031103636"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10363-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tase2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ubbcluj.ro\/tase2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}