{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:35:51Z","timestamp":1742920551495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549930"},{"type":"electronic","value":"9783030549947"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-54994-7_5","type":"book-chapter","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T20:03:45Z","timestamp":1597262625000},"page":"46-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Model Checking in a Development Workflow: A Study on a Concurrent C++ Hash Table"],"prefix":"10.1007","author":[{"given":"Petr","family":"Ro\u010dkai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,13]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Baranov\u00e1, Z., et al.: Model checking of C and C++ with DIVINE 4 (2017)","DOI":"10.1007\/978-3-319-68167-2_14"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-23404-5_5","volume-title":"Model Checking Software","author":"J Barnat","year":"2015","unstructured":"Barnat, J., Ro\u010dkai, P., \u0160till, V., Weiser, J.: Fast, dynamically-sized concurrent hash table. In: Fischer, B., Geldenhuys, J. (eds.) SPIN 2015. LNCS, vol. 9232, pp. 49\u201365. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23404-5_5"},{"issue":"7","key":"5_CR3","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1002\/spe.2242","volume":"45","author":"Z Chen","year":"2015","unstructured":"Chen, Z., Gu, Y., Huang, Z., Zheng, J., Liu, C., Liu, Z.: Model checking aircraft controller software: a case study. Softw. Pract. Exp. 45(7), 989\u20131017 (2015). \nhttps:\/\/doi.org\/10.1002\/spe.2242","journal-title":"Softw. Pract. Exp."},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Fitzgerald, J., Bicarregui, J., Larsen, P.G., Woodcock, J.: Industrial Deployment of Formal Methods: Trends and Challenges. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33170-110\n\n. ISBN 978-3-642-33170-1","DOI":"10.1007\/978-3-642-33170-110"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.scico.2013.03.005","volume":"82","author":"X Gan","year":"2014","unstructured":"Gan, X., Dubrovin, J., Heljanko, K.: A symbolic model checking approach to verifying satellite onboard software. Sci. Comput. Program. 82, 44\u201355 (2014). \nhttps:\/\/doi.org\/10.1016\/j.scico.2013.03.005","journal-title":"Sci. Comput. Program."},{"issue":"12","key":"5_CR6","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1016\/j.scico.2012.11.009","volume":"78","author":"YL Hwong","year":"2013","unstructured":"Hwong, Y.L., Keiren, J.J., Kusters, V.J., Leemans, S., Willemse, T.A.: Formalising and analysing the control software of the CMS experiment at the large hadron collider. Sci. Comput. Program. 78(12), 2435\u20132452 (2013). \nhttps:\/\/doi.org\/10.1016\/j.scico.2012.11.009","journal-title":"Sci. Comput. Program."},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Klein, G., et al.: seL4: formal verification of an OS kernel. In: SOSP, pp. 207\u2013220. ACM (2009). \nhttps:\/\/doi.org\/10.1145\/1629575.1629596","DOI":"10.1145\/1629575.1629596"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"L\u00e5ng, J., Prasetya, I.S.W.B.: Model checking a C++ software framework, a case study (2019). \nhttps:\/\/doi.org\/10.1145\/3338906.3340453","DOI":"10.1145\/3338906.3340453"},{"key":"5_CR9","unstructured":"O\u2019Callahan, R., Jones, C., Froyd, N., Huey, K., Noll, A., Partush, N.: Engineering record and replay for deployability (2017). \narXiv:1705.05937"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Penix, J., Visser, W., Engstrom, E., Larson, A., Weininger, N.: Verification of time partitioning in the DEOS scheduler kernel. In: International Conference on Software Engineering, pp. 488\u2013497. ACM Press (2000)","DOI":"10.1145\/337180.337364"},{"key":"5_CR11","unstructured":"Potts, D., Bourquin, R., Andresen, L., Andronick, J., Klein, G., Heiser, G.: Mathematically verified software kernels: raising the bar for high assurance implementations. Technical report, NICTA, Sydney, Australia (2014)"},{"key":"5_CR12","unstructured":"Ro\u010dkai, P., Barnat, J.: A simulator for LLVM bitcode (2017). \nhttps:\/\/arxiv.org\/abs\/1704.05551\n\n. Preliminary version"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38088-4_1","volume-title":"NASA Formal Methods","author":"P Ro\u010dkai","year":"2013","unstructured":"Ro\u010dkai, P., Barnat, J., Brim, L.: Improved state space reductions for LTL model checking of C and C++ programs. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 1\u201315. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38088-4_1"},{"key":"5_CR14","unstructured":"Stallman, R., Pesch, R., Shebs, S.: Debugging with GDB (2010)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Visan, A.-M., Arya, K., Cooperman, G., Denniston, T.: URDB: a universal reversible debugger based on decomposing debugging histories. In: PLOS 2011 (2011)","DOI":"10.1145\/2039239.2039251"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/1592434.1592436","volume":"41","author":"J Woodcock","year":"2009","unstructured":"Woodcock, J., Larsen, P.G., Bicarregui, J., Fitzgerald, J.: Formal methods: practice and experience. ACM Comput. Surv. 41(4), 19:1\u201319:36 (2009). \nhttps:\/\/doi.org\/10.1145\/1592434.1592436","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Formal Methods. FM 2019 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54994-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T20:05:39Z","timestamp":1597262739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-54994-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549930","9783030549947"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54994-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/?page_id=84","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":"129","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":"44","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":"34% - 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":"5,5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}