{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:03:06Z","timestamp":1743055386199,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030317836"},{"type":"electronic","value":"9783030317843"}],"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-31784-3_30","type":"book-chapter","created":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T21:32:04Z","timestamp":1571607124000},"page":"515-533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Model Checking Data Flows in Concurrent Network Updates"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Finkbeiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Gieseking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesko","family":"Hecking-Harbusch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst-R\u00fcdiger","family":"Olderog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","unstructured":"Ball, T., et al.: Vericon: towards verifying controller programs in software-defined networks. In: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014, Edinburgh, United Kingdom, 9\u201311 June 2014, pp. 282\u2013293 (2014). \nhttps:\/\/doi.org\/10.1145\/2594291.2594317","DOI":"10.1145\/2594291.2594317"},{"key":"30_CR2","unstructured":"Berkeley Logic Synthesis and Verification Group: ABC: a system for sequential synthesis and verification, Release YMMDD. Version 1.01, Release 81030. \nhttp:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-48683-6_8","volume-title":"Computer Aided Verification","author":"A Biere","year":"1999","unstructured":"Biere, A., Clarke, E., Raimi, R., Zhu, Y.: Verifying safety properties of a PowerPC$$-$$ microprocessor using symbolic model checking without BDDs. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 60\u201371. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48683-6_8"},{"key":"30_CR4","unstructured":"Biere, A., Heljanko, K., Wieringa, S.: AIGER 1.9 and beyond. Tech. Rep. 11\/2. Johannes Kepler University, Linz (2011)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2011","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70\u201387. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-18275-4_7"},{"key":"30_CR6","unstructured":"Canini, M., Venzano, D., Pere\u0161\u00edni, P., Kosti\u0107, D., Rexford, J.: A NICE way to test openflow applications. In: Proceedings of NSDI 2012, San Jose, CA, pp. 127\u2013140 (2012). \nhttp:\/\/dl.acm.org\/citation.cfm?id=2228298.2228312"},{"issue":"10","key":"30_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2661061.2661063","volume":"57","author":"Martin Casado","year":"2014","unstructured":"Casado, M., Foster, N., Guha, A.: Abstractions for software-defined networks. Commun. ACM 57(10), 86\u201395 (2014). \nhttps:\/\/doi.org\/10.1145\/2661061.2661063","journal-title":"Communications of the ACM"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-662-53426-7_9","volume-title":"Distributed Computing","author":"P \u010cern\u00fd","year":"2016","unstructured":"\u010cern\u00fd, P., Foster, N., Jagnik, N., McClurg, J.: Optimal consistent network updates in polynomial time. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 114\u2013128. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53426-7_9"},{"key":"30_CR9","unstructured":"Claessen, K., E\u00e9n, N., Sterin, B.: A circuit approach to LTL model checking. In: Proceedings of Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, 20\u201323 October 2013, pp. 53\u201360 (2013). \nhttp:\/\/ieeexplore.ieee.org\/document\/6679391\/"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-54792-8_15","volume-title":"Principles of Security and Trust","author":"MR Clarkson","year":"2014","unstructured":"Clarkson, M.R., Finkbeiner, B., Koleini, M., Micinski, K.K., Rabe, M.N., S\u00e1nchez, C.: Temporal logics for hyperproperties. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 265\u2013284. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54792-8_15"},{"key":"30_CR11","unstructured":"E\u00e9n, N., Mishchenko, A., Brayton, R.K.: Efficient implementation of property directed reachability. In: Proceedings of FMCAD, pp. 125\u2013134 (2011). \nhttp:\/\/dl.acm.org\/citation.cfm?id=2157675"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-63390-9_14","volume-title":"Computer Aided Verification","author":"A El-Hassany","year":"2017","unstructured":"El-Hassany, A., Tsankov, P., Vanbever, L., Vechev, M.: Network-wide configuration synthesis. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 261\u2013281. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63390-9_14"},{"issue":"6","key":"30_CR13","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Informatica 28(6), 575\u2013591 (1991). \nhttps:\/\/doi.org\/10.1007\/BF01463946","journal-title":"Acta Informatica"},{"key":"30_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77426-6","volume-title":"Unfoldings - A Partial-Order Approach to Model Checking","author":"J Esparza","year":"2008","unstructured":"Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Springer, Berlin (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77426-6"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-030-31784-3_30","volume-title":"Automated Technology for Verification and Analysis","author":"Bernd Finkbeiner","year":"2019","unstructured":"Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.: Model checking data flows in concurrent network updates (full version). arXiv preprint. \narXiv:1907.11061\n\n (2019)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-21690-4_25","volume-title":"Computer Aided Verification","author":"B Finkbeiner","year":"2015","unstructured":"Finkbeiner, B., Gieseking, M., Olderog, E.-R.: Adam: causality-based synthesis of distributed systems. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 433\u2013439. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21690-4_25"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.ic.2016.07.006","volume":"253","author":"B Finkbeiner","year":"2017","unstructured":"Finkbeiner, B., Olderog, E.: Petri games: synthesis of distributed systems with causal memory. Inf. Comput. 253, 181\u2013203 (2017). \nhttps:\/\/doi.org\/10.1016\/j.ic.2016.07.006","journal-title":"Inf. Comput."},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-21690-4_3","volume-title":"Computer Aided Verification","author":"B Finkbeiner","year":"2015","unstructured":"Finkbeiner, B., Rabe, M.N., S\u00e1nchez, C.: Algorithms for model checking HyperLTL and HyperCTL$$^*$$. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 30\u201348. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21690-4_3"},{"key":"30_CR19","doi-asserted-by":"publisher","unstructured":"F\u00f6rster, K., Mahajan, R., Wattenhofer, R.: Consistent updates in software defined networks: on dependencies, loop freedom, and blackholes. In: Proceedings of IFIP Networking Conference, Networking 2016 and Workshops, Vienna, Austria, 17\u201319 May 2016, pp. 1\u20139 (2016). \nhttps:\/\/doi.org\/10.1109\/IFIPNetworking.2016.7497232","DOI":"10.1109\/IFIPNetworking.2016.7497232"},{"key":"30_CR20","doi-asserted-by":"publisher","unstructured":"Foster, N., et al.: Frenetic: a network programming language. In: Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, ICFP 2011, Tokyo, Japan, 19\u201321 September 2011, pp. 279\u2013291 (2011). \nhttps:\/\/doi.org\/10.1145\/2034773.2034812","DOI":"10.1145\/2034773.2034812"},{"key":"30_CR21","doi-asserted-by":"publisher","unstructured":"Gieseking, M., Hecking-Harbusch, J.: AdamMC - a model checker for Petri nets with transits and flow-LTL (2019). \nhttps:\/\/doi.org\/10.6084\/m9.figshare.8313344","DOI":"10.6084\/m9.figshare.8313344"},{"key":"30_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03241-1","volume-title":"Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use","author":"K Jensen","year":"1992","unstructured":"Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, vol. 1. Springer, Berlin (1992). \nhttps:\/\/doi.org\/10.1007\/978-3-662-03241-1"},{"key":"30_CR23","doi-asserted-by":"publisher","unstructured":"Jin, X., et al.: Dynamic scheduling of network updates. In: Proceedings of SIGCOMM 2014, Chicago, Illinois, USA, pp. 539\u2013550 (2014). \nhttps:\/\/doi.org\/10.1145\/2619239.2626307","DOI":"10.1145\/2619239.2626307"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/978-3-662-46681-0_61","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Kant","year":"2015","unstructured":"Kant, G., Laarman, A., Meijer, J., van de Pol, J., Blom, S., van Dijk, T.: LTSmin: high-performance language-independent model checking. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 692\u2013707. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46681-0_61"},{"key":"30_CR25","doi-asserted-by":"publisher","unstructured":"Katta, N.P., Rexford, J., Walker, D.: Incremental consistent updates. In: Proceedings of HotSDN 2013, Hong Kong, China, pp. 49\u201354. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2491185.2491191","DOI":"10.1145\/2491185.2491191"},{"issue":"9","key":"30_CR26","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/JSAC.2011.111002","volume":"29","author":"S Knight","year":"2011","unstructured":"Knight, S., Nguyen, H.X., Falkner, N., Bowden, R.A., Roughan, M.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29(9), 1765\u20131775 (2011). \nhttps:\/\/doi.org\/10.1109\/JSAC.2011.111002","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"30_CR27","unstructured":"Kordon, F., et al.: Complete Results for the 2019 Edition of the Model Checking Contest (2019)"},{"issue":"1","key":"30_CR28","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/JPROC.2014.2371999","volume":"103","author":"Diego Kreutz","year":"2015","unstructured":"Kreutz, D., Ramos, F.M.V., Ver\u00edssimo, P.J.E., Rothenberg, C.E., Azodolmolky, S., Uhlig, S.: Software-defined networking: a comprehensive survey. Proceedings of the IEEE, vol. 103, no. 1, pp. 14\u201376 (2015). \nhttps:\/\/doi.org\/10.1109\/JPROC.2014.2371999","journal-title":"Proceedings of the IEEE"},{"key":"30_CR29","doi-asserted-by":"publisher","unstructured":"Liu, H.H., Wu, X., Zhang, M., Yuan, L., Wattenhofer, R., Maltz, D.A.: zUpdate: updating data center networks with zero loss. In: Proceedings of ACM SIGCOMM 2013 Conference, SIGCOMM 2013, Hong Kong, China, 12\u201316 August 2013, pp. 411\u2013422 (2013). \nhttps:\/\/doi.org\/10.1145\/2486001.2486005","DOI":"10.1145\/2486001.2486005"},{"issue":"4","key":"30_CR30","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/2043164.2018470","volume":"41","author":"H Mai","year":"2011","unstructured":"Mai, H., Khurshid, A., Agarwal, R., Caesar, M., Godfrey, P.B., King, S.T.: Debugging the data plane with anteater. SIGCOMM Comput. Commun. Rev. 41(4), 290\u2013301 (2011). \nhttps:\/\/doi.org\/10.1145\/2043164.2018470","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"30_CR31","doi-asserted-by":"publisher","unstructured":"Majumdar, R., Tetali, S.D., Wang, Z.: Kuai: a model checker for software-defined networks. In: Proceedings of FMCAD, pp. 163\u2013170 (2014). \nhttps:\/\/doi.org\/10.1109\/FMCAD.2014.6987609","DOI":"10.1109\/FMCAD.2014.6987609"},{"key":"30_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-63390-9_16","volume-title":"Computer Aided Verification","author":"J McClurg","year":"2017","unstructured":"McClurg, J., Hojjat, H., \u010cern\u00fd, P.: Synchronization synthesis for network programs. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 301\u2013321. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63390-9_16"},{"issue":"2","key":"30_CR33","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1355734.1355746","volume":"38","author":"N McKeown","year":"2008","unstructured":"McKeown, N., et al.: Openflow: enabling innovation in campus networks. Comput. Commun. Rev. 38(2), 69\u201374 (2008). \nhttps:\/\/doi.org\/10.1145\/1355734.1355746","journal-title":"Comput. Commun. Rev."},{"key":"30_CR34","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-44898-5_18","volume-title":"Static Analysis","author":"Ken L. McMillan","year":"2003","unstructured":"McMillan, K.L.: Craig interpolation and reachability analysis. In: Proceredings of Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, 11\u201313 June 2003, p. 336 (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-44898-5_18"},{"key":"30_CR35","unstructured":"Monsanto, C., Reich, J., Foster, N., Rexford, J., Walker, D.: Composing software defined networks. In: Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2013, Lombard, IL, USA, 2\u20135 April 2013, pp. 1\u201313 (2013). \nhttps:\/\/www.usenix.org\/conference\/nsdi13\/technical-sessions\/presentation\/monsanto"},{"key":"30_CR36","doi-asserted-by":"publisher","unstructured":"Padon, O., Immerman, N., Karbyshev, A., Lahav, O., Sagiv, M., Shoham, S.: Decentralizing SDN policies. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, 5\u201317 January 2015, pp. 663\u2013676 (2015). \nhttps:\/\/doi.org\/10.1145\/2676726.2676990","DOI":"10.1145\/2676726.2676990"},{"key":"30_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. Springer, Berlin (1985). \nhttps:\/\/doi.org\/10.1007\/978-3-642-69968-9"},{"key":"30_CR38","doi-asserted-by":"publisher","unstructured":"Reitblatt, M., Canini, M., Guha, A., Foster, N.: Fattire: declarative fault tolerance for software-defined networks. In: Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013, The Chinese University of Hong Kong, Hong Kong, China, 16 August 2013, pp. 109\u2013114 (2013). \nhttps:\/\/doi.org\/10.1145\/2491185.2491187","DOI":"10.1145\/2491185.2491187"},{"key":"30_CR39","doi-asserted-by":"publisher","unstructured":"Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., Walker, D.: Abstractions for network update. In: Proceedings of ACM SIGCOMM 2012 Conference, SIGCOMM 2012, Helsinki, Finland, 13\u201317 August 2012, pp. 323\u2013334 (2012). \nhttps:\/\/doi.org\/10.1145\/2342356.2342427","DOI":"10.1145\/2342356.2342427"},{"key":"30_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-44988-4_27","volume-title":"Application and Theory of Petri Nets 2000","author":"K Schmidt","year":"2000","unstructured":"Schmidt, K.: LoLA a low level analyser. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 465\u2013474. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-44988-4_27"},{"key":"30_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-662-46681-0_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Thierry-Mieg","year":"2015","unstructured":"Thierry-Mieg, Y.: Symbolic model-checking using ITS-tools. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 231\u2013237. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46681-0_20"},{"key":"30_CR42","doi-asserted-by":"publisher","unstructured":"Tsankov, P., Dashti, M.T., Basin, D.: Access control synthesis for physical spaces. In: Proceedings of IEEE 29th Computer Security Foundations Symposium, CSF 2016, pp. 443\u2013457 (2016). \nhttps:\/\/doi.org\/10.1109\/CSF.2016.38","DOI":"10.1109\/CSF.2016.38"},{"key":"30_CR43","doi-asserted-by":"publisher","unstructured":"Wang, A., Moarref, S., Loo, B.T., Topcu, U., Scedrov, A.: Automated synthesis of reactive controllers for software-defined networks. In: Proceedings of 21st IEEE International Conference on Network Protocols, ICNP 2013, G\u00f6ttingen, Germany, 7\u201310 October 2013, pp. 1\u20136 (2013). \nhttps:\/\/doi.org\/10.1109\/ICNP.2013.6733666","DOI":"10.1109\/ICNP.2013.6733666"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31784-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T13:31:29Z","timestamp":1573738289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31784-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030317836","9783030317843"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31784-3_30","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":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 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":"atva2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atva2019.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"33% - 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.4","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":"Between 1 and 2","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)"}}]}}