{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:09:45Z","timestamp":1776305385638,"version":"3.50.1"},"reference-count":131,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T00:00:00Z","timestamp":1662595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Deutsche Forschungsgesellschaft","award":["418257054"],"award-info":[{"award-number":["418257054"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2022,10,31]]},"abstract":"<jats:p>\n            Over the last years, witness-based validation of verification results has become an established practice in software verification: An independent validator re-establishes verification results of a software verifier using verification witnesses, which are stored in a standardized exchange format. In addition to validation, such exchangable information about proofs and alarms found by a verifier can be shared across verification tools, and users can apply independent third-party tools to visualize and explore witnesses to help them comprehend the causes of bugs or the reasons why a given program is correct. To achieve the goal of making verification results more accessible to engineers, it is necessary to consider witnesses as first-class exchangeable objects, stored independently from the source code and checked independently from the verifier that produced them, respecting the important principle of separation of concerns. We present the conceptual principles of verification witnesses, give a description of how to use them, provide a technical specification of the exchange format for witnesses, and perform an extensive experimental study on the application of witness-based result validation, using the validators\n            <jats:sc>CPAchecker<\/jats:sc>\n            ,\n            <jats:sc>UAutomizer<\/jats:sc>\n            ,\n            <jats:sc>CPA-witness2test<\/jats:sc>\n            , and\n            <jats:sc>FShell-witness2test<\/jats:sc>\n            .\n          <\/jats:p>","DOI":"10.1145\/3477579","type":"journal-article","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T10:04:46Z","timestamp":1653645886000},"page":"1-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Verification Witnesses"],"prefix":"10.1145","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4832-7662","authenticated-orcid":false,"given":"Dirk","family":"Beyer","sequence":"first","affiliation":[{"name":"LMU Munich, Munich, Bayern, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7333-6734","authenticated-orcid":false,"given":"Matthias","family":"Dangl","sequence":"additional","affiliation":[{"name":"LMU Munich, Munich, Bayern, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8947-5373","authenticated-orcid":false,"given":"Daniel","family":"Dietsch","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg, Baden-W\u00fcrttemberg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-3558","authenticated-orcid":false,"given":"Matthias","family":"Heizmann","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg, Baden-W\u00fcrttemberg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0291-815X","authenticated-orcid":false,"given":"Thomas","family":"Lemberger","sequence":"additional","affiliation":[{"name":"LMU Munich, Munich, Bayern, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7947-983X","authenticated-orcid":false,"given":"Michael","family":"Tautschnig","sequence":"additional","affiliation":[{"name":"Queen Mary University of London, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2022,9,8]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2011.15"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24372-1_3"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2007.236"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99527-0_33"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1965724.1965743"},{"key":"e_1_3_3_7_2","volume-title":"SLIC: A Specification Language for Interface Checking (of C)","author":"Ball T.","year":"2002","unstructured":"T. Ball and S. K. Rajamani. 2002. SLIC: A Specification Language for Interface Checking (of C). Technical Report MSR-TR-2001-21. Microsoft Research. Retrieved from https:\/\/www.microsoft.com\/en-us\/research\/publication\/slic-a-specification-language-for-interface-checking-of-c\/."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503274"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10641"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_38"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_31"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_55"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54580-5_20"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17502-3_9"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2019.00026"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2559175"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45237-7_21"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.3630188"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72013-1_24"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2004.1317455"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27864-1_2"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2009.5351147"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_28"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950351"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.3731856"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786867"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-92994-1_1"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_42"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-017-9432-6"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61362-4_26"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8_16"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-007-0044-z"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393664"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250769"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_51"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_26"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16722-6_23"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180259"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_16"},{"key":"e_1_3_3_40_2","first-page":"189","volume-title":"Proceedings of the Formal Methods in Computer Aided Design.","author":"Beyer D.","year":"2010","unstructured":"D. Beyer, M. E. Keremoglu, and P. Wendler. 2010. Predicate abstraction with adjustable-block encoding. In Proceedings of the Formal Methods in Computer Aided Design.189\u2013197. Retrieved from https:\/\/www.sosy-lab.org\/research\/pub\/2010-FMCAD.Predicate_Abstraction_with_Adjustable-Block_Encoding.pdf."},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47166-2_14"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00105"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37057-1_11"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-017-0469-y"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53291-8_10"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61362-4_8"},{"key":"e_1_3_3_47_2","first-page":"106","volume-title":"Proceedings of the 2012 Formal Methods in Computer-Aided Design.","author":"Beyer D.","year":"2012","unstructured":"D. Beyer and P. Wendler. 2012. Algorithms for software model checking: Predicate abstraction vs. Impact. In Proceedings of the 2012 Formal Methods in Computer-Aided Design.106\u2013113. Retrieved from https:\/\/www.sosy-lab.org\/research\/pub\/2012-FMCAD.Algorithms_for_Software_Model_Checking.pdf."},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39176-7_1"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_12"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(03)58003-2"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49059-0_14"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45848-4_59"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46675-9_6"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180445"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250743"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17524-9_1"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115633"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.22"},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_29"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/217474.217565"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39910-0_9"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062522"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96145-3_3"},{"key":"e_1_3_3_65_2","first-page":"106","volume-title":"Proceedings of the 2nd International Symposium on Programming.","author":"Cousot P.","year":"1976","unstructured":"P. Cousot and R. Cousot. 1976. Static determination of dynamic properties of programs. In Proceedings of the 2nd International Symposium on Programming.Dunod, 106\u2013130. Retrieved from https:\/\/www.di.ens.fr\/cousot\/COUSOTpapers\/publications.www\/CousotCousot-ISOP-76-Dunod-p106--130-1976.pdf."},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.2307\/2963593"},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062533"},{"key":"e_1_3_3_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_7"},{"key":"e_1_3_3_70_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23702-7_26"},{"key":"e_1_3_3_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_22"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32759-9_17"},{"key":"e_1_3_3_73_2","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-041-3-481"},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03592-1_2"},{"key":"e_1_3_3_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950346"},{"key":"e_1_3_3_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_6"},{"key":"e_1_3_3_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_3_78_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63166-6_10"},{"key":"e_1_3_3_79_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-005-0202-0"},{"key":"e_1_3_3_80_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44829-2_8"},{"key":"e_1_3_3_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/1181775.1181790"},{"key":"e_1_3_3_82_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49059-0_28"},{"key":"e_1_3_3_83_2","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328459"},{"key":"e_1_3_3_84_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54580-5_30"},{"key":"e_1_3_3_85_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_2"},{"key":"e_1_3_3_86_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_45"},{"key":"e_1_3_3_87_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39910-0_16"},{"key":"e_1_3_3_88_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1610.06229"},{"key":"e_1_3_3_89_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12209"},{"key":"e_1_3_3_90_2","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859084"},{"key":"e_1_3_3_91_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2003.1201203"},{"key":"e_1_3_3_92_2","first-page":"27","volume-title":"Automatic Test Generation From Statecharts Using Modle Checking","author":"Hong H. S.","year":"2001","unstructured":"H. S. Hong, I. Lee, and O. Sokolsky. 2001. Automatic Test Generation From Statecharts Using Modle Checking. Technical Report MS-CIS-01-07. University of Pennsylvania. 27 pages. Retrieved from https:\/\/repository.upenn.edu\/cgi\/viewcontent.cgi?article=1092&context=cis_reports."},{"key":"e_1_3_3_93_2","volume-title":"Proceedings of the TACAS (2) (LNCS 13244)","author":"Howar F.","year":"2022","unstructured":"F. Howar and M. Mues. 2022. GWit (competition contribution). In Proceedings of the TACAS (2) (LNCS 13244). Springer."},{"key":"e_1_3_3_94_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_1"},{"key":"e_1_3_3_95_2","doi-asserted-by":"publisher","DOI":"10.1109\/WoSoCER.2011.14"},{"key":"e_1_3_3_96_2","doi-asserted-by":"publisher","DOI":"10.1145\/2632362.2632372"},{"key":"e_1_3_3_97_2","doi-asserted-by":"publisher","DOI":"10.1145\/3014427"},{"key":"e_1_3_3_98_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0153-x"},{"key":"e_1_3_3_99_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_40"},{"key":"e_1_3_3_100_2","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.72.6"},{"key":"e_1_3_3_101_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11486-1_14"},{"key":"e_1_3_3_102_2","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_3_3_103_2","doi-asserted-by":"publisher","DOI":"10.1007\/11758525_71"},{"key":"e_1_3_3_104_2","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2005.1487900"},{"key":"e_1_3_3_105_2","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321698"},{"key":"e_1_3_3_106_2","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336789"},{"key":"e_1_3_3_107_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.41"},{"key":"e_1_3_3_108_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.09.009"},{"key":"e_1_3_3_109_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45069-6_1"},{"key":"e_1_3_3_110_2","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_14"},{"key":"e_1_3_3_111_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21437-0_8"},{"key":"e_1_3_3_112_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44585-4_2"},{"key":"e_1_3_3_113_2","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263712"},{"key":"e_1_3_3_114_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6"},{"key":"e_1_3_3_115_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-74313-4_30"},{"key":"e_1_3_3_116_2","unstructured":"OASIS. 2019. Static Analysis Results Interchange Format (SARIF) Version 2.0. Retrieved 23 July 2022 from https:\/\/docs.oasis-open.org\/sarif\/sarif\/v2.0\/csprd02\/sarif-v2.0-csprd02.html."},{"key":"e_1_3_3_117_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99527-0_24"},{"key":"e_1_3_3_118_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30729-4_10"},{"key":"e_1_3_3_119_2","doi-asserted-by":"publisher","DOI":"10.1145\/353323.353382"},{"key":"e_1_3_3_120_2","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081750"},{"key":"e_1_3_3_121_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00593-0_32"},{"key":"e_1_3_3_122_2","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.167.8"},{"key":"e_1_3_3_123_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45190-5_3"},{"key":"e_1_3_3_124_2","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859079"},{"key":"e_1_3_3_125_2","first-page":"67","volume-title":"Proceedings of the Report on a Conference on High Speed Automatic Calculating Machines","author":"Turing A.","year":"1949","unstructured":"A. Turing. 1949. Checking a large routine. In Proceedings of the Report on a Conference on High Speed Automatic Calculating Machines. Cambridge Univ. Math. Lab., 67\u201369. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=94938.94952."},{"key":"e_1_3_3_126_2","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007526"},{"key":"e_1_3_3_127_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49956-7_1"},{"key":"e_1_3_3_128_2","unstructured":"T. Wahl. 2013. The k-Induction Principle. Retrieved 23 July 2022 from http:\/\/www.ccs.neu.edu\/home\/wahl\/Publications\/k-induction.pdf."},{"key":"e_1_3_3_129_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_31"},{"key":"e_1_3_3_130_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45614-7_25"},{"key":"e_1_3_3_131_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99527-0_36"},{"key":"e_1_3_3_132_2","doi-asserted-by":"publisher","DOI":"10.1145\/587051.587053"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477579","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:37Z","timestamp":1750183837000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,8]]},"references-count":131,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10,31]]}},"alternative-id":["10.1145\/3477579"],"URL":"https:\/\/doi.org\/10.1145\/3477579","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,8]]},"assertion":[{"value":"2019-08-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}