{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:39:22Z","timestamp":1726043962106},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304454"},{"type":"electronic","value":"9783030304461"}],"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-30446-1_19","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:03:18Z","timestamp":1567969398000},"page":"353-372","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Relational Verification for Program Slicing"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Beckert","sequence":"first","affiliation":[]},{"given":"Thorsten","family":"Bormer","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Gocht","sequence":"additional","affiliation":[]},{"given":"Mihai","family":"Herda","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Lentzsch","sequence":"additional","affiliation":[]},{"given":"Mattias","family":"Ulbrich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"19_CR1","unstructured":"LLVM language reference manual. \n                      https:\/\/llvm.org\/docs\/LangRef.html\n                      \n                    . Accessed 06 Feb 2019"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, H., Horgan, J.R.: Dynamic program slicing. In: Proceedings of the ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, PLDI 1990, pp. 246\u2013256. ACM, New York (1990). \n                      https:\/\/doi.org\/10.1145\/93542.93576","DOI":"10.1145\/93542.93576"},{"issue":"11","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.tcs.2009.10.025","volume":"411","author":"RW Barraclough","year":"2010","unstructured":"Barraclough, R.W., et al.: A trajectory-based strict semantics for program slicing. Theoret. Comput. Sci. 411(11), 1372\u20131386 (2010). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2009.10.025","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00165-011-0196-1","volume":"24","author":"JB Barros","year":"2012","unstructured":"Barros, J.B., da Cruz, D., Henriques, P.R., Pinto, J.S.: Assertion-based slicing and slice graphs. Formal Aspects Comput. 24(2), 217\u2013248 (2012). \n                      https:\/\/doi.org\/10.1007\/s00165-011-0196-1","journal-title":"Formal Aspects Comput."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-319-66845-1_20","volume-title":"Integrated Formal Methods","author":"B Beckert","year":"2017","unstructured":"Beckert, B., Bormer, T., Gocht, S., Herda, M., Lentzsch, D., Ulbrich, M.: SemSlice: exploiting relational verification for automatic program slicing. In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 312\u2013319. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66845-1_20"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Beckert, B., Bormer, T., Gocht, S., Herda, M., Lentzsch, D., Ulbrich, M.: Evaluation data of SemSlice (2019). \n                      https:\/\/doi.org\/10.5281\/zenodo.3334571","DOI":"10.5281\/zenodo.3334571"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Beckert, B., Bormer, T., Gocht, S., Herda, M., Lentzsch, D., Ulbrich, M.: Implementation of the SemSlice tool (2019). \n                      https:\/\/doi.org\/10.5281\/zenodo.3334553","DOI":"10.5281\/zenodo.3334553"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0065-2458(03)62003-6","volume-title":"Advances in Computers","author":"David Binkley","year":"2004","unstructured":"Binkley, D., Harman, M.: A survey of empirical results on program slicing. In: Advances in Computers, vol. 62, pp. 105\u2013178. Elsevier (2004). \n                      https:\/\/doi.org\/10.1016\/S0065-2458(03)62003-6"},{"issue":"11\u201312","key":"19_CR9","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0950-5849(98)00086-X","volume":"40","author":"G Canfora","year":"1998","unstructured":"Canfora, G., Cimitile, A., Lucia, A.D.: Conditioned program slicing. Inf. Softw. Technol. 40(11\u201312), 595\u2013607 (1998). \n                      https:\/\/doi.org\/10.1016\/S0950-5849(98)00086-X","journal-title":"Inf. Softw. Technol."},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Chung, I.S., Lee, W.K., Yoon, G.S., Kwon, Y.R.: Program slicing based on specification. In: Proceedings of the 2001 ACM Symposium on Applied Computing, SAC 2001, pp. 605\u2013609. ACM, New York (2001). \n                      https:\/\/doi.org\/10.1145\/372202.372784","DOI":"10.1145\/372202.372784"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-60973-3_107","volume-title":"FME\u201996: Industrial Benefit and Advances in Formal Methods","author":"JJ Comuzzi","year":"1996","unstructured":"Comuzzi, J.J., Hart, J.M.: Program slicing using weakest preconditions. In: Gaudel, M.-C., Woodcock, J. (eds.) FME 1996. LNCS, vol. 1051, pp. 557\u2013575. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/3-540-60973-3_107"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"da Cruz, D., Henriques, P.R., Pinto, J.S.: GamaSlicer: an online laboratory for program verification and analysis. In: Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications, LDTA 2010, pp. 3:1\u20133:8. ACM, New York (2010). \n                      https:\/\/doi.org\/10.1145\/1868281.1868284","DOI":"10.1145\/1868281.1868284"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-662-53413-7_8","volume-title":"Static Analysis","author":"E Angelis De","year":"2016","unstructured":"De Angelis, E., Fioravanti, F., Pettorossi, A., Proietti, M.: Relational verification through horn clause transformation. In: Rival, X. (ed.) SAS 2016. LNCS, vol. 9837, pp. 147\u2013169. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-53413-7_8"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Felsing, D., Grebing, S., Klebanov, V., R\u00fcmmer, P., Ulbrich, M.: Automating regression verification. In: Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering, ASE 2014, pp. 349\u2013360. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2642937.2642987","DOI":"10.1145\/2642937.2642987"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J Ferrante","year":"1987","unstructured":"Ferrante, J., Ottenstein, K.J., Warren, J.D.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9(3), 319\u2013349 (1987). \n                      https:\/\/doi.org\/10.1145\/24039.24041","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Field, J., Ramalingam, G., Tip, F.: Parametric program slicing. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1995, pp. 379\u2013392. ACM, New York (1995). \n                      https:\/\/doi.org\/10.1145\/199448.199534","DOI":"10.1145\/199448.199534"},{"issue":"9","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1016\/j.scico.2012.05.007","volume":"78","author":"R Halder","year":"2013","unstructured":"Halder, R., Cortesi, A.: Abstract program slicing on dependence condition graphs. Sci. Comput. Program. 78(9), 1240\u20131263 (2013). \n                      https:\/\/doi.org\/10.1016\/j.scico.2012.05.007","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF00873408","volume":"2","author":"RJ Hall","year":"1995","unstructured":"Hall, R.J.: Automatic extraction of executable program subsets by simultaneous dynamic program slicing. Autom. Softw. Eng. 2(1), 33\u201353 (1995). \n                      https:\/\/doi.org\/10.1007\/BF00873408","journal-title":"Autom. Softw. Eng."},{"issue":"6","key":"19_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10207-009-0086-1","volume":"8","author":"C Hammer","year":"2009","unstructured":"Hammer, C., Snelting, G.: Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs. Int. J. Inf. Secur. 8(6), 399\u2013422 (2009). \n                      https:\/\/doi.org\/10.1007\/s10207-009-0086-1","journal-title":"Int. J. Inf. Secur."},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-92994-1_5","volume-title":"Tests and Proofs","author":"M Herda","year":"2018","unstructured":"Herda, M., Tyszberowicz, S., Beckert, B.: Using dependence graphs to assist verification and testing of information-flow properties. In: Dubois, C., Wolff, B. (eds.) TAP 2018. LNCS, vol. 10889, pp. 83\u2013102. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-92994-1_5"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Horwitz, S., Prins, J., Reps, T.: On the adequacy of program dependence graphs for representing programs. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1988, pp. 146\u2013157. ACM, New York (1988). \n                      https:\/\/doi.org\/10.1145\/73560.73573","DOI":"10.1145\/73560.73573"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-33125-1_17","volume-title":"Static Analysis","author":"J Jaffar","year":"2012","unstructured":"Jaffar, J., Murali, V., Navas, J.A., Santosa, A.E.: Path-sensitive backward slicing. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 231\u2013247. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33125-1_17"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-642-31424-7_61","volume-title":"Computer Aided Verification","author":"J Jaffar","year":"2012","unstructured":"Jaffar, J., Murali, V., Navas, J.A., Santosa, A.E.: TRACER: a symbolic execution tool for verification. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 758\u2013766. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31424-7_61"},{"issue":"3","key":"19_CR24","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10817-017-9433-5","volume":"60","author":"M Kiefer","year":"2017","unstructured":"Kiefer, M., Klebanov, V., Ulbrich, M.: Relational program reasoning using compiler IR - combining static verification and dynamic analysis. J. Autom. Reason. 60(3), 337\u2013363 (2017). \n                      https:\/\/doi.org\/10.1007\/s10817-017-9433-5","journal-title":"J. Autom. Reason."},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00165-014-0326-7","volume":"27","author":"F Kirchner","year":"2015","unstructured":"Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., Yakobowski, B.: Frama-c: a software analysis perspective. Formal Aspects Comput. 27(3), 573\u2013609 (2015). \n                      https:\/\/doi.org\/10.1007\/s00165-014-0326-7","journal-title":"Formal Aspects Comput."},{"issue":"3","key":"19_CR26","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10703-017-0293-8","volume":"52","author":"V Klebanov","year":"2018","unstructured":"Klebanov, V., R\u00fcmmer, P., Ulbrich, M.: Automating regression verification of pointer programs by predicate abstraction. Formal Methods Syst. Des. 52(3), 229\u2013259 (2018). \n                      https:\/\/doi.org\/10.1007\/s10703-017-0293-8","journal-title":"Formal Methods Syst. Des."},{"issue":"3","key":"19_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0020-0190(88)90054-3","volume":"29","author":"B Korel","year":"1988","unstructured":"Korel, B., Laski, J.W.: Dynamic program slicing. Inf. Process. Lett. 29(3), 155\u2013163 (1988). \n                      https:\/\/doi.org\/10.1016\/0020-0190(88)90054-3","journal-title":"Inf. Process. Lett."},{"issue":"11\u201312","key":"19_CR28","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/S0950-5849(98)00089-5","volume":"40","author":"B Korel","year":"1998","unstructured":"Korel, B., Rilling, J.: Dynamic program slicing methods. Inf. Softw. Technol. 40(11\u201312), 647\u2013659 (1998). \n                      https:\/\/doi.org\/10.1016\/S0950-5849(98)00089-5","journal-title":"Inf. Softw. Technol."},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-662-49665-7_11","volume-title":"Fundamental Approaches to Software Engineering","author":"J-C L\u00e9chenet","year":"2016","unstructured":"L\u00e9chenet, J.-C., Kosmatov, N., Le Gall, P.: Cut branches before looking for bugs: sound verification on relaxed slices. In: Stevens, P., W\u0105sowski, A. (eds.) FASE 2016. LNCS, vol. 9633, pp. 179\u2013196. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49665-7_11"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-47677-3_7","volume-title":"Dependable Software Engineering: Theories, Tools, and Applications","author":"T Liu","year":"2016","unstructured":"Liu, T., Tyszberowicz, S., Herda, M., Beckert, B., Grahl, D., Taghdiri, M.: Computing specification-sensitive abstractions for program verification. In: Fr\u00e4nzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 101\u2013117. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-47677-3_7"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Lucia, A.D.: Program slicing: methods and applications. In: Proceedings First IEEE International Workshop on Source Code Analysis and Manipulation, pp. 142\u2013149, November 2001. \n                      https:\/\/doi.org\/10.1109\/SCAM.2001.972675","DOI":"10.1109\/SCAM.2001.972675"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"9","key":"19_CR33","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1109\/32.58784","volume":"16","author":"A Podgurski","year":"1990","unstructured":"Podgurski, A., Clarke, L.A.: A formal model of program dependences and its implications for software testing, debugging, and maintenance. IEEE Trans. Softw. Eng. 16(9), 965\u2013979 (1990). \n                      https:\/\/doi.org\/10.1109\/32.58784","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"19_CR34","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1275497.1275502","volume":"29","author":"Venkatesh Prasad Ranganath","year":"2007","unstructured":"Ranganath, V.P., Amtoft, T., Banerjee, A., Hatcliff, J., Dwyer, M.B.: A new foundation for control dependence and slicing for modern program structures. ACM Trans. Program. Lang. Syst. 29(5) (2007). \n                      https:\/\/doi.org\/10.1145\/1275497.1275502","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-39799-8_24","volume-title":"Computer Aided Verification","author":"P R\u00fcmmer","year":"2013","unstructured":"R\u00fcmmer, P., Hojjat, H., Kuncak, V.: Disjunctive interpolants for horn-clause verification. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 347\u2013363. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39799-8_24"},{"issue":"4","key":"19_CR36","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1145\/1178625.1178628","volume":"15","author":"G Snelting","year":"2006","unstructured":"Snelting, G., Robschink, T., Krinke, J.: Efficient path conditions in dependence graphs for software safety analysis. ACM Trans. Softw. Eng. Methodol. 15(4), 410\u2013457 (2006). \n                      https:\/\/doi.org\/10.1145\/1178625.1178628","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"19_CR37","unstructured":"Tip, F.: A survey of program slicing techniques. Technical report, Amsterdam, The Netherlands, The Netherlands (1994). \n                      https:\/\/www.franktip.org\/pubs\/jpl1995.pdf"},{"issue":"3","key":"19_CR38","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/2362389.2362390","volume":"34","author":"S Verdoolaege","year":"2012","unstructured":"Verdoolaege, S., Janssens, G., Bruynooghe, M.: Equivalence checking of static affine programs using widening to handle recurrences. ACM Trans. Program. Lang. Syst. 34(3), 11:1\u201311:35 (2012). \n                      https:\/\/doi.org\/10.1145\/2362389.2362390","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"19_CR39","doi-asserted-by":"publisher","unstructured":"Ward, M.: Properties of slicing definitions. In: 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation, pp. 23\u201332, September 2009. \n                      https:\/\/doi.org\/10.1109\/SCAM.2009.12","DOI":"10.1109\/SCAM.2009.12"},{"key":"19_CR40","unstructured":"Weiser, M.: Program slicing. In: Proceedings of the 5th International Conference on Software Engineering, ICSE 1981, Piscataway, NJ, USA, pp. 439\u2013449. IEEE Press (1981). \n                      http:\/\/dl.acm.org\/citation.cfm?id=800078.802557"},{"issue":"2","key":"19_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1050849.1050865","volume":"30","author":"B Xu","year":"2005","unstructured":"Xu, B., Qian, J., Zhang, X., Wu, Z., Chen, L.: A brief survey of program slicing. SIGSOFT Softw. Eng. Notes 30(2), 1\u201336 (2005). \n                      https:\/\/doi.org\/10.1145\/1050849.1050865","journal-title":"SIGSOFT Softw. Eng. Notes"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30446-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:42:25Z","timestamp":1567971745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30446-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304454","9783030304461"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30446-1_19","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":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"18 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 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":"sefm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sefm2019.inria.fr\/","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":"89","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":"27","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":"30% - 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":"6","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)"}}]}}