{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:44:52Z","timestamp":1778215492557,"version":"3.51.4"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031274800","type":"print"},{"value":"9783031274817","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-27481-7_19","type":"book-chapter","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:03:10Z","timestamp":1677765790000},"page":"321-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["VeyMont: Parallelising Verified Programs Instead of\u00a0Verifying Parallel Programs"],"prefix":"10.1007","author":[{"given":"Petra","family":"van den Bos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Shik","family":"Jongmans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"key":"19_CR1","unstructured":"https:\/\/benchmarksgame-team.pages.debian.net\/benchmarksgame\/index.html"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Aiken, A., Nicolau, A.: Optimal loop parallelization. In: PLDI, pp. 308\u2013317. ACM (1988)","DOI":"10.1145\/960116.54021"},{"issue":"6","key":"19_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","volume":"22","author":"KR Apt","year":"1986","unstructured":"Apt, K.R., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett. 22(6), 307\u2013309 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"19_CR4","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s00165-019-00501-3","volume":"31","author":"KR Apt","year":"2019","unstructured":"Apt, K.R., Olderog, E.-R.: Fifty years of Hoare\u2019s logic. Formal Aspects Comput. 31(6), 751\u2013807 (2019). https:\/\/doi.org\/10.1007\/s00165-019-00501-3","journal-title":"Formal Aspects Comput."},{"issue":"8","key":"19_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/3470569","volume":"64","author":"P Baudin","year":"2021","unstructured":"Baudin, P., et al.: The dogged pursuit of bug-free C programs: the Frama-C software analysis platform. Commun. ACM 64(8), 56\u201368 (2021)","journal-title":"Commun. ACM"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Towards optimal distributed consensus (extended abstract). In: FOCS, pp. 410\u2013415. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63511"},{"key":"19_CR7","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-02011-7","volume-title":"Decidability of Parameterized Verification","author":"R Bloem","year":"2015","unstructured":"Bloem, R., et al.: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, San Rafael (2015)"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/2951860.2951873","volume":"47","author":"R Bloem","year":"2016","unstructured":"Bloem, R., et al.: Decidability in parameterized verification. SIGACT News 47(2), 53\u201364 (2016)","journal-title":"SIGACT News"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-66845-1_7","volume-title":"Integrated Formal Methods","author":"S Blom","year":"2017","unstructured":"Blom, S., Darabi, S., Huisman, M., Oortwijn, W.: The VerCors tool set: verification of parallel and concurrent software. In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 102\u2013110. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66845-1_7"},{"issue":"5","key":"19_CR10","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s10009-020-00601-z","volume":"23","author":"S Blom","year":"2021","unstructured":"Blom, S., Darabi, S., Huisman, M., Safari, M.: Correct program parallelisations. Int. J. Softw. Tools Technol. Transf. 23(5), 741\u2013763 (2021). https:\/\/doi.org\/10.1007\/s10009-020-00601-z","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-06410-9_9","volume-title":"FM 2014: Formal Methods","author":"S Blom","year":"2014","unstructured":"Blom, S., Huisman, M.: The VerCors tool for verification of concurrent programs. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 127\u2013131. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06410-9_9"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Bornat, R., Calcagno, C., O\u2019Hearn, P., Parkinson, M.: Permission accounting in separation logic. In: POPL, pp. 259\u2013270. ACM (2005)","DOI":"10.1145\/1047659.1040327"},{"issue":"3\u20134","key":"19_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0167-8191(98)00020-9","volume":"24","author":"P Boulet","year":"1998","unstructured":"Boulet, P., Darte, A., Silber, G.-A., Vivien, F.: Loop parallelization algorithms: from parallelism extraction to code generation. Parallel Comput. 24(3\u20134), 421\u2013444 (1998)","journal-title":"Parallel Comput."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44898-5_4","volume-title":"Static Analysis","author":"J Boyland","year":"2003","unstructured":"Boyland, J.: Checking interference with fractional permissions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 55\u201372. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44898-5_4"},{"issue":"1\u20133","key":"19_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.tcs.2006.12.034","volume":"375","author":"S Brookes","year":"2007","unstructured":"Brookes, S.: A semantics for concurrent separation logic. Theor. Comput. Sci. 375(1\u20133), 227\u2013270 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Burke, M., Cytron, R.: Interprocedural dependence analysis and parallelization. In: SIGPLAN Symposium on Compiler Construction, pp. 162\u2013175. ACM (1986)","DOI":"10.1145\/13310.13328"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Carbone, M., Montesi, F.: Deadlock-freedom-by-design: multiparty asynchronous global programming. In: POPL, pp. 263\u2013274. ACM (2013)","DOI":"10.1145\/2480359.2429101"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00446-017-0295-1","volume":"31","author":"M Carbone","year":"2018","unstructured":"Carbone, M., Montesi, F., Sch\u00fcrmann, C.: Choreographies, logically. Distributed Comput. 31(1), 51\u201367 (2018)","journal-title":"Distributed Comput."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Castro, D., Hu, R., Jongmans, S.S., Ng, N., Yoshida, N.: Distributed programming using role-parametric session types in Go: statically-typed endpoint APIs for dynamically-instantiated communication structures. PACMPL, 3(POPL), 29:1\u201329:30 (2019)","DOI":"10.1145\/3290342"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-25423-4_14","volume-title":"Formal Methods and Software Engineering","author":"CC Din","year":"2015","unstructured":"Din, C.C., Tapia Tarifa, S.L., H\u00e4hnle, R., Johnsen, E.B.: History-based specification and verification of scalable concurrent and distributed systems. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 217\u2013233. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25423-4_14"},{"issue":"10","key":"19_CR21","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-19718-5_15","volume-title":"Programming Languages and Systems","author":"A Hobor","year":"2011","unstructured":"Hobor, A., Gherghina, C.: Barriers in concurrent separation logic. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 276\u2013296. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19718-5_15"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Hobor, A., Gherghina, C.: Barriers in concurrent separation logic: now with tool support! Log. Methods Comput. Sci., 8(2) (2012)","DOI":"10.2168\/LMCS-8(2:2)2012"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL, pp. 273\u2013284. ACM (2008)","DOI":"10.1145\/1328897.1328472"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-662-49665-7_24","volume-title":"Fundamental Approaches to Software Engineering","author":"R Hu","year":"2016","unstructured":"Hu, R., Yoshida, N.: Hybrid session verification through endpoint API generation. In: Stevens, P., Wasowski, A. (eds.) FASE 2016. LNCS, vol. 9633, pp. 401\u2013418. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49665-7_24"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributive networks. In: FOCS, pp. 150\u2013158. IEEE Computer Society (1981)","DOI":"10.1109\/SFCS.1981.41"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-20398-5_4","volume-title":"NASA Formal Methods","author":"B Jacobs","year":"2011","unstructured":"Jacobs, B., Smans, J., Philippaerts, P., Vogels, F., Penninckx, W., Piessens, F.: VeriFast: a powerful, sound, predictable, fast verifier for C and Java. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 41\u201355. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20398-5_4"},{"key":"19_CR28","doi-asserted-by":"publisher","unstructured":"Jacobs, S., Reynolds, A.: TACAS 22 Artifact Evaluation VM - Ubuntu 20.04 LTS (2021). https:\/\/doi.org\/10.5281\/zenodo.5562597","DOI":"10.5281\/zenodo.5562597"},{"issue":"4","key":"19_CR29","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"CB Jones","year":"1983","unstructured":"Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5(4), 596\u2013619 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-030-99336-8_19","volume-title":"Programming Languages and Systems","author":"S Jongmans","year":"2022","unstructured":"Jongmans, S., van den Bos, P.: A predicate transformer for choreographies. In: ESOP 2022. LNCS, vol. 13240, pp. 520\u2013547. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99336-8_19"},{"issue":"2","key":"19_CR31","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"L Lamport","year":"1974","unstructured":"Lamport, L.: The parallel execution of DO loops. Commun. ACM 17(2), 83\u201393 (1974)","journal-title":"Commun. ACM"},{"issue":"3","key":"19_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1127878.1127884","volume":"31","author":"GT Leavens","year":"2006","unstructured":"Leavens, G.T., Baker, A.L., Ruby, C.: Preliminary design of JML: a behavioral interface specification language for Java. ACM SIGSOFT Softw. Eng. Notes 31(3), 1\u201338 (2006)","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Lim, A.W., Lam, M.S.: Maximizing parallelism and minimizing synchronization with affine transforms. In: POPL, pp. 201\u2013214. ACM Press (1997)","DOI":"10.1145\/263699.263719"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, H.A., et al.: Protocol-based verification of message-passing parallel programs. In: OOPSLA, pp. 280\u2013298. ACM (2015)","DOI":"10.1145\/2858965.2814302"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Neykova, R., Hu, R., Yoshida, N., Abdeljallal, F.: A session type provider: compile-time API generation of distributed protocols with refinements in F#. In: CC, pp. 128\u2013138. ACM (2018)","DOI":"10.1145\/3178372.3179495"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Neykova, R., Yoshida, N.: Let it recover: multiparty protocol-induced recovery. In: CC, pp. 98\u2013108. ACM (2017)","DOI":"10.1145\/3033019.3033031"},{"issue":"3\u20134","key":"19_CR37","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s11761-014-0172-8","volume":"9","author":"N Ng","year":"2015","unstructured":"Ng, N., Yoshida, N.: Pabble: parameterised scribble. Serv. Oriented Comput. Appl. 9(3\u20134), 269\u2013284 (2015)","journal-title":"Serv. Oriented Comput. Appl."},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Oancea, C.E., Rauchwerger, L.: Logical inference techniques for loop parallelization. In PLDI, pp. 509\u2013520. ACM (2012)","DOI":"10.1145\/2345156.2254124"},{"issue":"1\u20133","key":"19_CR39","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2006.12.035","volume":"375","author":"PW O\u2019Hearn","year":"2007","unstructured":"O\u2019Hearn, P.W.: Resources, concurrency, and local reasoning. Theor. Comput. Sci. 375(1\u20133), 271\u2013307 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR40","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/3211968","volume":"62","author":"P O\u2019Hearn","year":"2019","unstructured":"O\u2019Hearn, P.: Separation logic. Commun. ACM 62(2), 86\u201395 (2019)","journal-title":"Commun. ACM"},{"key":"19_CR41","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"SS Owicki","year":"1976","unstructured":"Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Informatica 6, 319\u2013340 (1976)","journal-title":"Acta Informatica"},{"issue":"5","key":"19_CR42","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"SS Owicki","year":"1976","unstructured":"Owicki, S.S., Gries, D.: Verifying properties of parallel programs: an axiomatic approach. Commun. ACM 19(5), 279\u2013285 (1976)","journal-title":"Commun. ACM"},{"issue":"1","key":"19_CR43","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0743-7315(90)90074-Y","volume":"8","author":"D Peleg","year":"1990","unstructured":"Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8(1), 96\u201399 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"19_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-00590-9_25","volume-title":"Programming Languages and Systems","author":"M Raza","year":"2009","unstructured":"Raza, M., Calcagno, C., Gardner, P.: Automatic parallelization with separation logic. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 348\u2013362. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_25"},{"key":"19_CR45","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: LICS, pp. 55\u201374. IEEE Computer Society (2002)"},{"key":"19_CR46","unstructured":"Scalas, A., Dardha, O., Hu, R., Yoshida, N.: A linear decomposition of multiparty sessions for safe distributed programming. In: ECOOP, volume 74 of LIPIcs, pp. 24:1\u201324:31. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"19_CR47","doi-asserted-by":"crossref","unstructured":"Skeen, D.: Nonblocking commit protocols. In: SIGMOD Conference, pp. 133\u2013142. ACM Press (1981)","DOI":"10.1145\/582318.582339"},{"issue":"4","key":"19_CR48","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0020-0190(88)90211-6","volume":"28","author":"I Suzuki","year":"1988","unstructured":"Suzuki, I.: Proving properties of a ring of finite-state machines. Inf. Process. Lett. 28(4), 213\u2013214 (1988)","journal-title":"Inf. Process. Lett."},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"Tournavitis, G., Wang, Z., Franke, B., O\u2019Boyle, M.F.: Towards a holistic approach to auto-parallelization: integrating profile-driven parallelism detection and machine-learning based mapping. In: PLDI, pp. 177\u2013187. ACM (2009)","DOI":"10.1145\/1543135.1542496"},{"key":"19_CR50","unstructured":"VerCors Wiki. https:\/\/github.com\/utwente-fmt\/vercors\/wiki"},{"key":"19_CR51","doi-asserted-by":"publisher","unstructured":"VeyMont Artifact. https:\/\/doi.org\/10.5281\/zenodo.7410640","DOI":"10.5281\/zenodo.7410640"},{"key":"19_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-030-81685-8_17","volume-title":"Computer Aided Verification","author":"FA Wolf","year":"2021","unstructured":"Wolf, F.A., Arquint, L., Clochard, M., Oortwijn, W., Pereira, J.C., M\u00fcller, P.: Gobra: modular specification and\u00a0verification of Go programs. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 367\u2013379. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_17"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27481-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:08:03Z","timestamp":1677766083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27481-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031274800","9783031274817"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27481-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 March 2023","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":"L\u00fcbeck","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fm2023.isp.uni-luebeck.de\/wordpress\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","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":"26","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":"2","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":"27% - 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)"}},{"value":"The proceedings also include 7 short industry papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}