{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:54:40Z","timestamp":1742925280848,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030890506"},{"type":"electronic","value":"9783030890513"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89051-3_16","type":"book-chapter","created":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T09:30:38Z","timestamp":1634031038000},"page":"285-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Proving LTL Properties of Bitvector Programs and Decompiled Binaries"],"prefix":"10.1007","author":[{"given":"Yuandong Cyrus","family":"Liu","sequence":"first","affiliation":[]},{"given":"Chengbin","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Dietsch","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Koskinen","sequence":"additional","affiliation":[]},{"given":"Ton-Chanh","family":"Le","sequence":"additional","affiliation":[]},{"given":"Georgios","family":"Portokalidis","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,12]]},"reference":[{"key":"16_CR1","unstructured":"AProVE. aprove.informatik.rwth-aachen.de\/eval\/Bitvectors\/"},{"key":"16_CR2","unstructured":"Hex-rays decompiler. www.hex-rays.com\/products\/decompiler\/"},{"key":"16_CR3","unstructured":"mcsema jump table bug. github.com\/lifting-bits\/mcsema\/issues\/558"},{"key":"16_CR4","unstructured":"mcsema bug, missing data cross reference due to resetting ida\u2019s analysis flag. github.com\/lifting-bits\/mcsema\/issues\/561"},{"key":"16_CR5","unstructured":"mcsema var. bug. github.com\/lifting-bits\/mcsema\/issues\/566"},{"key":"16_CR6","unstructured":"SV-COMP Termination Benchmarks. github.com\/sosy-lab\/sv-benchmarks\/tree\/master\/c\/termination-crafted"},{"key":"16_CR7","unstructured":"Ultimate\u2019s LTL benchmarks. github.com\/ultimate-pa\/ultimate\/tree\/dev\/trunk\/examples\/LTL\/"},{"key":"16_CR8","unstructured":"National Security Agency: Ghidra. www.nsa.gov\/resources\/everyone\/ghidra\/"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Altinay, A., et al.: BinRec: dynamic binary lifting and recompilation. In: EuroSys, pp. 36:1\u201336:16 (2020)","DOI":"10.1145\/3342195.3387550"},{"key":"16_CR10","unstructured":"Anderson, S.: Bit twiddling hacks. graphics.stanford.edu\/ seander\/bithacks.html"},{"issue":"POPL","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3290384","volume":"3","author":"A Armstrong","year":"2019","unstructured":"Armstrong, A., et al.: ISA semantics for ARMv8-a, RISC-v, and CHERI-MIPS. Proc. ACM Program. Lang. 3(POPL), 1\u201331 (2019)","journal-title":"Proc. ACM Program. Lang."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Formal Methods for Components and Objects","author":"M Barnett","year":"2006","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: a modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 364\u2013387. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11804192_17"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2017","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transfer 21(1), 1\u201329 (2017). https:\/\/doi.org\/10.1007\/s10009-017-0469-y","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2005.12.001","volume":"144","author":"M Bozzano","year":"2006","unstructured":"Bozzano, M., et al.: Encoding RTL constructs for MathSAT: a preliminary report. Electron. Notes Theor. Comput. Sci. 144(2), 3\u201314 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-22110-1_37","volume-title":"Computer Aided Verification","author":"D Brumley","year":"2011","unstructured":"Brumley, D., Jager, I., Avgerinos, T., Schwartz, E.J.: BAP: a binary analysis platform. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 463\u2013469. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_37"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-71209-1_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"RE Bryant","year":"2007","unstructured":"Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.: Deciding bit-vector arithmetic with abstraction. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 358\u2013372. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_28"},{"key":"16_CR17","unstructured":"Chalupa, M.: mchalupa\/dg, January 2021. github.com\/mchalupa\/dg"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Chen, H., David, C., Kroening, D., Schrammel, P., Wachter, B.: Synthesising interprocedural bit-precise termination proofs (T). In: ASE, pp. 53\u201364 (2015)","DOI":"10.1109\/ASE.2015.10"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3121136","volume":"40","author":"HY Chen","year":"2018","unstructured":"Chen, H.Y., David, C., Kroening, D., Schrammel, P., Wachter, B.: Bit-precise procedure-modular termination analysis. ACM Trans. Program. Lang. Syst. 40, 1\u201338 (2018)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Cook, B., Koskinen, E.: Making prophecies with decision predicates. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, pp. 399\u2013410 (2011)","DOI":"10.1145\/1925844.1926431"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-12002-2_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Cook","year":"2010","unstructured":"Cook, B., Kroening, D., R\u00fcmmer, P., Wintersteiger, C.M.: Ranking function synthesis for bit-vector relations. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 236\u2013250. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_19"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Dinesh, S., Venkatesh, D., Adve, V.S., Fletcher, C.W.: Scalable validation of binary lifters. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 655\u2013671, June 2020","DOI":"10.1145\/3385412.3385964"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Park, D., Kasampalis, T., Adve, V.S., Ro\u015fu, G.: A complete formal semantics of x86-64 user-level instruction set architecture, p. 16 (2019)","DOI":"10.1145\/3314221.3314601"},{"key":"16_CR24","unstructured":"Derevenets, Y.: Snowman. derevenets.com\/"},{"key":"16_CR25","unstructured":"Dinaburg, A., Ruef, A.: McSema: static translation of x86 instructions to LLVM. In: ReCon 2014 Conference, Montreal, Canada (2014)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-27705-4_21","volume-title":"Verified Software: Theories, Tools, Experiments","author":"S Falke","year":"2012","unstructured":"Falke, S., Kapur, D., Sinz, C.: Termination analysis of imperative programs using bitvector arithmetic. In: Joshi, R., M\u00fcller, P., Podelski, A. (eds.) VSTTE 2012. LNCS, vol. 7152, pp. 261\u2013277. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27705-4_21"},{"key":"16_CR27","unstructured":"Galois, I.: Macaw. github.com\/GaloisInc\/macaw"},{"key":"16_CR28","unstructured":"Galois, I.: Reopt vcg. github.com\/GaloisInc\/reopt-vcg"},{"issue":"1","key":"16_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9388-y","volume":"58","author":"J Giesl","year":"2016","unstructured":"Giesl, J., et al.: Analyzing program termination and complexity automatically with AProVE. J. Autom. Reason. 58(1), 3\u201331 (2016). https:\/\/doi.org\/10.1007\/s10817-016-9388-y","journal-title":"J. Autom. Reason."},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-319-71237-6_26","volume-title":"Programming Languages and Systems","author":"S He","year":"2017","unstructured":"He, S., Rakamari\u0107, Z.: Counterexample-guided bit-precision selection. In: Chang, B.-Y.E. (ed.) APLAS 2017. LNCS, vol. 10695, pp. 534\u2013553. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71237-6_26"},{"key":"16_CR31","unstructured":"Heizmann, M., et al.: Ultimate program analysis framework, p. 1"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/978-3-319-08867-9_53","volume-title":"Computer Aided Verification","author":"M Heizmann","year":"2014","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Termination analysis by learning terminating programs. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 797\u2013813. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_53"},{"key":"16_CR33","unstructured":"Hendrix, J., Wei, G., Winwood, S.: Towards verified binary raising, p. 4"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-319-41591-8_16","volume-title":"Software Engineering and Formal Methods","author":"J Hensel","year":"2016","unstructured":"Hensel, J., Giesl, J., Frohn, F., Str\u00f6der, T.: Proving termination of programs with bitvector arithmetic by symbolic execution. In: De Nicola, R., K\u00fchn, E. (eds.) SEFM 2016. LNCS, vol. 9763, pp. 234\u2013252. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41591-8_16"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/3-540-45657-0_45","volume-title":"Computer Aided Verification","author":"TA Henzinger","year":"2002","unstructured":"Henzinger, T.A., Necula, G.C., Jhala, R., Sutre, G., Majumdar, R., Weimer, W.: Temporal-safety proofs for systems code. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 526\u2013538. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_45"},{"key":"16_CR36","unstructured":"Kinder, J.: Jakstab. http:\/\/www.jakstab.org\/"},{"key":"16_CR37","unstructured":"Kinder, J., Veith, H.: Precise static analysis of untrusted driver binaries. In: Formal Methods in Computer Aided Design, pp. 43\u201350. IEEE (2010)"},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11691372_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Kroening","year":"2006","unstructured":"Kroening, D., Sharygina, N.: Approximating predicate images for bit-vector logic. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 242\u2013256. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_16"},{"key":"16_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-319-89963-3_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Leike","year":"2018","unstructured":"Leike, J., Heizmann, M.: Geometric nontermination arguments. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 266\u2013283. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_16"},{"key":"16_CR40","unstructured":"Liu, Y.C., et al.: Proving LTL properties of bitvector programs and decompiled binaries (extended). CoRR abs\/2105.05159 (2021). https:\/\/arxiv.org\/abs\/2105.05159"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Mattsen, S., Wichmann, A., Schupp, S.: A non-convex abstract domain for the value analysis of binaries. In: SANER, pp. 271\u2013280 (2015)","DOI":"10.1109\/SANER.2015.7081837"},{"key":"16_CR42","doi-asserted-by":"crossref","unstructured":"Metere, R., Lindner, A., Guanciale, R.: Sound transpilation from binary to machine-independent code, vol. 10623, pp. 197\u2013214. arXiv:1807.10664 [cs] (2017)","DOI":"10.1007\/978-3-319-70848-5_13"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-540-71209-1_44","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MO Myreen","year":"2007","unstructured":"Myreen, M.O., Gordon, M.J.C.: Hoare logic for realistically modelled machine code. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 568\u2013582. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_44"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Myreen, M.O., Gordon, M.J.C., Slind, K.: Machine-code verification for multiple architectures - an application of decompilation into logic. In: Formal Methods in Computer-Aided Design, FMCAD 2008, pp. 1\u20138 (2008)","DOI":"10.1109\/FMCAD.2008.ECP.24"},{"key":"16_CR45","unstructured":"Myreen, M.O., Gordon, M.J.C., Slind, K.: Decompilation into logic - improved. In: Formal Methods in Computer-Aided Design, FMCAD 2012, Cambridge, UK, 22\u201325 October 2012, pp. 78\u201381 (2012)"},{"key":"16_CR46","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-030-29436-6_22","volume-title":"Automated Deduction \u2013 CADE 27","author":"A Niemetz","year":"2019","unstructured":"Niemetz, A., Preiner, M., Reynolds, A., Zohar, Y., Barrett, C., Tinelli, C.: Towards bit-width-independent proofs in SMT solvers. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 366\u2013384. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29436-6_22"},{"key":"16_CR47","doi-asserted-by":"crossref","unstructured":"Roessle, I., Verbeek, F., Ravindran, B.: Formally verified big step semantics out of x86-64 binaries. In: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs (2019)","DOI":"10.1145\/3293880.3294102"},{"key":"16_CR48","unstructured":"IDA Support: Hex Rays: IDA pro. www.hex-rays.com\/products\/ida\/"},{"key":"16_CR49","doi-asserted-by":"crossref","unstructured":"Shoshitaishvili, Y., et al.: SOK: (state of) the art of war: offensive techniques in binary analysis. In: 2016 IEEE Symposium on S&P (2016)","DOI":"10.1109\/SP.2016.17"},{"key":"16_CR50","unstructured":"SoSy-Lab: cpachecker. cpachecker.sosy-lab.org\/"},{"key":"16_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-58768-0_14","volume-title":"Software Engineering and Formal Methods","author":"F Verbeek","year":"2020","unstructured":"Verbeek, F., Olivier, P., Ravindran, B.: Sound C code decompilation for a subset of x86-64 binaries. In: de Boer, F., Cerone, A. (eds.) SEFM 2020. LNCS, vol. 12310, pp. 247\u2013264. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58768-0_14"},{"key":"16_CR52","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10703-012-0156-2","volume":"42","author":"CM Wintersteiger","year":"2013","unstructured":"Wintersteiger, C.M., Hamadi, Y., de Moura, L.: Efficiently solving quantified bit-vector formulas. Formal Methods Syst. Des. 42, 3\u201323 (2013). https:\/\/doi.org\/10.1007\/s10703-012-0156-2","journal-title":"Formal Methods Syst. Des."},{"key":"16_CR53","doi-asserted-by":"crossref","unstructured":"Zohar, Y., et al.: Bit-Precise Reasoning via Int-Blasting (2021)","DOI":"10.1007\/978-3-030-94583-1_24"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89051-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T21:05:23Z","timestamp":1673471123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89051-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030890506","9783030890513"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89051-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","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":"17","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":"40% - 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)"}}]}}