{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:02Z","timestamp":1750306682298,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,13]],"date-time":"2015-07-13T00:00:00Z","timestamp":1436745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,13]]},"DOI":"10.1145\/2771783.2771790","type":"proceedings-article","created":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T14:10:55Z","timestamp":1436537455000},"page":"141-152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["When truth is efficient: analysing concurrency"],"prefix":"10.1145","author":[{"given":"Ganesh","family":"Narayanaswamy","sequence":"first","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"523","volume-title":"International Conference on Computer Aided Verification","volume":"8559","author":"Alglave Jade"},{"volume-title":"Accessed 20th","year":"2015","author":"Barrett Richard Frederick","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","first-page":"52","volume-title":"Plingeling and Treengeling Entering the SAT Competition","author":"Biere Armin","year":"2013"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011276507260"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_3_2_1_7_1","volume-title":"Subodh Sharma. Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs. In International Symposium on Formal Methods","volume":"8442","author":"Forejt Vojt\u02c7","year":"2014"},{"volume-title":"Failures-Divergence Refinement \u2013 FDR2 User Manual","year":"2000","author":"Ltd Formal Systems","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2011.22"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"201","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Gibson-Robinson Thomas"},{"key":"e_1_3_2_1_11_1","first-page":"71","volume-title":"International Conference on Concurrency Theory","volume":"2761","author":"Glabbeek Rob"},{"volume-title":"Workshop on Exploiting Concurrency Efficiently and Correctly","year":"2008","author":"Godefroid Patrice","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043194"},{"key":"e_1_3_2_1_14_1","volume-title":"Java SE 7 Edition","author":"Gosling James","year":"2013","edition":"1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.03.003"},{"volume-title":"Accessed 20th","year":"2015","author":"Griesemer Robert","key":"e_1_3_2_1_16_1"},{"volume-title":"http:\/\/www.mcs.anl.gov\/research\/ projects\/mpi\/libraries.html. Accessed 20th","year":"2015","author":"Gropp William","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33518-1_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389037"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2009.48"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_31"},{"key":"e_1_3_2_1_22_1","volume-title":"International Conference on Parallel Computing","volume":"13","author":"Krammer Bettina","year":"2003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.701"},{"volume-title":"MPI: A message-passing interface standard, version 2.2. Specification","year":"2009","author":"Lusk Erwing","key":"e_1_3_2_1_24_1"},{"volume-title":"Accessed 20th","year":"2015","author":"McPherson Allen","key":"e_1_3_2_1_25_1"},{"volume-title":"Communication and concurrency. PHI Series in computer science","year":"1989","author":"Milner Robin","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01379149"},{"volume-title":"The Theory and Practice of Concurrency","year":"1998","author":"Roscoe A.W.","key":"e_1_3_2_1_28_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-258-0"},{"volume-title":"University of Oxford","year":"1998","author":"Scattergood B.","key":"e_1_3_2_1_30_1"},{"key":"e_1_3_2_1_31_1","first-page":"58","volume-title":"International Conference on Verification, Model Checking, and Abstract Interpretation","volume":"4349","author":"Siegel Stephen F."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87475-1_31"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941603"},{"issue":"4","key":"e_1_3_2_1_34_1","first-page":"427","volume":"5","author":"Siegel Stephen F.","year":"2011","journal-title":"Zirkel. FEVS: A Functional Equivalence Verification Suite for High-Performance Scientific Computing. Mathematics in Computer Science"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.32"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/1206212X.2006.11441784"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_9"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05089-3_46"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345258"},{"volume-title":"International Conference on High Performance Computing Networking, Storage and Analysis","year":"2000","author":"Vetter Jeffrey S.","key":"e_1_3_2_1_40_1"},{"volume-title":"Scalable Formal Dynamic Verification of MPI Programs Through Distributed Causality Tracking. School of Computing","year":"2011","author":"Vo Anh","key":"e_1_3_2_1_41_1"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.7"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504214"},{"first-page":"392","volume-title":"LNCS","author":"Winskel Glynn","key":"e_1_3_2_1_44_1"}],"event":{"name":"ISSTA '15: International Symposium on Software Testing and Analysis","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Baltimore MD USA","acronym":"ISSTA '15"},"container-title":["Proceedings of the 2015 International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2771783.2771790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2771783.2771790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:14Z","timestamp":1750230074000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2771783.2771790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,13]]},"references-count":44,"alternative-id":["10.1145\/2771783.2771790","10.1145\/2771783"],"URL":"https:\/\/doi.org\/10.1145\/2771783.2771790","relation":{},"subject":[],"published":{"date-parts":[[2015,7,13]]},"assertion":[{"value":"2015-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}