{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:39:22Z","timestamp":1726043962302},"publisher-location":"Cham","reference-count":14,"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_20","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:03:18Z","timestamp":1567969398000},"page":"373-390","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Nontermination Detection for Parallel C++ Programs"],"prefix":"10.1007","author":[{"given":"Vladim\u00edr","family":"\u0160till","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Barnat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"issue":"5","key":"20_CR1","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1147\/JRD.2010.2060276","volume":"54","author":"R Agarwal","year":"2010","unstructured":"Agarwal, R., et al.: Detection of deadlock potentials in multithreaded programs. IBM J. Res. Dev. 54(5), 3:1\u20133:15 (2010)","journal-title":"IBM J. Res. Dev."},{"key":"20_CR2","volume-title":"Principles of Model Checking (Representation and Mind Series)","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking (Representation and Mind Series). The MIT Press, Cambridge (2008)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-68167-2_14","volume-title":"Automated Technology for Verification and Analysis","author":"Z Baranov\u00e1","year":"2017","unstructured":"Baranov\u00e1, Z., et al.: Model Checking of C and C++ with DIVINE 4. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 201\u2013207. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-68167-2_14"},{"key":"20_CR4","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23404-5_5"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Bensalem, S., Havelund, K.: Scalable dynamic deadlock analysis of multi-threaded programs. In: 2005 Parallel and Distributed Systems: Testing and Debugging (2005)","DOI":"10.1007\/11678779_15"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-17502-3_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Beyer","year":"2019","unstructured":"Beyer, D.: Automatic verification of C and Java programs: SV-COMP 2019. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 133\u2013155. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-17502-3_9"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/TSE.2014.2301725","volume":"40","author":"Y Cai","year":"2014","unstructured":"Cai, Y., Chan, W.K.: Magiclock: scalable detection of potential deadlocks in large-scale multithreaded programs. IEEE Trans. Softw. Eng. 40(3), 266\u2013281 (2014)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00165-005-0071-z","volume":"17","author":"S Chaki","year":"2005","unstructured":"Chaki, S., Clarke, E., Ouaknine, J., Sharygina, N., Sinha, N.: Concurrent software verification with states, events, and deadlocks. Formal Aspects Comput. 17(4), 461\u2013483 (2005)","journal-title":"Formal Aspects Comput."},{"issue":"7","key":"20_CR9","first-page":"577","volume":"29","author":"C Demartini","year":"1999","unstructured":"Demartini, C., Iosif, R., Sisto, R.: A deadlock detection tool for concurrent Java programs. Softw.: Pract. Exp. 29(7), 577\u2013603 (1999)","journal-title":"Softw.: Pract. Exp."},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-030-02508-3_17","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2018","author":"H Lauko","year":"2018","unstructured":"Lauko, H., Ro\u010dkai, P., Barnat, J.: Symbolic computation via program transformation. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 313\u2013332. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-02508-3_17"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Ng, N., Yoshida, N.: Static deadlock detection for concurrent go by global session graph synthesis. In: Proceedings of the 25th International Conference on Compiler Construction, CC 2016, pp. 174\u2013184. ACM, New York (2016)","DOI":"10.1145\/2892208.2892232"},{"key":"20_CR12","series-title":"Cambridge Series in Statistical and Probabilistic Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810633","volume-title":"Markov Chains","author":"JR Norris","year":"1997","unstructured":"Norris, J.R.: Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (1997)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jss.2018.04.026","volume":"143","author":"P Ro\u010dkai","year":"2018","unstructured":"Ro\u010dkai, P., \u0160till, V., \u010cern\u00e1, I., Barnat, J.: DiVM: model checking with LLVM and graph memory. J. Syst. Softw. 143, 1\u201313 (2018). \n                      https:\/\/divine.fi.muni.cz\/2017\/divm\/","journal-title":"J. Syst. Softw."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-02450-5_8","volume-title":"Formal Methods and Software Engineering","author":"V \u0160till","year":"2018","unstructured":"\u0160till, V., Barnat, J.: Model checking of C++ programs under the x86-TSO memory model. In: Sun, J., Sun, M. (eds.) ICFEM 2018. LNCS, vol. 11232, pp. 124\u2013140. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-02450-5_8"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:42:22Z","timestamp":1567971742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30446-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304454","9783030304461"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30446-1_20","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)"}}]}}