{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:04Z","timestamp":1750306324875,"version":"3.41.0"},"reference-count":66,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T00:00:00Z","timestamp":1465171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005231","name":"CAS\/SAFEA International Partnership Program for Creative Research Teams","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005231","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology of Taiwan","doi-asserted-by":"crossref","award":["103-2221-E-001 -020 -MY3"],"award-info":[{"award-number":["103-2221-E-001 -020 -MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSF of China","doi-asserted-by":"crossref","award":["61272001, 91218302, 61472473, 61532019, GZ1023"],"award-info":[{"award-number":["61272001, 91218302, 61472473, 61532019, GZ1023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Chinese National 973 Plan","award":["2010CB328003"],"award-info":[{"award-number":["2010CB328003"]}]},{"name":"Tsinghua University Initiative Scientific Research Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2016,8,22]]},"abstract":"<jats:p>Probabilistic models are widely deployed in various systems. To ensure their correctness, verification techniques have been developed to analyze probabilistic systems. We propose the first sound and complete learning-based compositional verification technique for probabilistic safety properties on concurrent systems where each component is an Markov decision process. Different from previous works, weighted assumptions are introduced to attain completeness of our framework. Since weighted assumptions can be implicitly represented by multiterminal binary decision diagrams (MTBDDs), we give an &gt;i&lt;L&gt;\/i&lt;*-based learning algorithm for MTBDDs to infer weighted assumptions. Experimental results suggest promising outlooks for our compositional technique.<\/jats:p>","DOI":"10.1145\/2907943","type":"journal-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:00:33Z","timestamp":1465563633000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning Weighted Assumptions for Compositional Verification of Markov Decision Processes"],"prefix":"10.1145","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4266-875X","authenticated-orcid":false,"given":"Fei","family":"He","sequence":"first","affiliation":[{"name":"KLiss, MoE; TNList; School of Software, Tsinghua University, Beijing, China"}]},{"given":"Xiaowei","family":"Gao","sequence":"additional","affiliation":[{"name":"KLiss, MoE; TNList; School of Software, Tsinghua University, Beijing, China"}]},{"given":"Miaofei","family":"Wang","sequence":"additional","affiliation":[{"name":"KLiss, MoE; TNList; School of Software, Tsinghua University, Beijing, China"}]},{"given":"Bow-Yaw","family":"Wang","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taiwan"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2016,6,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11603009_15"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90021-6"},{"key":"e_1_2_1_4_1","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"Baier Christel","unstructured":"Christel Baier , Edmund M. Clarke , Vasiliki Hartonas-Garmhausen , Marta Kwiatkowska , and Mark Ryan . 1997. Symbolic model checking for probabilistic processes . In Automata, Languages and Programming . Lecture Notes in Computer Science , Vol. 1256 . Springer , 430--440. Christel Baier, Edmund M. Clarke, Vasiliki Hartonas-Garmhausen, Marta Kwiatkowska, and Mark Ryan. 1997. Symbolic model checking for probabilistic processes. In Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 1256. Springer, 430--440."},{"volume-title":"Principles of Model Checking","author":"Baier Christel","key":"e_1_2_1_5_1","unstructured":"Christel Baier and Joost-Pieter Katoen . 2008. Principles of Model Checking . MIT Press , Cambridge, MA . Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00038-6"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875530"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/337244.337257"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979326091X"},{"key":"e_1_2_1_10_1","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"Bianco Andrea","unstructured":"Andrea Bianco and Luca de Alfaro . 1995. Model checking of probabilistic and nondeterministic systems . In Foundations of Software Technology and Theoretical Computer Science . Lecture Notes in Computer Science , Vol. 1026 . Springer , 499--513. Andrea Bianco and Luca de Alfaro. 1995. Model checking of probabilistic and nondeterministic systems. In Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, Vol. 1026. Springer, 499--513."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_32"},{"key":"e_1_2_1_12_1","volume-title":"Vardi","author":"Bustan Doron","year":"2004","unstructured":"Doron Bustan , Sasha Rubin , and Moshe Y . Vardi . 2004 . Verifying \u03c9-regular properties of Markov chains. In Computer Aided Verification. Lecture Notes in Computer Science, Vol. 3114 . Springer , 189--201. Doron Bustan, Sasha Rubin, and Moshe Y. Vardi. 2004. Verifying \u03c9-regular properties of Markov chains. In Computer Aided Verification. Lecture Notes in Computer Science, Vol. 3114. Springer, 189--201."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1838552.1838553"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 21st International Conference on Uncertainty in Artificial Intelligence. 104--111","author":"Chatterjee Krishnendu","year":"2005","unstructured":"Krishnendu Chatterjee , Thomas A. Henzinger , Ranjit Jhala , and Rupak Majumdar . 2005 . Counterexample-guided planning . In Proceedings of the 21st International Conference on Uncertainty in Artificial Intelligence. 104--111 . Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. 2005. Counterexample-guided planning. In Proceedings of the 21st International Conference on Uncertainty in Artificial Intelligence. 104--111."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28891-3_22"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_44"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_3"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647769.734089"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664590"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348250.1348253"},{"key":"e_1_2_1_21_1","volume-title":"P\u0103s\u0103reanu","author":"Cobleigh Jamieson M.","year":"2003","unstructured":"Jamieson M. Cobleigh , Dimitra Giannakopoulou , and Corina S . P\u0103s\u0103reanu . 2003 . Learning assumptions for compositional verification. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, Vol. 2619 . Springer , 331--346. Jamieson M. Cobleigh, Dimitra Giannakopoulou, and Corina S. P\u0103s\u0103reanu. 2003. Learning assumptions for compositional verification. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, Vol. 2619. Springer, 331--346."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210339"},{"key":"e_1_2_1_23_1","series-title":"Lecture Notes in Computer Science","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning.","author":"Couvreur Jean-Michel","unstructured":"Jean-Michel Couvreur , Nasser Saheb , and Gr\u00e9goire Sutre . 2003. An optimal automata approach to LTL model checking of probabilistic systems . In Logic for Programming, Artificial Intelligence, and Reasoning. , Lecture Notes in Computer Science , Vol. 2850 . Springer , 361--375. Jean-Michel Couvreur, Nasser Saheb, and Gr\u00e9goire Sutre. 2003. An optimal automata approach to LTL model checking of probabilistic systems. In Logic for Programming, Artificial Intelligence, and Reasoning., Lecture Notes in Computer Science, Vol. 2850. Springer, 361--375."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646484.691766"},{"volume-title":"Learning Theory","author":"Denis Fran\u00e7ois","key":"e_1_2_1_25_1","unstructured":"Fran\u00e7ois Denis and Yann Esposito . 2004. Learning classes of probabilistic automata . In Learning Theory . Springer , 124--139. Fran\u00e7ois Denis and Yann Esposito. 2004. Learning classes of probabilistic automata. In Learning Theory. Springer, 124--139."},{"key":"e_1_2_1_26_1","series-title":"Lecture Notes in Computer Science","volume-title":"Automated Technology for Verification and Analysis","author":"Feng Lu","unstructured":"Lu Feng , Tingting Han , Marta Kwiatkowska , and David Parker . 2011. Learning-based compositional verification for synchronous probabilistic systems . In Automated Technology for Verification and Analysis . Lecture Notes in Computer Science , Vol. 6996 . Springer-Verlag , 511--521. Lu Feng, Tingting Han, Marta Kwiatkowska, and David Parker. 2011. Learning-based compositional verification for synchronous probabilistic systems. In Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, Vol. 6996. Springer-Verlag, 511--521."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2010.24"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008647823331"},{"key":"e_1_2_1_29_1","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Learning Theory","author":"Gavald\u00e0 Ricard","unstructured":"Ricard Gavald\u00e0 and David Guijarro . 1995. Learning ordered binary decision diagrams . In Algorithmic Learning Theory . Lecture Notes in Computer Science , Vol. 997 . Springer , 228--238. Ricard Gavald\u00e0 and David Guijarro. 1995. Learning ordered binary decision diagrams. In Algorithmic Learning Theory. Lecture Notes in Computer Science, Vol. 997. Springer, 228--238."},{"key":"e_1_2_1_30_1","volume-title":"P\u0103s\u0103reanu","author":"Gheorghiu Mihaela","year":"2007","unstructured":"Mihaela Gheorghiu , Dimitra Giannakopoulou , and Corina S . P\u0103s\u0103reanu . 2007 . Refining interface alphabets for compositional verification. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, Vol. 4424 . Springer , 292--307. Mihaela Gheorghiu, Dimitra Giannakopoulou, and Corina S. P\u0103s\u0103reanu. 2007. Refining interface alphabets for compositional verification. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, Vol. 4424. Springer, 292--307."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_14"},{"key":"e_1_2_1_32_1","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"Gupta Anubhav","unstructured":"Anubhav Gupta , Kenneth L. McMillan , and Zhaohui Fu. 2007. Automated assumption generation for compositional verification . In Computer Aided Verification . Lecture Notes in Computer Science , Vol. 4590 . Springer , 420--432. Anubhav Gupta, Kenneth L. McMillan, and Zhaohui Fu. 2007. Automated assumption generation for compositional verification. In Computer Aided Verification. Lecture Notes in Computer Science, Vol. 4590. Springer, 420--432."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2009.5"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211866"},{"volume-title":"Time and Probability in Formal Design of Distributed Systems","author":"Hansson Hans A.","key":"e_1_2_1_35_1","unstructured":"Hans A. Hansson . 1994. Time and Probability in Formal Design of Distributed Systems . Elsevier Science , New York, NY . Hans A. Hansson. 1994. Time and Probability in Formal Design of Distributed Systems. Elsevier Science, New York, NY."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80001-8"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676998"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568253"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_16"},{"key":"e_1_2_1_40_1","unstructured":"IEEE. 2012. IEEE Standard for Information Technology--Telecommunications and Information Exchange Between sSystems Local and Metropolitan Area Networks--Specific Requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE Los Alamitos CA.  IEEE. 2012. IEEE Standard for Information Technology--Telecommunications and Information Exchange Between sSystems Local and Metropolitan Area Networks--Specific Requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE Los Alamitos CA."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2005.2"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603147"},{"volume-title":"Proceedings of the IEEE International Conference on Computer Design (ICCD\u201990)","author":"Kimura Shinji","key":"e_1_2_1_43_1","unstructured":"Shinji Kimura and Edmund M. Clarke . 1990. A parallel algorithm for constructing binary decision diagrams . In Proceedings of the IEEE International Conference on Computer Design (ICCD\u201990) . IEEE, Los Alamitos, CA, 220--223. Shinji Kimura and Edmund M. Clarke. 1990. A parallel algorithm for constructing binary decision diagrams. In Proceedings of the IEEE International Conference on Computer Design (ICCD\u201990). IEEE, Los Alamitos, CA, 220--223."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_25"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.54"},{"key":"e_1_2_1_46_1","series-title":"CRM Monograph Series","volume-title":"Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems","author":"Kwiatkowska Marta","unstructured":"Marta Kwiatkowska , Gethin Norman , and David Parker . 2004a. Modelling and verification of probabilistic systems . In Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems . CRM Monograph Series , Vol. 23 , American Mathematical Society , 93--215. Marta Kwiatkowska, Gethin Norman, and David Parker. 2004a. Modelling and verification of probabilistic systems. In Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. CRM Monograph Series, Vol. 23, American Mathematical Society, 93--215."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0140-2"},{"key":"e_1_2_1_48_1","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"Kwiatkowska Marta","unstructured":"Marta Kwiatkowska , Gethin Norman , and David Parker . 2011. PRISM 4.0 : Verification of probabilistic real-time systems . In Computer Aided Verification . Lecture Notes in Computer Science , Vol. 6806 . Springer , 585--591. Marta Kwiatkowska, Gethin Norman, and David Parker. 2011. PRISM 4.0: Verification of probabilistic real-time systems. In Computer Aided Verification. Lecture Notes in Computer Science, Vol. 6806. Springer, 585--591."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_3"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001650300007"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/567532.567547"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2011.21"},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Hua Mao Yingke Chen Manfred Jaeger Thomas D. Nielsen Kim G. Larsen and Brian Nielsen. 2012. Learning Markov decision processes for model checking. arXiv:1212.3873.  Hua Mao Yingke Chen Manfred Jaeger Thomas D. Nielsen Kim G. Larsen and Brian Nielsen. 2012. Learning Markov decision processes for model checking. arXiv:1212.3873.","DOI":"10.4204\/EPTCS.103.6"},{"volume-title":"Randomized Algorithms","author":"Motwani Rajeev","key":"e_1_2_1_54_1","unstructured":"Rajeev Motwani and Prabhakar Raghavan . 1995. Randomized Algorithms . Cambridge University Press . Rajeev Motwani and Prabhakar Raghavan. 1995. Randomized Algorithms. Cambridge University Press."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.05.003"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 1st Symposium in Logic in Computer Science (LICS\u201986)","author":"Pnueli Amir","year":"1986","unstructured":"Amir Pnueli and Lenore Zuck . 1986 . Probabilistic verification by tableaux . In Proceedings of the 1st Symposium in Logic in Computer Science (LICS\u201986) . IEEE, Los Alamitos, CA, 322--331. Amir Pnueli and Lenore Zuck. 1986. Probabilistic verification by tableaux. In Proceedings of the 1st Symposium in Logic in Computer Science (LICS\u201986). IEEE, Los Alamitos, CA, 322--331."},{"key":"e_1_2_1_58_1","volume-title":"CRM Monograph Series","volume":"23","author":"Rutten Jan","year":"2004","unstructured":"Jan Rutten , Marta Kwiatkowska , Gethin Norman , and David Parker . 2004 . Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, P. Panangaden and F. van Breugel (Eds.) . CRM Monograph Series , Vol. 23 . American Mathematical Society. Jan Rutten, Marta Kwiatkowska, Gethin Norman, and David Parker. 2004. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, P. Panangaden and F. van Breugel (Eds.). CRM Monograph Series, Vol. 23. American Mathematical Society."},{"key":"e_1_2_1_59_1","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR\u201994: Concurrency Theory","author":"Segala Roberto","unstructured":"Roberto Segala and Nancy Lynch . 1994. Probabilistic simulations for probabilistic processes . In CONCUR\u201994: Concurrency Theory . Lecture Notes in Computer Science , Vol. 836 . Springer , 481--496. Roberto Segala and Nancy Lynch. 1994. Probabilistic simulations for probabilistic processes. In CONCUR\u201994: Concurrency Theory. Lecture Notes in Computer Science, Vol. 836. Springer, 481--496."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025129.1026084"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.12"},{"volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"Vardi Moshe Y.","key":"e_1_2_1_62_1","unstructured":"Moshe Y. Vardi . 1999. Probabilistic linear-time model checking: An overview of the automata-theoretic approach . In Formal Methods for Real-Time and Probabilistic Systems . Springer , 265--276. Moshe Y. Vardi. 1999. Probabilistic linear-time model checking: An overview of the automata-theoretic approach. In Formal Methods for Real-Time and Probabilistic Systems. Springer, 265--276."},{"volume-title":"Proceedings of the 1st Symposium in Logic in Computer Science (LICS\u201986)","author":"Moshe","key":"e_1_2_1_63_1","unstructured":"Moshe Y. Vardi and Pierre Wolper. 1986. An automata-theoretic approach to automatic program verification . In Proceedings of the 1st Symposium in Logic in Computer Science (LICS\u201986) . IEEE, Los Alamitos, CA, 332--344. Moshe Y. Vardi and Pierre Wolper. 1986. An automata-theoretic approach to automatic program verification. In Proceedings of the 1st Symposium in Logic in Computer Science (LICS\u201986). IEEE, Los Alamitos, CA, 332--344."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1092"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_21"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40196-1_4"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2009.5351134"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2907943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2907943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:27Z","timestamp":1750222467000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2907943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,6]]},"references-count":66,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,8,22]]}},"alternative-id":["10.1145\/2907943"],"URL":"https:\/\/doi.org\/10.1145\/2907943","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"type":"print","value":"1049-331X"},{"type":"electronic","value":"1557-7392"}],"subject":[],"published":{"date-parts":[[2016,6,6]]},"assertion":[{"value":"2015-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}