{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:05:35Z","timestamp":1776373535123,"version":"3.51.2"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031107689","type":"print"},{"value":"9783031107696","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":212,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider a logic used to describe sets of configurations of distributed systems, whose network topologies can be changed at runtime, by reconfiguration programs. The logic uses inductive definitions to describe networks with an unbounded number of components and interactions, written using a multiplicative conjunction, reminiscent of Bunched Implications [37] and Separation Logic [39]. We study the complexity of the satisfiability and entailment problems for the configuration logic under consideration. Additionally, we consider the robustness property of degree boundedness (is every component involved in a bounded number of interactions?), an ingredient for decidability of entailments.<\/jats:p>","DOI":"10.1007\/978-3-031-10769-6_40","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T01:02:56Z","timestamp":1659315776000},"page":"691-711","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Decision Problems in\u00a0a\u00a0Logic for\u00a0Reasoning About Reconfigurable Distributed Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4412-5684","authenticated-orcid":false,"given":"Marius","family":"Bozga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8589-6955","authenticated-orcid":false,"given":"Lucas","family":"Bueri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3204-3294","authenticated-orcid":false,"given":"Radu","family":"Iosif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"40_CR1","unstructured":"Ahrens, E., Bozga, M., Iosif, R., Katoen, J.: Local reasoning about parameterized reconfigurable distributed systems. CoRR, abs\/2107.05253 (2021)"},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1017\/S0960129504004153","volume":"14","author":"F Arbab","year":"2004","unstructured":"Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329\u2013366 (2004)","journal-title":"Math. Struct. Comput. Sci."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), pp. 3\u201312. IEEE Computer Society (2006)","DOI":"10.1109\/SEFM.2006.27"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Bloem, R., et al.: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2015)","DOI":"10.2200\/S00658ED1V01Y201508DCT013"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Bozga, M., Bueri, L., Iosif, R.: Decision problems in a logic for reasoning about reconfigurable distributed systems. CoRR, abs\/2202.09637 (2022)","DOI":"10.1007\/978-3-031-10769-6_40"},{"key":"40_CR6","unstructured":"Bozga, M., Iosif, R., Sifakis, J.: Verification of component-based systems with recursive architectures. CoRR, abs\/2112.08292 (2021)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Bradbury, J., Cordy, J., Dingel, J., Wermelinger, M.: A survey of self-management in dynamic software architecture specifications. In: Proceedings of the 1st ACM SIGSOFT workshop on Self-managed systems, pp. 28\u201333. ACM (2004)","DOI":"10.1145\/1075405.1075411"},{"issue":"3","key":"40_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/2984450.2984457","volume":"3","author":"S Brookes","year":"2016","unstructured":"Brookes, S., O\u2019Hearn, P.W.: Concurrent separation logic. ACM SIGLOG News 3(3), 47\u201365 (2016)","journal-title":"ACM SIGLOG News"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Brotherston, J., Fuhs, C., P\u00e9rez, J.A.N., Gorogiannis, N.: A decision procedure for satisfiability in separation logic with inductive predicates. In: CSL-LICS, pp. 25:1\u201325:10. ACM (2014)","DOI":"10.1145\/2603088.2603091"},{"key":"40_CR10","doi-asserted-by":"publisher","unstructured":"Bucchiarone, A., Galeotti, J.P.: Dynamic software architectures verification using dynalloy. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 10 (2008). https:\/\/doi.org\/10.14279\/tuj.eceasst.10.145","DOI":"10.14279\/tuj.eceasst.10.145"},{"key":"40_CR11","unstructured":"Butting, A., Heim, R., Kautz, O., Ringert, J.O., Rumpe, B., Wortmann, A.: A classification of dynamic reconfiguration in component and connector architecture description. In: Proceedings of MODELS 2017 Satellite Event: Workshops (ModComp). CEUR Workshop Proceedings, vol. 2019, pp. 10\u201316. CEUR-WS.org (2017)"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Calcagno, C., O\u2019Hearn, P.W., Yang, H.: Local action and abstract separation logic. In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10\u201312 July 2007, Wroclaw, Poland, Proceedings, pp. 366\u2013378. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.30"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Cavalcante, E., Batista, T.V., Oquendo, F.: Supporting dynamic software architectures: from architectural description to implementation. In: Bass, L., Lago, P., Kruchten, P. (eds.) 12th Working IEEE\/IFIP Conference on Software Architecture, WICSA 2015, pp. 31\u201340. IEEE Computer Society (2015)","DOI":"10.1109\/WICSA.2015.21"},{"issue":"4","key":"40_CR14","first-page":"361","volume":"82","author":"D Clarke","year":"2008","unstructured":"Clarke, D.: A basic logic for reasoning about connector reconfiguration. Fundam. Inf. 82(4), 361\u2013390 (2008)","journal-title":"Fundam. Inf."},{"issue":"1","key":"40_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/2480359.2429104","volume":"48","author":"T Dinsdale-Young","year":"2013","unstructured":"Dinsdale-Young, T., Birkedal, L., Gardner, P., Parkinson, M., Yang, H.: Views: compositional reasoning for concurrent programs. SIGPLAN Not. 48(1), 287\u2013300 (2013)","journal-title":"SIGPLAN Not."},{"key":"40_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-14107-2_24","volume-title":"ECOOP 2010 \u2013 Object-Oriented Programming","author":"T Dinsdale-Young","year":"2010","unstructured":"Dinsdale-Young, T., Dodds, M., Gardner, P., Parkinson, M.J., Vafeiadis, V.: Concurrent abstract predicates. In: D\u2019Hondt, T. (ed.) ECOOP 2010. LNCS, vol. 6183, pp. 504\u2013528. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14107-2_24"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-27269-1_12","volume-title":"Formal Aspects of Component Software","author":"J Dormoy","year":"2012","unstructured":"Dormoy, J., Kouchnarenko, O., Lanoix, A.: Using temporal logic for dynamic reconfigurations of components. In: Barbosa, L.S., Lumpe, M. (eds.) FACS 2010. LNCS, vol. 6921, pp. 200\u2013217. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27269-1_12"},{"key":"40_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-79876-5_11","volume-title":"Automated Deduction \u2013 CADE 28","author":"M Echenim","year":"2021","unstructured":"Echenim, M., Iosif, R., Peltier, N.: Unifying decidable entailments in separation logic with inductive definitions. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 183\u2013199. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_11"},{"key":"40_CR19","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s10009-020-00596-7","volume":"23","author":"R El-Ballouli","year":"2021","unstructured":"El-Ballouli, R., Bensalem, S., Bozga, M., Sifakis, J.: Programming dynamic reconfigurable systems. Int. J. Softw. Tools Technol. Transf. 23, 701\u2013719 (2021)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"El-Hokayem, A., Bozga, M., Sifakis, J.: A temporal configuration logic for dynamic reconfigurable systems. In: Hung, C., Hong, J., Bechini, A., Song, E. (eds.) SAC 2021: The 36th ACM\/SIGAPP Symposium on Applied Computing, Virtual Event, Republic of Korea, 22\u201326 March 2021, pp. 1419\u20131428. ACM (2021)","DOI":"10.1145\/3412841.3442017"},{"issue":"POPL","key":"40_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3434286","volume":"5","author":"F Farka","year":"2021","unstructured":"Farka, F., Nanevski, A., Banerjee, A., Delbianco, G.A., F\u00e1bregas, I.: On algebraic abstractions for concurrent separation logics. Proc. ACM Program. Lang. 5(POPL), 1\u201332 (2021)","journal-title":"Proc. ACM Program. Lang."},{"key":"40_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-71316-6_13","volume-title":"Programming Languages and Systems","author":"X Feng","year":"2007","unstructured":"Feng, X., Ferreira, R., Shao, Z.: On the relationship between concurrent separation logic and assume-guarantee reasoning. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 173\u2013188. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_13"},{"issue":"2","key":"40_CR23","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3351452.3351464","volume":"50","author":"K Foerster","year":"2019","unstructured":"Foerster, K., Schmid, S.: Survey of reconfigurable data center networks: enablers, algorithms, complexity. SIGACT News 50(2), 62\u201379 (2019)","journal-title":"SIGACT News"},{"key":"40_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0049-237X(08)71879-2","volume":"107","author":"H Gaifman","year":"1982","unstructured":"Gaifman, H.: On local and non-local properties. Stud. Log. Found. Math. 107, 105\u2013135 (1982)","journal-title":"Stud. Log. Found. Math."},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Gunawi, H.S., et al.: Why does the cloud stop computing? Lessons from hundreds of service outages. In: Proceedings of the Seventh ACM Symposium on Cloud Computing, SoCC 2016, pp. 1\u201316. Association for Computing Machinery, New York (2016)","DOI":"10.1145\/2987550.2987583"},{"key":"40_CR26","doi-asserted-by":"crossref","unstructured":"Hirsch, D., Inverardi, P., Montanari, U.: Graph grammars and constraint solving for software architecture styles. In: Proceedings of the Third International Workshop on Software Architecture, ISAW 1998, pp. 69\u201372. Association for Computing Machinery, New York (1998)","DOI":"10.1145\/288408.288426"},{"key":"40_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-662-54434-1_23","volume-title":"Programming Languages and Systems","author":"C Jansen","year":"2017","unstructured":"Jansen, C., Katelaan, J., Matheja, C., Noll, T., Zuleger, F.: Unified reasoning about robustness properties of symbolic-heap separation logic. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 611\u2013638. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_23"},{"key":"40_CR28","unstructured":"Jones, C.B.: Developing methods for computer programs including a notion of interference. Ph.D. thesis, University of Oxford, UK (1981)"},{"key":"40_CR29","unstructured":"Konnov, I.V., Kotek, T., Wang, Q., Veith, H., Bliudze, S., Sifakis, J.: Parameterized systems in BIP: design and model checking. In: 27th International Conference on Concurrency Theory, CONCUR 2016, volume 59 of LIPIcs, pp. 30:1\u201330:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"40_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2009.10.006","volume":"76","author":"C Krause","year":"2011","unstructured":"Krause, C., Maraikar, Z., Lazovik, A., Arbab, F.: Modeling dynamic reconfigurations in Reo using high-level replacement systems. Sci. Comput. Program. 76, 23\u201336 (2011)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"40_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.entcs.2011.11.011","volume":"279","author":"A Lanoix","year":"2011","unstructured":"Lanoix, A., Dormoy, J., Kouchnarenko, O.: Combining proof and model-checking to validate reconfigurable architectures. Electron. Notes Theor. Comput. Sci. 279(2), 43\u201357 (2011)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"7","key":"40_CR32","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1109\/32.708567","volume":"24","author":"D Le Metayer","year":"1998","unstructured":"Le Metayer, D.: Describing software architecture styles using graph grammars. IEEE Trans. Softw. Eng. 24(7), 521\u2013533 (1998)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"40_CR33","doi-asserted-by":"crossref","unstructured":"Magee, J., Kramer, J.: Dynamic structure in software architectures. In: ACM SIGSOFT Software Engineering Notes, vol. 21, no. 6, pp. 3\u201314. ACM (1996)","DOI":"10.1145\/250707.239104"},{"issue":"1","key":"40_CR34","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jlamp.2016.05.002","volume":"86","author":"A Mavridou","year":"2017","unstructured":"Mavridou, A., Baranov, E., Bliudze, S., Sifakis, J.: Configuration logics: modeling architecture styles. J. Log. Algebr. Meth. Program. 86(1), 2\u201329 (2017)","journal-title":"J. Log. Algebr. Meth. Program."},{"issue":"2","key":"40_CR35","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1109\/COMST.2017.2782753","volume":"20","author":"M Noormohammadpour","year":"2018","unstructured":"Noormohammadpour, M., Raghavendra, C.S.: Datacenter traffic control: understanding techniques and tradeoffs. IEEE Commun. Surv. Tutor. 20(2), 1492\u20131525 (2018)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"1\u20133","key":"40_CR36","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":"40_CR37","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"PW O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P.W., Pym, D.J.: The logic of bunched implications. Bull. Symb. Log. 5(2), 215\u2013244 (1999)","journal-title":"Bull. Symb. Log."},{"key":"40_CR38","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-1-4612-6315-9_12","volume-title":"Programming Methodology","author":"S Owicki","year":"1978","unstructured":"Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. In: Gries, D. (ed.) Programming Methodology. Texts and Monographs in Computer Science, pp. 130\u2013152. Springer, New York (1978). https:\/\/doi.org\/10.1007\/978-1-4612-6315-9_12"},{"key":"40_CR39","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22\u201325 July 2002, Copenhagen, Denmark, pp. 55\u201374. IEEE Computer Society (2002)"},{"key":"40_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-52148-8_13","volume-title":"Automatic Verification Methods for Finite State Systems","author":"Z Shtadler","year":"1990","unstructured":"Shtadler, Z., Grumberg, O.: Network grammars, communication behaviors and automatic verification. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 151\u2013165. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52148-8_13"},{"key":"40_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-46464-8_13","volume-title":"Theory and Application of Graph Transformations","author":"G Taentzer","year":"2000","unstructured":"Taentzer, G., Goedicke, M., Meyer, T.: Dynamic change management by distributed graph transformation: towards configurable distributed systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 179\u2013193. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46464-8_13"},{"key":"40_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-74407-8_18","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"V Vafeiadis","year":"2007","unstructured":"Vafeiadis, V., Parkinson, M.: A marriage of rely\/guarantee and separation logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 256\u2013271. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74407-8_18"},{"issue":"5","key":"40_CR43","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1049\/ip-sen:19982294","volume":"145","author":"M Wermelinger","year":"1998","unstructured":"Wermelinger, M.: Towards a chemical model for software architecture reconfiguration. IEE Proc.-Softw. 145(5), 130\u2013136 (1998)","journal-title":"IEE Proc.-Softw."},{"issue":"2","key":"40_CR44","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6423(02)00036-9","volume":"44","author":"M Wermelinger","year":"2002","unstructured":"Wermelinger, M., Fiadeiro, J.L.: A graph transformation approach to software architecture reconfiguration. Sci. Comput. Program. 44(2), 133\u2013155 (2002)","journal-title":"Sci. Comput. Program."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10769-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T09:32:20Z","timestamp":1727688740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10769-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107689","9783031107696"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10769-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haifa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/FLoC2022\/IJCAR-index.html","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":"85","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":"32","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":"9","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":"38% - 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.2","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.2","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)"}}]}}