{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:29:52Z","timestamp":1743085792907,"version":"3.40.3"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030763831"},{"type":"electronic","value":"9783030763848"}],"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-76384-8_11","type":"book-chapter","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T23:50:53Z","timestamp":1621381853000},"page":"160-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verification of Functional Correctness of Code Diversification Techniques"],"prefix":"10.1007","author":[{"given":"Jae-Won","family":"Jang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Freek","family":"Verbeek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binoy","family":"Ravindran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"11_CR1","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. Representation and Mind Series. The MIT Press, Cambridge (2008)"},{"key":"11_CR2","unstructured":"Bhatkar, S., DuVarney, D.C., Sekar, R.: Address obfuscation: an efficient approach to combat a board range of memory error exploits. In: Proceedings of the 12th Conference on USENIX Security Symposium - Volume 12, SSYM 2003, p. 8. USENIX Association, USA (2003)"},{"key":"11_CR3","unstructured":"Bhatkar, S., Sekar, R., DuVarney, D.C.: Efficient techniques for comprehensive protection from memory error exploits. In: Proceedings of the 14th Conference on USENIX Security Symposium - Volume 14, SSYM 2005, p. 17. USENIX Association, USA (2005)"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Browne, M., Clarke, E., Gr\u00fcmberg, O.: Characterizing finite Kripke structures in propositional temporal logic. Theor. Comput. Sci. 59(1), 115\u2013131 (1988). https:\/\/doi.org\/10.1016\/0304-3975(88)90098-9","DOI":"10.1016\/0304-3975(88)90098-9"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Chae, D.K., Ha, J., Kim, S.W., Kang, B., Im, E.G.: Software plagiarism detection: a graph-based approach. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, CIKM 2013, pp. 1577\u20131580. ACM, New York (2013). https:\/\/doi.org\/10.1145\/2505515.2507848","DOI":"10.1145\/2505515.2507848"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Checkoway, S., Davi, L., Dmitrienko, A., Sadeghi, A.R., Shacham, H., Winandy, M.: Return-oriented programming without returns. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, pp. 559\u2013572. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1866307.1866370","DOI":"10.1145\/1866307.1866370"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Churchill, B., Padon, O., Sharma, R., Aiken, A.: Semantic program alignment for equivalence checking. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, pp. 1027\u20131040. ACM, New York (2019). https:\/\/doi.org\/10.1145\/3314221.3314596","DOI":"10.1145\/3314221.3314596"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Clutterbuck, D.L., Carr\u00e9, B.A.: The verification of low-level code. Softw. Eng. J. 3(3), 97\u2013111 (1988). https:\/\/doi.org\/10.1049\/sej.1988.0012","DOI":"10.1049\/sej.1988.0012"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Cohen, F.B.: Operating System Protection Through Program Evolution, vol. 12, pp. 565\u2013584. Elsevier Advanced Technology Publications, GBR (1993). https:\/\/doi.org\/10.1016\/0167-4048(93)90054-9","DOI":"10.1016\/0167-4048(93)90054-9"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Crane, S., Homescu, A., Larsen, P.: Code randomization: haven\u2019t we solved this problem yet? In: 2016 IEEE Cybersecurity Development (SecDev), pp. 124\u2013129 (2016)","DOI":"10.1109\/SecDev.2016.036"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Crane, S., et al.: Readactor: practical code randomization resilient to memory disclosure. In: Proceedings of the 2015 IEEE Symposium on Security and Privacy, SP 2015, pp. 763\u2013780. IEEE Computer Society, Washington, DC (2015). https:\/\/doi.org\/10.1109\/SP.2015.52","DOI":"10.1109\/SP.2015.52"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"David, Y., Partush, N., Yahav, E.: Statistical similarity of binaries. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016, pp. 266\u2013280. ACM, New York (2016) https:\/\/doi.org\/10.1145\/2908080.2908126","DOI":"10.1145\/2908080.2908126"},{"key":"11_CR13","unstructured":"Egele, M., Woo, M., Chapman, P., Brumley, D.: Blanket execution: dynamic similarity testing for program binaries and components. In: 23rd USENIX Security Symposium (USENIX Security 2014), San Diego, CA, pp. 303\u2013317. USENIX Association, August 2014"},{"key":"11_CR14","unstructured":"Fernandez, J.C., Mounier, L.: Verifying bisimulations \u201con the fly\u201d. FORTE. 90, 95\u2013110 (1990)"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Forrest, S., Somayaji, A., Ackley, D.: Building diverse computer systems. In: Proceedings of the 6th Workshop on Hot Topics in Operating Systems (HotOS-VI), HOTOS 1997, p. 67. IEEE Computer Society, Washington, DC (1997). https:\/\/doi.org\/10.1109\/hotos.1997.595185","DOI":"10.1109\/hotos.1997.595185"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-88625-9_16","volume-title":"Information and Communications Security","author":"D Gao","year":"2008","unstructured":"Gao, D., Reiter, M.K., Song, D.: BinHunt: automatically finding semantic differences in binary programs. In: Chen, L., Ryan, M.D., Wang, G. (eds.) ICICS 2008. LNCS, vol. 5308, pp. 238\u2013255. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88625-9_16"},{"key":"11_CR17","unstructured":"Giuffrida, C., Kuijsten, A., Tanenbaum, A.S.: Enhanced operating system security through efficient and fine-grained address space randomization. In: Proceedings of the 21st USENIX Conference on Security Symposium, Security 2012, p. 40. USENIX Association, USA (2012)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Hiser, J., Nguyen-Tuong, A., Co, M., Hall, M., Davidson, J.W.: ILR: where\u2019d my gadgets go? In: 2012 IEEE Symposium on Security and Privacy, pp. 571\u2013585 (2012)","DOI":"10.1109\/SP.2012.39"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Hiser, J., Nguyen-Tuong, A., Hawkins, W., McGill, M., Co, M., Davidson, J.: Zipr++: exceptional binary rewriting. In: Proceedings of the 2017 Workshop on Forming an Ecosystem Around Software Transformation, FEAST 2017, pp. 9\u201315. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3141235.3141240","DOI":"10.1145\/3141235.3141240"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Homescu, A., Neisius, S., Larsen, P., Brunthaler, S., Franz, M.: Profile-guided automated software diversity. In: Proceedings of the 2013 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), CGO 2013, pp. 1\u201311. IEEE Computer Society, Washington, DC (2013). https:\/\/doi.org\/10.1109\/CGO.2013.6494997","DOI":"10.1109\/CGO.2013.6494997"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Hosseinzadeh, S., et al.: Diversification and obfuscation techniques for software security: a systematic literature review. Inf. Softw. Technol. 104, 72\u201393 (2018)","DOI":"10.1016\/j.infsof.2018.07.007"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Jackson, T., Homescu, A., Crane, S., Larsen, P., Brunthaler, S., Franz, M.: Diversifying the software stack using randomized NOP insertion. In: Jajodia, S., Ghosh, A.K., Subrahmanian, V.S., Swarup, V., Wang, C., Wang, X.S. (eds.) Moving Target Defense. Advances in Information Security, vol. 100, pp. 151\u2013173. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5416-8_8","DOI":"10.1007\/978-1-4614-5416-8_8"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Jackson, T., et al.: Compiler-Generated Software Diversity. In: Jajodia, S., Ghosh, A., Swarup, V., Wang, C., Wang, X. (eds.) Moving Target Defense. Advances in Information Security, vol. 54, pp. 77\u201398. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-0977-9_4","DOI":"10.1007\/978-1-4614-0977-9_4"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Junod, P., Rinaldini, J., Wehrli, J., Michielin, J.: Obfuscator-LLVM - software protection for the masses. In: Wyseur, B. (ed.) Proceedings of the IEEE\/ACM 1st International Workshop on Software Protection, SPRO 2015, Firenze, Italy, 19th May 2015, pp. 3\u20139. IEEE (2015). https:\/\/doi.org\/10.1109\/SPRO.2015.10","DOI":"10.1109\/SPRO.2015.10"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Kil, C., Jun, J., Bookholt, C., Xu, J., Ning, P.: Address space layout permutation (ASLP): towards fine-grained randomization of commodity software. In: 2006 22nd Annual Computer Security Applications Conference (ACSAC 2006), pp. 339\u2013348 (2006)","DOI":"10.1109\/ACSAC.2006.9"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-47764-0_3","volume-title":"Static Analysis","author":"R Komondoor","year":"2001","unstructured":"Komondoor, R., Horwitz, S.: Using slicing to identify duplication in source code. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 40\u201356. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47764-0_3"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Koo, H., Chen, Y., Lu, L., Kemerlis, V.P., Polychronakis, M.: Compiler-assisted code randomization. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 461\u2013477, May 2018. https:\/\/doi.org\/10.1109\/SP.2018.00029","DOI":"10.1109\/SP.2018.00029"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Larsen, P., Homescu, A., Brunthaler, S., Franz, M.: SoK: automated software diversity. In: 2014 IEEE Symposium on Security and Privacy, pp. 276\u2013291, May 2014. https:\/\/doi.org\/10.1109\/SP.2014.25","DOI":"10.1109\/SP.2014.25"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009). https:\/\/doi.org\/10.1145\/1538788.1538814","DOI":"10.1145\/1538788.1538814"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Li, L., Feng, H., Zhuang, W., Meng, N., Ryder, B.: CCLearner: a deep learning-based clone detection approach. In: 2017 IEEE International Conference on Software Maintenance and Evolution (ICSME), pp. 249\u2013260, September 2017. https:\/\/doi.org\/10.1109\/ICSME.2017.46","DOI":"10.1109\/ICSME.2017.46"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-30840-1_15","volume-title":"Information Security and Cryptology - ICISC 2015","author":"Yu Liang","year":"2016","unstructured":"Liang, Yu., et al.: Stack layout randomization with minimal rewriting of Android binaries. In: Kwon, S., Yun, A. (eds.) ICISC 2015. LNCS, vol. 9558, pp. 229\u2013245. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_15"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Lim, J.P., Nagarakatte, S.: Automatic equivalence checking for assembly implementations of cryptography libraries, pp. 37\u201349 (2019). https:\/\/doi.org\/10.1109\/cgo.2019.8661180","DOI":"10.1109\/cgo.2019.8661180"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Liu, B., et al.: $$\\alpha $$diff: cross-version binary code similarity detection with DNN. In: Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, pp. 667\u2013678. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3238147.3238199","DOI":"10.1145\/3238147.3238199"},{"key":"11_CR34","doi-asserted-by":"publisher","unstructured":"Liu, C., Chen, C., Han, J., Yu, P.S.: GPLAG: detection of software plagiarism by program dependence graph analysis. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, pp. 872\u2013881. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1150402.1150522","DOI":"10.1145\/1150402.1150522"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Luo, L., Ming, J., Wu, D., Liu, P., Zhu, S.: Semantics-based obfuscation-resilient binary code similarity comparison with applications to software plagiarism detection. In: Proceedings of the 22Nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2014, pp. 389\u2013400. ACM, New York (2014). https:\/\/doi.org\/10.1145\/2635868.2635900","DOI":"10.1145\/2635868.2635900"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Pappas, V., Polychronakis, M., Keromytis, A.D.: Practical software diversification using in-place code randomization. In: Jajodia, S., Ghosh, A., Subrahmanian, V., Swarup, V., Wang, C., Wang, X. (eds.) Moving Target Defense II. Advances in Information Security, vol. 100. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5416-8_9","DOI":"10.1007\/978-1-4614-5416-8_9"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-319-25159-2_49","volume-title":"Knowledge Science, Engineering and Management","author":"H Peng","year":"2015","unstructured":"Peng, H., Mou, L., Li, G., Liu, Y., Zhang, L., Jin, Z.: Building program vector representations for deep learning. In: Zhang, S., Wirsing, M., Zhang, Z. (eds.) KSEM 2015. LNCS (LNAI), vol. 9403, pp. 547\u2013553. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25159-2_49"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Pewny, J., Garmany, B., Gawlik, R., Rossow, C., Holz, T.: Cross-architecture bug search in binary executables. In: 2015 IEEE Symposium on Security and Privacy, pp. 709\u2013724, May 2015. https:\/\/doi.org\/10.1109\/SP.2015.49","DOI":"10.1109\/SP.2015.49"},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-642-22110-1_55","volume-title":"Computer Aided Verification","author":"DA Ramos","year":"2011","unstructured":"Ramos, D.A., Engler, D.R.: Practical, low-effort equivalence verification of real code. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 669\u2013685. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_55"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"Roy, C.K., Cordy, J.R., Koschke, R.: Comparison and evaluation of code clone detection techniques and tools: a qualitative approach. Sci. Comput. Program. 74(7), 470\u2013495 (2009). https:\/\/doi.org\/10.1016\/j.scico.2009.02.007","DOI":"10.1016\/j.scico.2009.02.007"},{"key":"11_CR41","doi-asserted-by":"publisher","unstructured":"Shacham, H.: The geometry of innocent flesh on the bone: return-into-libc without function calls (on the x86). In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS 2007, pp. 552\u2013561. ACM, New York (2007). https:\/\/doi.org\/10.1145\/1315245.1315313","DOI":"10.1145\/1315245.1315313"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Shalev, N., Partush, N.: Binary similarity detection using machine learning. In: Proceedings of the 13th Workshop on Programming Languages and Analysis for Security, PLAS 2018, pp. 42\u201347. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3264820.3264821","DOI":"10.1145\/3264820.3264821"},{"key":"11_CR43","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 Security and Privacy (SP), pp. 138\u2013157 (2016)","DOI":"10.1109\/SP.2016.17"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Siegel, S.F., Mironova, A., Avrunin, G.S., Clarke, L.A.: Using model checking with symbolic execution to verify parallel numerical programs. In: Proceedings of the 2006 International Symposium on Software Testing and Analysis, ISSTA 2006, pp. 157\u2013168. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1146238.1146256","DOI":"10.1145\/1146238.1146256"},{"key":"11_CR45","doi-asserted-by":"publisher","unstructured":"Wang, R., et al.: Ramblr: making reassembly great again. In: The Network and Distributed System Security Symposium, NDSS 2017 (2017). https:\/\/doi.org\/10.14722\/ndss.2017.23225","DOI":"10.14722\/ndss.2017.23225"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Wang, S., Wang, P., Wu, D.: Composite software diversification. In: 2017 IEEE International Conference on Software Maintenance and Evolution (ICSME), pp. 284\u2013294 (2017)","DOI":"10.1109\/ICSME.2017.61"},{"key":"11_CR47","doi-asserted-by":"publisher","unstructured":"Wartell, R., Mohan, V., Hamlen, K.W., Lin, Z.: Binary stirring: self-randomizing instruction addresses of legacy x86 binary code. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS 2012, pp. 157\u2013168. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2382196.2382216","DOI":"10.1145\/2382196.2382216"},{"key":"11_CR48","doi-asserted-by":"publisher","unstructured":"Xu, X., Liu, C., Feng, Q., Yin, H., Song, L., Song, D.: Neural network-based graph embedding for cross-platform binary code similarity detection. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 363\u2013376. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3133956.3134018","DOI":"10.1145\/3133956.3134018"},{"key":"11_CR49","doi-asserted-by":"publisher","unstructured":"Xu, Z., Miller, B.P., Reps, T.: Safety checking of machine code. In: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, PLDI 2000, pp. 70\u201382. ACM, New York (2000). https:\/\/doi.org\/10.1145\/349299.349313","DOI":"10.1145\/349299.349313"},{"key":"11_CR50","unstructured":"Zuo, F., Li, X., Zhang, Z., Young, P., Luo, L., Zeng, Q.: Neural machine translation inspired binary code similarity comparison beyond function pairs. CoRR abs\/1808.04706 (2018). https:\/\/arxiv.org\/abs\/1808.04706"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76384-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T23:55:26Z","timestamp":1621382126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76384-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030763831","9783030763848"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76384-8_11","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":"19 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2021","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":"nfm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2021\/","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":"66","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":"21","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":"3","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":"32% - 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)"}}]}}