{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:04Z","timestamp":1750306084841,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["131\/9"],"award-info":[{"award-number":["131\/9"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003150","name":"Fonds Qu\u00e9b\u00e9cois de la Recherche sur la Nature et les Technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003150","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087816","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"423-430","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Towards Efficient Verification of Population Protocols"],"prefix":"10.1145","author":[{"given":"Michael","family":"Blondin","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Jaax","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp J.","family":"Meyer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011810"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146425"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0040-2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40229-1_35"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16023-3_19"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.36"},{"volume-title":"TACAS (Lecture Notes in Computer Science)","author":"de Moura Leonardo Mendon\u00e7a","key":"e_1_3_2_1_9_1","unstructured":"Leonardo Mendon\u00e7a de Moura and Nikolaj Bj\u00f8rner . 2008. Z3: An Efficient SMT Solver . In TACAS (Lecture Notes in Computer Science) , Vol. 4963 . Springer , 337--340. Z3 is available at https:\/\/github.com\/Z3Prover\/z3. Leonardo Mendon\u00e7a de Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In TACAS (Lecture Notes in Computer Science), Vol. 4963. Springer, 337--340. Z3 is available at https:\/\/github.com\/Z3Prover\/z3."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2009.9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526558"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050180"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. 26th International Conference on Concurrency Theory (CONCUR). 470--482","author":"Esparza Javier","year":"2015","unstructured":"Javier Esparza , Pierre Ganty , J\u00e9r\u00f4me Leroux , and Rupak Majumdar . 2015 . Verification of Population Protocols . In Proc. 26th International Conference on Concurrency Theory (CONCUR). 470--482 . Javier Esparza, Pierre Ganty, J\u00e9r\u00f4me Leroux, and Rupak Majumdar. 2015. Verification of Population Protocols. In Proc. 26th International Conference on Concurrency Theory (CONCUR). 470--482."},{"key":"e_1_3_2_1_14_1","first-page":"1","article-title":"Model Checking Population Protocols","volume":"65","author":"Esparza Javier","year":"2016","unstructured":"Javier Esparza , Pierre Ganty , J\u00e9r\u00f4me Leroux , and Rupak Majumdar . 2016 . Model Checking Population Protocols . In FSTTCS (LIPIcs) , Vol. 65. 27: 1 -- 27 :14. Javier Esparza, Pierre Ganty, J\u00e9r\u00f4me Leroux, and Rupak Majumdar. 2016. Model Checking Population Protocols. In FSTTCS (LIPIcs), Vol. 65. 27:1--27:14.","journal-title":"FSTTCS (LIPIcs)"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_40"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008743212620"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.003"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33536-5_8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2678280"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2008.8"},{"volume-title":"Computational complexity","author":"Papadimitriou Christos H.","key":"e_1_3_2_1_21_1","unstructured":"Christos H. Papadimitriou . 2007. Computational complexity . Academic Internet Publ . Christos H. Papadimitriou. 2007. Computational complexity. Academic Internet Publ."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2893582.2893585"},{"volume-title":"Theory of Linear and Integer Programming","author":"Schrijver Alexander","key":"e_1_3_2_1_23_1","unstructured":"Alexander Schrijver . 1986. Theory of Linear and Integer Programming . John Wiley & Sons . Alexander Schrijver. 1986. Theory of Linear and Integer Programming. John Wiley & Sons."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_59"}],"event":{"name":"PODC '17: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Washington DC USA","acronym":"PODC '17"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087816","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087816"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":24,"alternative-id":["10.1145\/3087801.3087816","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087816","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}