{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:37:07Z","timestamp":1742978227878,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331626"},{"type":"electronic","value":"9783031331633"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33163-3_4","type":"book-chapter","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T12:45:38Z","timestamp":1684154738000},"page":"43-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Introducing Inductive Construction in\u00a0B with\u00a0the\u00a0Theory Plugin"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2478-4228","authenticated-orcid":false,"given":"Julien","family":"Cervelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3672-402X","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Gervais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,15]]},"reference":[{"key":"4_CR1","volume-title":"The B-Book - Assigning Programs to Meanings","author":"J Abrial","year":"2005","unstructured":"Abrial, J.: The B-Book - Assigning Programs to Meanings. Cambridge University Press, Cambridge (2005)"},{"key":"4_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195881","volume-title":"Modeling in Event-B - System and Software Engineering","author":"J Abrial","year":"2010","unstructured":"Abrial, J.: Modeling in Event-B - System and Software Engineering. Cambridge University Press, Cambridge (2010)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-45648-1_19","volume-title":"ZB 2002:Formal Specification and Development in Z and B","author":"J-R Abrial","year":"2002","unstructured":"Abrial, J.-R., Cansell, D., Laffitte, G.: \u201cHigher-Order\u2019\u2019 Mathematics in B. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) ZB 2002. LNCS, vol. 2272, pp. 370\u2013393. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45648-1_19"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-031-07727-2_2","volume-title":"Integrated Formal Methods","author":"YA Ameur","year":"2022","unstructured":"Ameur, Y.A., et al.: Empowering the event-b method using external theories. In: ter Beek, M.H., Monahan, R. (eds.) Integrated Formal Methods. LNCS, vol. 13274, pp. 18\u201335. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07727-2_2"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 825\u2013885. IOS Press (2009). https:\/\/doi.org\/10.3233\/978-1-58603-929-5-825","DOI":"10.3233\/978-1-58603-929-5-825"},{"key":"4_CR6","volume-title":"Foundations of Constructive Analysis","author":"E Bishop","year":"1967","unstructured":"Bishop, E.: Foundations of Constructive Analysis. Academic Press, Cambridge (1967)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-39698-4_5","volume-title":"Theories of Programming and Formal Methods","author":"M Butler","year":"2013","unstructured":"Butler, M., Maamria, I.: Practical theory extension in Event-B. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 8051, pp. 67\u201381. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39698-4_5"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Ciesielski, K.: Set Theory for the Working Mathematician. London Mathematical Society Student Texts, Cambridge University Press (1997). https:\/\/doi.org\/10.1017\/CBO9781139173131","DOI":"10.1017\/CBO9781139173131"},{"key":"4_CR9","first-page":"557","volume":"41","author":"H Friedman","year":"1976","unstructured":"Friedman, H.: Systems of second order arithmetic with restricted induction, I & II (abstracts). Symbolic Logic 41, 557\u2013559 (1976)","journal-title":"Symbolic Logic"},{"key":"4_CR10","unstructured":"Hoang, T.S., Fathabadi, A.S., Butler, M., Voisin, L.: Theory plug-in for rodin 3.x. In: 6th Rodin User and Developer Workshop (2016). https:\/\/eprints.soton.ac.uk\/405494\/"},{"key":"4_CR11","unstructured":"Irvine, A.D., Deutsch, H.: Russell\u2019s paradox. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Spring (2021)"},{"key":"4_CR12","unstructured":"Kunen, K.: Set theory - an introduction to independence proofs. In: Studies in Logic and the Foundations of Mathematics (1983)"},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF01458217","volume":"76","author":"L L\u00f6wenheim","year":"1915","unstructured":"L\u00f6wenheim, L.: \u00dcber m\u00f6glichkeiten im relativkalk\u00fcl. Math. Ann. 76(4), 447\u2013470 (1915)","journal-title":"Math. Ann."},{"key":"4_CR14","unstructured":"RODIN: User manual of the RODIN platform. https:\/\/deploy-eprints.ecs.soton.ac.uk\/11\/1\/manual-2.3.pdf (2007)"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic. Perspectives in Logic, Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9780511581007","DOI":"10.1017\/CBO9780511581007"},{"key":"4_CR16","unstructured":"Skolem, T.: Logisch-kombinatorische untersuchungen \u00fcber die erf\u00fcllbarkeit oder beweisbarkeit mathematischer s\u00e4tze nebst einem theoreme \u00fcber dichte mengen. I. Matematisk-naturvidenskabelig Klasse 4, 1\u201336 (1920)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01449999","volume":"65","author":"E Zermelo","year":"1908","unstructured":"Zermelo, E.: Untersuchen \u00fcber die grundlagen der mengenlehre I. Math. Ann. 65, 261\u2013281 (1908)","journal-title":"Math. Ann."}],"container-title":["Lecture Notes in Computer Science","Rigorous State-Based Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33163-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T08:02:42Z","timestamp":1686384162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33163-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331626","9783031331633"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33163-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ABZ","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Rigorous State-Based Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"abz2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/abz2023.loria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"47","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":"12","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":"7","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":"26% - 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":"4","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":"2","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)"}}]}}