{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:17Z","timestamp":1740099497968,"version":"3.37.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304454"},{"type":"electronic","value":"9783030304461"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30446-1_15","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:03:18Z","timestamp":1567969398000},"page":"275-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Isabelle\/DOF: Design and Implementation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6355-1200","authenticated-orcid":false,"given":"Achim D.","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhart","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"unstructured":"Fluent editor (2018). \n                      http:\/\/www.cognitum.eu\/Semantics\/FluentEditor\/","key":"15_CR1"},{"unstructured":"The neon toolkit (2018). \n                      http:\/\/neon-toolkit.org","key":"15_CR2"},{"unstructured":"Ontologies (2018). \n                      https:\/\/www.w3.org\/standards\/semanticweb\/ontology","key":"15_CR3"},{"unstructured":"Owlgred (2018). \n                      http:\/\/owlgred.lumii.lv\/","key":"15_CR4"},{"unstructured":"Prot\u00e9g\u00e9 (2018). \n                      https:\/\/protege.stanford.edu","key":"15_CR5"},{"unstructured":"Archive of formal proofs (2019). \n                      https:\/\/afp-isa.org","key":"15_CR6"},{"unstructured":"Ibm engineering requirements management doors family (2019). \n                      https:\/\/www.ibm.com\/us-en\/marketplace\/requirements-management","key":"15_CR7"},{"unstructured":"Jupyter (2019). \n                      https:\/\/jupyter.org\/","key":"15_CR8"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/BFb0027252","volume-title":"Formal Methods for Industrial Applications","author":"J-R Abrial","year":"1996","unstructured":"Abrial, J.-R.: Steam-boiler control specification problem. In: Abrial, J.-R., B\u00f6rger, E., Langmaack, H. (eds.) Formal Methods for Industrial Applications. LNCS, vol. 1165, pp. 500\u2013509. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/BFb0027252"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-39320-4_29","volume-title":"Intelligent Computer Mathematics","author":"B Barras","year":"2013","unstructured":"Barras, B., et al.: Pervasive parallelism in highly-trustable interactive theorem proving systems. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds.) CICM 2013. LNCS (LNAI), vol. 7961, pp. 359\u2013363. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39320-4_29"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-20615-8_1","volume-title":"Intelligent Computer Mathematics","author":"JC Blanchette","year":"2015","unstructured":"Blanchette, J.C., Haslbeck, M., Matichuk, D., Nipkow, T.: Mining the archive of formal proofs. In: Kerber, M., Carette, J., Kaliszyk, C., Rabe, F., Sorge, V. (eds.) CICM 2015. LNCS (LNAI), vol. 9150, pp. 3\u201317. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-20615-8_1"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-319-96812-4_3","volume-title":"Intelligent Computer Mathematics","author":"AD Brucker","year":"2018","unstructured":"Brucker, A.D., Ait-Sadoune, I., Crisafulli, P., Wolff, B.: Using the isabelle ontology framework. In: Rabe, F., Farmer, W.M., Passmore, G.O., Youssef, A. (eds.) CICM 2018. LNCS (LNAI), vol. 11006, pp. 23\u201338. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-96812-4_3"},{"unstructured":"Brucker, A.D., Br\u00fcgger, L., Wolff, B.: Formal network models and their application to firewall policies. Archive of Formal Proofs (2017). \n                      http:\/\/www.isa-afp.org\/entries\/UPF_Firewall.shtml","key":"15_CR13"},{"unstructured":"Brucker, A.D., Herzberg, M.: The Core DOM. Archive of Formal Proofs (2018). \n                      http:\/\/www.isa-afp.org\/entries\/Core_DOM.html","key":"15_CR14"},{"unstructured":"Brucker, A.D., Tuong, F., Wolff, B.: Featherweight OCL: a proposal for a machine-checked formal semantics for OCL 2.5. Archive of Formal Proofs (2014). \n                      http:\/\/www.isa-afp.org\/entries\/Featherweight_OCL.shtml","key":"15_CR15"},{"unstructured":"BS EN 50128:2011: Bs en 50128:2011: Railway applications - communication, signalling and processing systems - software for railway control and protecting systems. Standard, Britisch Standards Institute (BSI) (2014)","key":"15_CR16"},{"unstructured":"Common Criteria: Common criteria for information technology security evaluation (version 3.1), Part 3: Security assurance components (2006)","key":"15_CR17"},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10009-017-0457-2","volume":"20","author":"A Faithfull","year":"2018","unstructured":"Faithfull, A., Bengtson, J., Tassi, E., Tankink, C.: Coqoon - an IDE for interactiveproof development in coq. STTT 20(2), 125\u2013137 (2018). \n                      https:\/\/doi.org\/10.1007\/s10009-017-0457-2","journal-title":"STTT"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-540-72667-8_37","volume-title":"The Semantic Web: Research and Applications","author":"T Groza","year":"2007","unstructured":"Groza, T., Handschuh, S., M\u00f6ller, K., Decker, S.: SALT - semantically annotated LaTeX for scientific publications. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 518\u2013532. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-72667-8_37"},{"unstructured":"Hou, Z., Sanan, D., Tiu, A., Liu, Y.: A formal model for the SPARCv8 ISA and a proof of non-interference for the LEON3 processor. Archive of Formal Proofs (2016). \n                      http:\/\/isa-afp.org\/entries\/SPARCv8.html","key":"15_CR20"},{"unstructured":"Hupel, L., Zhang, Y.: CakeML. Archive of Formal Proofs (2018). \n                      http:\/\/isa-afp.org\/entries\/CakeML.html","key":"15_CR21"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/2560537","volume":"32","author":"G Klein","year":"2014","unstructured":"Klein, G., et al.: Comprehensive formal verification of an OS microkernel. ACM Trans. Comput. Syst. 32(1), 2:1\u20132:70 (2014). \n                      https:\/\/doi.org\/10.1145\/2560537","journal-title":"ACM Trans. Comput. Syst."},{"unstructured":"Nipkow, T.: Functional automata. Archive of Formal Proofs (2004). \n                      http:\/\/isa-afp.org\/entries\/Functional-Automata.html\n                      \n                    . Formal proof development","key":"15_CR23"},{"unstructured":"Nipkow, T.: Splay tree. Archive of Formal Proofs (2014). \n                      http:\/\/isa-afp.org\/entries\/Splay_Tree.html\n                      \n                    . Formal proof development","key":"15_CR24"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"unstructured":"Sprenger, C., Somaini, I.: Developing security protocols by refinement. Archive of Formal Proofs (2017). \n                      http:\/\/isa-afp.org\/entries\/Security_Protocol_Refinement.html\n                      \n                    . Formal proof development","key":"15_CR26"},{"unstructured":"Verbeek, F., et al.: Formal specification of a generic separation kernel. Archive of Formal Proofs (2014). \n                      http:\/\/isa-afp.org\/entries\/CISC-Kernel.html\n                      \n                    . Formal proof development","key":"15_CR27"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-319-08970-6_33","volume-title":"Interactive Theorem Proving","author":"M Wenzel","year":"2014","unstructured":"Wenzel, M.: Asynchronous user interaction and tool integration in Isabelle\/PIDE. In: Klein, G., Gamboa, R. (eds.) ITP 2014. LNCS, vol. 8558, pp. 515\u2013530. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-08970-6_33"},{"key":"15_CR29","doi-asserted-by":"publisher","first-page":"84","DOI":"10.4204\/EPTCS.167.10","volume":"167","author":"Makarius Wenzel","year":"2014","unstructured":"Wenzel, M.: System description: Isabelle\/jEdit in 2014. In: Proceedings Eleventh Workshop on User Interfaces for Theorem Provers, UITP 2014, Vienna, Austria, 17th July 2014, pp. 84\u201394 (2014). \n                      https:\/\/doi.org\/10.4204\/EPTCS.167.10","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"unstructured":"Wenzel, M.: The Isabelle\/Isar Reference Manual (2017). Part of the Isabelle distribution","key":"15_CR30"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30446-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:42:49Z","timestamp":1567971769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30446-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304454","9783030304461"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30446-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sefm2019.inria.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":"89","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":"27","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":"0","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":"6","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)"}}]}}