{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T07:49:11Z","timestamp":1790927351010,"version":"4.1.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030309411","type":"print"},{"value":"9783030309428","type":"electronic"}],"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-30942-8_27","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"442-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Concolic Testing Heap-Manipulating Programs"],"prefix":"10.1007","author":[{"given":"Long H.","family":"Pham","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quang Loc","family":"Le","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quoc-Sang","family":"Phan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"27_CR1","unstructured":"A Fuzzer and a Symbolic Executor Walk into a Cloud. \nhttps:\/\/blog.trailofbits.com\/2016\/08\/02\/engineering-solutions-to-hard-program-analysis-problems\/"},{"key":"27_CR2","unstructured":"Facebook Infer. \nhttps:\/\/fbinfer.com\/"},{"key":"27_CR3","unstructured":"GanttProject. \nhttps:\/\/github.com\/bardsoftware\/ganttproject"},{"key":"27_CR4","unstructured":"JaCoCo. \nhttps:\/\/www.eclemma.org\/jacoco\/"},{"key":"27_CR5","unstructured":"PLEXIL. \nhttp:\/\/plexil.sourceforge.net"},{"key":"27_CR6","unstructured":"PLEXIL5. \nhttps:\/\/github.com\/nasa\/PLEXIL5"},{"key":"27_CR7","unstructured":"SIR. \nhttp:\/\/sir.unl.edu\/portal\/index.php"},{"key":"27_CR8","unstructured":"Sireum. \nhttps:\/\/code.google.com\/archive\/p\/sireum\/downloads"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Boyapati, C., Khurshid, S., Marinov, D.: Korat: automated testing based on Java predicates. In: Frankl, P.G. (ed.) ISSTA 2002, pp. 123\u2013133. ACM (2002). \nhttps:\/\/doi.org\/10.1145\/566172.566191","DOI":"10.1145\/566172.566191"},{"key":"27_CR10","doi-asserted-by":"publisher","unstructured":"Braione, P., Denaro, G., Mattavelli, A., Pezz\u00e8, M.: Combining symbolic execution and search-based testing for programs with complex heap inputs. In: Bultan, T., Sen, K. (eds.) ISSTA 2017, pp. 90\u2013101. ACM (2017). \nhttps:\/\/doi.org\/10.1145\/3092703.3092715","DOI":"10.1145\/3092703.3092715"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Braione, P., Denaro, G., Pezz\u00e8, M.: Symbolic execution of programs with heap inputs. In: Nitto, E.D., Harman, M., Heymans, P. (eds.) FSE 2015, pp. 602\u2013613. ACM (2015). \nhttps:\/\/doi.org\/10.1145\/2786805.2786842","DOI":"10.1145\/2786805.2786842"},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Braione, P., Denaro, G., Pezz\u00e8, M.: JBSE: A symbolic executor for Java programs with complex heap inputs. In: Zimmermann, T., Cleland-Huang, J., Su, Z. (eds.) FSE 2016, pp. 1018\u20131022. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2950290.2983940","DOI":"10.1145\/2950290.2983940"},{"issue":"6","key":"27_CR13","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/2049697.2049700","volume":"58","author":"C Calcagno","year":"2011","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P.W., Yang, H.: Compositional shape analysis by means of bi-abduction. JACM 58(6), 26:1\u201326:66 (2011). \nhttps:\/\/doi.org\/10.1145\/2049697.2049700","journal-title":"JACM"},{"issue":"9","key":"27_CR14","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1016\/j.scico.2010.07.004","volume":"77","author":"WN Chin","year":"2012","unstructured":"Chin, W.N., David, C., Nguyen, H.H., Qin, S.: Automated verification of shape, size and bag properties via user-defined predicates in separation logic. Sci. Comput. Program. 77(9), 1006\u20131036 (2012). \nhttps:\/\/doi.org\/10.1016\/j.scico.2010.07.004","journal-title":"Sci. Comput. Program."},{"key":"27_CR15","doi-asserted-by":"publisher","unstructured":"Deng, X., Lee, J., Robby: Bogor\/Kiasan: a k-bounded symbolic execution for checking strong heap properties of open systems. In: ASE 2006, pp. 157\u2013166. IEEE Computer Society (2006). \nhttps:\/\/doi.org\/10.1109\/ASE.2006.26","DOI":"10.1109\/ASE.2006.26"},{"key":"27_CR16","doi-asserted-by":"publisher","unstructured":"Deng, X., Robby, Hatcliff, J.: Towards a case-optimal symbolic execution algorithm for analyzing strong properties of object-oriented programs. In: SEFM 2007. IEEE Computer Society (2007). \nhttps:\/\/doi.org\/10.1109\/SEFM.2007.43","DOI":"10.1109\/SEFM.2007.43"},{"key":"27_CR17","unstructured":"Dennis, G.D.: TSAFE : building a trusted computing base for air traffic control software. Master\u2019s thesis, Massachusetts Institute of Technology, USA (2003)"},{"key":"27_CR18","doi-asserted-by":"publisher","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: Sarkar, V., Hall, M.W. (eds.) PLDI 2005, pp. 213\u2013223. ACM (2005). \nhttps:\/\/doi.org\/10.1145\/1065010.1065036","DOI":"10.1145\/1065010.1065036"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"20:20","DOI":"10.1145\/2090147.2094081","volume":"10","author":"P Godefroid","year":"2012","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.: SAGE: whitebox fuzzing for security testing. Queue 10(1), 20:20\u201320:27 (2012). \nhttps:\/\/doi.org\/10.1145\/2090147.2094081","journal-title":"Queue"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-24617-6_4","volume-title":"Formal Approaches to Software Testing","author":"MPE Heimdahl","year":"2004","unstructured":"Heimdahl, M.P.E., Rayadurgam, S., Visser, W., Devaraj, G., Gao, J.: Auto-generating test sequences using model checkers: a case study. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol. 2931, pp. 42\u201359. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24617-6_4"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-662-49122-5_10","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B Hillery","year":"2016","unstructured":"Hillery, B., Mercer, E., Rungta, N., Person, S.: Exact heap summaries for symbolic execution. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 206\u2013225. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49122-5_10"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-46002-0_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"HS Hong","year":"2002","unstructured":"Hong, H.S., Lee, I., Sokolsky, O., Ural, H.: A temporal logic based theory of test coverage and generation. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 327\u2013341. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-46002-0_23"},{"key":"27_CR23","doi-asserted-by":"publisher","unstructured":"Ishtiaq, S.S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. In: Hankin, C., Schmidt, D. (eds.) POPL 2001, pp. 14\u201326. ACM (2001). \nhttps:\/\/doi.org\/10.1145\/360204.375719","DOI":"10.1145\/360204.375719"},{"key":"27_CR24","unstructured":"Jayaraman, K., Harvison, D., Ganesh, V., Kiezun, A.: jFuzz: a concolic whitebox fuzzer for Java. In: Denney, E., Giannakopoulou, D., Pasareanu, C.S. (eds.) NFM 2009, pp. 121\u2013125 (2009)"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/3-540-36577-X_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Khurshid","year":"2003","unstructured":"Khurshid, S., P\u01ces\u01cereanu, C.S., Visser, W.: Generalized symbolic execution for model checking and testing. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 553\u2013568. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36577-X_40"},{"issue":"7","key":"27_CR26","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976). \nhttps:\/\/doi.org\/10.1145\/360248.360252","journal-title":"Commun. ACM"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-08867-9_4","volume-title":"Computer Aided Verification","author":"QL Le","year":"2014","unstructured":"Le, Q.L., Gherghina, C., Qin, S., Chin, W.-N.: Shape analysis via second-order bi-abduction. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 52\u201368. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08867-9_4"},{"key":"27_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-319-41528-4_21","volume-title":"Computer Aided Verification","author":"QL Le","year":"2016","unstructured":"Le, Q.L., Sun, J., Chin, W.-N.: Satisfiability modulo heap-based programs. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 382\u2013404. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-41528-4_21"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-89960-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"QL Le","year":"2018","unstructured":"Le, Q.L., Sun, J., Qin, S.: Frame inference for inductive entailment proofs in separation logic. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 41\u201360. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-89960-2_3"},{"key":"27_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-319-63390-9_26","volume-title":"Computer Aided Verification","author":"QL Le","year":"2017","unstructured":"Le, Q.L., Tatsuta, M., Sun, J., Chin, W.-N.: A decidable fragment in separation logic with inductive predicates and arithmetic. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 495\u2013517. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63390-9_26"},{"key":"27_CR31","doi-asserted-by":"publisher","unstructured":"Le, X.D., Le, Q.L., Lo, D., Le Goues, C.: Enhancing automated program repair with deductive verification. In: ICSME 2016, pp. 428\u2013432. IEEE Computer Society (2016). \nhttps:\/\/doi.org\/10.1109\/ICSME.2016.66","DOI":"10.1109\/ICSME.2016.66"},{"key":"27_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-662-49674-9_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Luckow","year":"2016","unstructured":"Luckow, K., et al.: JDart: a dynamic symbolic analysis framework. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 442\u2013459. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49674-9_26"},{"key":"27_CR33","doi-asserted-by":"publisher","unstructured":"Marinescu, P.D., Cadar, C.: Make test-zesti: a symbolic execution solution for improving regression testing. In: Glinz, M., Murphy, G.C., Pezz\u00e8, M. (eds.) ICSE 2012, pp. 716\u2013726. IEEE Computer Society (2012). \nhttps:\/\/doi.org\/10.1109\/ICSE.2012.6227146","DOI":"10.1109\/ICSE.2012.6227146"},{"key":"27_CR34","doi-asserted-by":"publisher","unstructured":"Marinov, D., Khurshid, S.: TestEra: a novel framework for automated testing of Java programs. In: ASE 2001, pp. 22\u201331. IEEE Computer Society (2001). \nhttps:\/\/doi.org\/10.1109\/ASE.2001.989787","DOI":"10.1109\/ASE.2001.989787"},{"key":"27_CR35","doi-asserted-by":"crossref","unstructured":"Pham, L.H., Le, Q.L., Phan, Q.S., Sun, J., Qin, S.: Enhancing symbolic execution of heap-based programs with separation logic for test input generation. In: ATVA 2019. To appear","DOI":"10.1007\/978-3-030-31784-3_12"},{"key":"27_CR36","doi-asserted-by":"publisher","unstructured":"Pham, L.H., Le, Q.L., Phan, Q.S., Sun, J., Qin, S.: Testing heap-based programs with Java StarFinder. In: Chaudron, M., Crnkovic, I., Chechik, M., Harman, M. (eds.) ICSE 2018, pp. 268\u2013269. ACM (2018). \nhttps:\/\/doi.org\/10.1145\/3183440.3194964","DOI":"10.1145\/3183440.3194964"},{"key":"27_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/978-3-642-39799-8_54","volume-title":"Computer Aided Verification","author":"R Piskac","year":"2013","unstructured":"Piskac, R., Wies, T., Zufferey, D.: Automating separation logic using SMT. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 773\u2013789. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39799-8_54"},{"key":"27_CR38","doi-asserted-by":"publisher","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: LICS 2002, pp. 55\u201374. IEEE Computer Society (2002). \nhttps:\/\/doi.org\/10.1109\/LICS.2002.1029817","DOI":"10.1109\/LICS.2002.1029817"},{"issue":"POPL","key":"27_CR39","doi-asserted-by":"publisher","first-page":"66:1","DOI":"10.1145\/3290379","volume":"3","author":"JF Santos","year":"2019","unstructured":"Santos, J.F., Maksimovi\u0107, P., Sampaio, G., Gardner, P.: JaVerT 2.0: compositional symbolic execution for JavaScript. PACMPL 3(POPL), 66:1\u201366:31 (2019). \nhttps:\/\/doi.org\/10.1145\/3290379","journal-title":"PACMPL"},{"key":"27_CR40","doi-asserted-by":"publisher","unstructured":"Sen, K., Marinov, D., Agha, G.: CUTE: a concolic unit testing engine for C. In: Wermelinger, M., Gall, H.C. (eds.) FSE 2005, pp. 263\u2013272. ACM (2005). \nhttps:\/\/doi.org\/10.1145\/1081706.1081750","DOI":"10.1145\/1081706.1081750"},{"key":"27_CR41","doi-asserted-by":"crossref","unstructured":"Stephens, N., et al.: Driller: augmenting fuzzing through selective symbolic execution. In: NDSS 2016. The Internet Society (2016)","DOI":"10.14722\/ndss.2016.23368"},{"key":"27_CR42","doi-asserted-by":"publisher","unstructured":"Tanno, H., Zhang, X., Hoshino, T., Sen, K.: TesMa and CATG: automated test generation tools for models of enterprise applications. In: Bertolino, A., Canfora, G., Elbaum, S.G. (eds.) ICSE 2015, pp. 717\u2013720. IEEE Computer Society (2015). \nhttps:\/\/doi.org\/10.1109\/ICSE.2015.231","DOI":"10.1109\/ICSE.2015.231"},{"key":"27_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-79124-9_10","volume-title":"Tests and Proofs","author":"N Tillmann","year":"2008","unstructured":"Tillmann, N., de Halleux, J.: Pex\u2013white box test generation for.NET. In: Beckert, B., H\u00e4hnle, R. (eds.) TAP 2008. LNCS, vol. 4966, pp. 134\u2013153. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-79124-9_10"},{"key":"27_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-00768-2_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Vanoverberghe","year":"2009","unstructured":"Vanoverberghe, D., Tillmann, N., Piessens, F.: Test input generation for programs with pointers. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 277\u2013291. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00768-2_25"},{"key":"27_CR45","doi-asserted-by":"publisher","unstructured":"Visser, W., P\u01ces\u01cereanu, C.S., Khurshid, S.: Test input generation with java PathFinder. In: Avrunin, G.S., Rothermel, G. (eds.) ISSTA 2004, pp. 97\u2013107. ACM (2004). \nhttps:\/\/doi.org\/10.1145\/1007512.1007526","DOI":"10.1145\/1007512.1007526"},{"key":"27_CR46","doi-asserted-by":"publisher","unstructured":"Wang, X., Sun, J., Chen, Z., Zhang, P., Wang, J., Lin, Y.: Towards optimal concolic testing. In: Chaudron, M., Crnkovic, I., Chechik, M., Harman, M. (eds.) ICSE 2018, pp. 291\u2013302 (2018). \nhttps:\/\/doi.org\/10.1145\/3180155.3180177","DOI":"10.1145\/3180155.3180177"},{"key":"27_CR47","unstructured":"Yun, I., Lee, S., Xu, M., Jang, Y., Kim, T.: QSYM : a practical concolic execution engine tailored for hybrid fuzzing. In: Enck, W., Felt, A.P. (eds.) USENIX Security 2018, pp. 745\u2013761. USENIX Association (2018)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods \u2013 The Next 30 Years"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30942-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T06:09:51Z","timestamp":1588658991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30942-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030309411","9783030309428"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30942-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/","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":"129","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":"44","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":"7","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":"34% - 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":"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":"5,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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}