{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:12:07Z","timestamp":1762459927063,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030635947"},{"type":"electronic","value":"9783030635954"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-63595-4_10","type":"book-chapter","created":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T19:05:30Z","timestamp":1607627130000},"page":"176-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Verification of the IBOS Browser Security Properties in Reachability Logic"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Skeirik","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[]},{"given":"Camilo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,11]]},"reference":[{"key":"10_CR1","unstructured":"JavaScript Guide (1.2). Netscape Communications Corporation (1997). Originally http:\/\/developer.netscape.com\/docs\/manuals\/communicator\/jsguide4\/index.htm. https:\/\/www.cs.rit.edu\/~atk\/JavaScript\/manuals\/jsguide\/"},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/1516046.1516066","volume":"52","author":"A Barth","year":"2009","unstructured":"Barth, A., Jackson, C., Mitchell, J.C.: Securing frame communication in browsers. Commun. ACM 52(6), 83\u201391 (2009)","journal-title":"Commun. ACM"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, L., Cai, S., Jia, L., Passaro, T., Stroucken, M., Tian, Y.: Run-time monitoring and formal analysis of information flows in chromium. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23295"},{"key":"10_CR4","unstructured":"Bohannon, A.: Foundations of web script security. Citeseer (2012)"},{"key":"10_CR5","unstructured":"Bohannon, A., Pierce, B.C.: Featherweight Firefox: formalizing the core of a web browser. In: Proceedings of the 2010 USENIX Conference on Web Application Development, p. 11. Usenix Association (2010)"},{"issue":"1\u20133","key":"10_CR6","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.tcs.2006.04.012","volume":"360","author":"R Bruni","year":"2006","unstructured":"Bruni, R., Meseguer, J.: Semantic foundations for generalized rewrite theories. Theoret. Comput. Sci. 360(1\u20133), 386\u2013414 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jlamp.2016.08.006","volume":"87","author":"M Bugliesi","year":"2017","unstructured":"Bugliesi, M., Calzavara, S., Focardi, R.: Formal methods for web security. J. Log. Algebr. Methods Program. 87, 110\u2013126 (2017)","journal-title":"J. Log. Algebr. Methods Program."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Chen, S., Meseguer, J., Sasse, R., Wang, H.J., Wang, Y.M.: A systematic approach to uncover security flaws in GUI logic. In: IEEE Symposium on Security and Privacy, pp. 71\u201385. IEEE (2007)","DOI":"10.1109\/SP.2007.6"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Chen, S., Ross, D., Wang, Y.M.: An analysis of browser domain-isolation bugs and a light-weight transparent defense mechanism. In: ACM Conference on Computer and Communications Security, pp. 2\u201311. ACM (2007)","DOI":"10.1145\/1315245.1315248"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-94205-6_20","volume-title":"Automated Reasoning","author":"\u015e Ciob\u00e2c\u0103","year":"2018","unstructured":"Ciob\u00e2c\u0103, \u015e., Lucanu, D.: A coinductive approach to proving reachability properties in logically constrained term rewriting systems. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 295\u2013311. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_20"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71999-1","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M Clavel","year":"2007","unstructured":"Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71999-1"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243\u2013320. North-Holland (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"7\u20138","key":"10_CR13","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.jlap.2011.12.004","volume":"81","author":"F Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Meseguer, J.: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. J. Logic Algebraic Program. 81(7\u20138), 816\u2013850 (2012)","journal-title":"J. Logic Algebraic Program."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.jlap.2012.01.002","volume":"81","author":"S Escobar","year":"2012","unstructured":"Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. J. Logic Algebraic Program. 81, 898\u2013928 (2012)","journal-title":"J. Logic Algebraic Program."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J Goguen","year":"1992","unstructured":"Goguen, J., Meseguer, J.: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoret. Comput. Sci. 105, 217\u2013273 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-22137-8_11","volume-title":"Security Protocols XVI","author":"D Gollmann","year":"2011","unstructured":"Gollmann, D.: Problems with same origin policy. In: Christianson, B., Malcolm, J.A., Matyas, V., Roe, M. (eds.) Security Protocols 2008. LNCS, vol. 6615, pp. 84\u201385. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22137-8_11"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Hendrix, J., Meseguer, J., Ohsaki, H.: A sufficient completeness checker for linear order-sorted specifications modulo axioms. In: Third International Joint Conference on Automated Reasoning, IJCAR 2006, pp. 151\u2013155 (2006)","DOI":"10.1007\/11814771_14"},{"key":"10_CR18","unstructured":"Hendrix, J.D.: Decision procedures for equationally based reasoning. Ph.D. thesis, University of Illinois at Urbana-Champaign (2008). http:\/\/hdl.handle.net\/2142\/10967"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Huang, L.S., Weinberg, Z., Evans, C., Jackson, C.: Protecting browsers from cross-origin CSS attacks. In: CCS 2010, pp. 619\u2013629. ACM, New York (2010)","DOI":"10.1145\/1866307.1866376"},{"key":"10_CR20","unstructured":"Jackson, C., Barth, A.: Beware of finer-grained origins. Web (2008)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Jackson, C., Bortz, A., Boneh, D., Mitchell, J.C.: Protecting browser state from web privacy attacks. In: Proceedings of the 15th International Conference on World Wide Web, pp. 737\u2013744. ACM (2006)","DOI":"10.1145\/1135777.1135884"},{"key":"10_CR22","unstructured":"Jang, D., Tatlock, Z., Lerner, S.: Establishing browser security guarantees through formal shim verification. In: Presented as part of the 21st $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 2012), pp. 113\u2013128 (2012)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Karlof, C., Shankar, U., Tygar, J.D., Wagner, D.: Dynamic pharming attacks and locked same-origin policies for web browsers. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 58\u201371. ACM (2007)","DOI":"10.1145\/1315245.1315254"},{"key":"10_CR24","first-page":"16","volume":"4","author":"G Klein","year":"2004","unstructured":"Klein, G., Tuch, H.: Towards verified virtual memory in L4. TPHOLs Emerg. Trends 4, 16 (2004)","journal-title":"TPHOLs Emerg. Trends"},{"key":"10_CR25","unstructured":"Kolanski, R., Klein, G.: Formalising the L4 microkernel API. In: Proceedings of the 12th Computing: The Australasian Theory Symposium, vol. 51, pp. 53\u201368. Australian Computer Society, Inc. (2006)"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.jsc.2016.07.012","volume":"80","author":"D Lucanu","year":"2017","unstructured":"Lucanu, D., Rusu, V., Arusoaie, A.: A generic framework for symbolic execution: a coinductive approach. J. Symb. Comput. 80, 125\u2013163 (2017)","journal-title":"J. Symb. Comput."},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-23165-5_21","volume-title":"Logic, Rewriting, and Concurrency","author":"D Lucanu","year":"2015","unstructured":"Lucanu, D., Rusu, V., Arusoaie, A., Nowak, D.: Verifying reachability-logic properties on rewriting-logic specifications. In: Mart\u00ed-Oliet, N., \u00d6lveczky, P.C., Talcott, C. (eds.) Logic, Rewriting, and Concurrency. LNCS, vol. 9200, pp. 451\u2013474. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23165-5_21"},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jlamp.2015.06.001","volume":"85","author":"S Lucas","year":"2016","unstructured":"Lucas, S., Meseguer, J.: Normal forms and normal theories in conditional rewriting. J. Log. Algebr. Methods Program. 85(1), 67\u201397 (2016)","journal-title":"J. Log. Algebr. Methods Program."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: A logical theory of concurrent objects and its realization in the Maude language. In: Agha, G., Wegner, P., Yonezawa, A. (eds.) Research Directions in Concurrent Object-Oriented Programming, pp. 314\u2013390. MIT Press (1993)","DOI":"10.7551\/mitpress\/2087.003.0017"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Presicce, F.P. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18\u201361. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-64299-4_26"},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.jlap.2012.06.003","volume":"81","author":"J Meseguer","year":"2012","unstructured":"Meseguer, J.: Twenty years of rewriting logic. J. Algebr. Log. Program. 81, 721\u2013781 (2012)","journal-title":"J. Algebr. Log. Program."},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-662-49630-5_29","volume-title":"Foundations of Software Science and Computation Structures","author":"J Meseguer","year":"2016","unstructured":"Meseguer, J.: Order-sorted rewriting and congruence closure. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 493\u2013509. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49630-5_29"},{"key":"10_CR33","unstructured":"Meseguer, J.: Generalized rewrite theories, coherence completion and symbolic methods. Technical report, Computer Science Department, University of Illinois, December 2018. http:\/\/hdl.handle.net\/2142\/102183"},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2017.09.001","volume":"154","author":"J Meseguer","year":"2018","unstructured":"Meseguer, J.: Variant-based satisfiability in initial algebras. Sci. Comput. Program. 154, 3\u201341 (2018)","journal-title":"Sci. Comput. Program."},{"key":"10_CR35","unstructured":"Moore, B.: Coinductive program verification. Ph.D. thesis, University of Illinois at Urbana-Champaign (2016). http:\/\/hdl.handle.net\/2142\/95372"},{"key":"10_CR36","unstructured":"Rocha, C.: Symbolic reachability analysis for rewrite theories. Ph.D. thesis, University of Illinois at Urbana-Champaign (2012)"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Rosu, G., Stefanescu, A.: Checking reachability using matching logic. In: Proceedings of OOPSLA 2012, pp. 555\u2013574. ACM (2012)","DOI":"10.1145\/2398857.2384656"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-32759-9_32","volume-title":"FM 2012: Formal Methods","author":"G Ro\u015fu","year":"2012","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A.: From Hoare logic to matching logic reachability. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 387\u2013402. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_32"},{"key":"10_CR39","unstructured":"Sasse, R.: Security models in rewriting logic for cryptographic protocols and browsers. Ph.D. thesis, University of Illinois at Urbana-Champaign (2012). http:\/\/hdl.handle.net\/2142\/34373"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-35861-6_14","volume-title":"Formal Aspects of Component Software","author":"R Sasse","year":"2013","unstructured":"Sasse, R., King, S.T., Meseguer, J., Tang, S.: IBOS: a correct-by-construction modular browser. In: P\u0103s\u0103reanu, C.S., Sala\u00fcn, G. (eds.) FACS 2012. LNCS, vol. 7684, pp. 224\u2013241. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35861-6_14"},{"key":"10_CR41","unstructured":"Schwenk, J., Niemietz, M., Mainka, C.: Same-origin policy: evaluation in modern browsers. In: 26th USENIX Security Symposium (USENIX Security 2017), Vancouver, BC, pp. 713\u2013727. USENIX Association (2017)"},{"key":"10_CR42","unstructured":"Skeirik, S.: Rewriting-based symbolic methods for distributed system analysis. Ph.D. thesis, University of Illinois at Urbana-Champaign (2019)"},{"key":"10_CR43","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.jlamp.2017.12.006","volume":"96","author":"S Skeirik","year":"2018","unstructured":"Skeirik, S., Meseguer, J.: Metalevel algorithms for variant satisfiability. J. Log. Algebr. Methods Program. 96, 81\u2013110 (2018)","journal-title":"J. Log. Algebr. Methods Program."},{"key":"10_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-94460-9_12","volume-title":"Logic-Based Program Synthesis and Transformation","author":"S Skeirik","year":"2018","unstructured":"Skeirik, S., Stefanescu, A., Meseguer, J.: A constructor-based reachability logic for rewrite theories. In: Fioravanti, F., Gallagher, J.P. (eds.) LOPSTR 2017. LNCS, vol. 10855, pp. 201\u2013217. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94460-9_12"},{"issue":"4","key":"10_CR45","doi-asserted-by":"publisher","first-page":"315","DOI":"10.3233\/FI-2020-1926","volume":"173","author":"S Skeirik","year":"2020","unstructured":"Skeirik, S., Stefanescu, A., Meseguer, J.: A constructor-based reachability logic for rewrite theories. Fundam. Inform. 173(4), 315\u2013382 (2020)","journal-title":"Fundam. Inform."},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Some, D.F., Bielova, N., Rezk, T.: On the content security policy violations due to the same-origin policy. In: WWW 2017, Republic and Canton of Geneva, Switzerland, pp. 877\u2013886 (2017)","DOI":"10.1145\/3038912.3052634"},{"key":"10_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-08918-8_29","volume-title":"Rewriting and Typed Lambda Calculi","author":"A \u015etef\u0103nescu","year":"2014","unstructured":"\u015etef\u0103nescu, A., Ciob\u00e2c\u0103, \u015e., Mereuta, R., Moore, B.M., \u015eerb\u0103nut\u0103, T.F., Ro\u015fu, G.: All-path reachability logic. In: Dowek, G. (ed.) RTA 2014. LNCS, vol. 8560, pp. 425\u2013440. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08918-8_29"},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Stefanescu, A., Park, D., Yuwen, S., Li, Y., Rosu, G.: Semantics-based program verifiers for all languages. In: Proceedings of OOPSLA 2016, pp. 74\u201391. ACM (2016)","DOI":"10.1145\/3022671.2984027"},{"key":"10_CR49","unstructured":"Tang, S.: Towards secure web browsing. Ph.D. thesis, University of Illinois at Urbana-Champaign, 25 May 2011. http:\/\/hdl.handle.net\/2142\/24307"},{"key":"10_CR50","unstructured":"Tang, S., Mai, H., King, S.T.: Trust and protection in the Illinois Browser Operating System. In: 9th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2010, Proceedings, Vancouver, BC, Canada, 4\u20136 October 2010, pp. 17\u201332. USENIX Association (2010)"},{"key":"10_CR51","doi-asserted-by":"crossref","unstructured":"Wang, R., Xing, L., Wang, X., Chen, S.: Unauthorized origin crossing on mobile platforms: threats and mitigation. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer Communications Security, CCS 2013, pp. 635\u2013646. ACM, New York (2013)","DOI":"10.1145\/2508859.2516727"}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63595-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,18]],"date-time":"2024-08-18T21:28:47Z","timestamp":1724016527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63595-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030635947","9783030635954"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63595-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WRLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Rewriting Logic and its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wrla2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wrla2020.webs.upv.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"16","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":"11","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":"69% - 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","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":"5","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)"}}]}}