{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:22:31Z","timestamp":1773840151243,"version":"3.50.1"},"publisher-location":"Cham","reference-count":48,"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_7","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"83-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["GR(1)*: GR(1) Specifications Extended with Existential Guarantees"],"prefix":"10.1007","author":[{"given":"Gal","family":"Amram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahar","family":"Maoz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Or","family":"Pistiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"7_CR1","unstructured":"Alexander, I.F., Maiden, N.: Scenarios, Stories, Use Cases: Through the Systems Development Life-Cycle. 1st edn. Wiley Publishing (2004)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-28872-2_26","volume-title":"Fundamental Approaches to Software Engineering","author":"D Alrajeh","year":"2012","unstructured":"Alrajeh, D., Kramer, J., Russo, A., Uchitel, S.: Learning from vacuously satisfiable scenario-based specifications. In: de Lara, J., Zisman, A. (eds.) FASE 2012. LNCS, vol. 7212, pp. 377\u2013393. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-28872-2_26"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.jal.2008.10.002","volume":"7","author":"D Alrajeh","year":"2009","unstructured":"Alrajeh, D., Ray, O., Russo, A., Uchitel, S.: Using abduction and induction for operational requirements elaboration. J. Appl. Logic 7(3), 275\u2013288 (2009)","journal-title":"J. Appl. Logic"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Alur, R., Moarref, S., Topcu, U.: Counter-strategy guided refinement of GR(1) temporal logic specifications. In: Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, 20\u201323 October 2013, pp. 26\u201333. IEEE (2013). \nhttps:\/\/doi.org\/10.1109\/FMCAD.2013.6679387","DOI":"10.1109\/FMCAD.2013.6679387"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-319-24953-7_29","volume-title":"Automated Technology for Verification and Analysis","author":"R Bloem","year":"2015","unstructured":"Bloem, R., Ehlers, R., K\u00f6nighofer, R.: Cooperative reactive synthesis. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 394\u2013410. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24953-7_29"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2011.08.007","DOI":"10.1016\/j.jcss.2011.08.007"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Bloem, R., Schewe, S., Khalimov, A.: CTL* synthesis via LTL synthesis. In: Proceedings Sixth Workshop on Synthesis, SYNT@CAV 2017, Heidelberg, Germany, 22 July 2017, pp. 4\u201322 (2017). \nhttps:\/\/doi.org\/10.4204\/EPTCS.260.4","DOI":"10.4204\/EPTCS.260.4"},{"issue":"1\u20132","key":"7_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(96)00228-9","volume":"178","author":"A Browne","year":"1997","unstructured":"Browne, A., Clarke, E.M., Jha, S., Long, D.E., Marrero, W.R.: An improved algorithm for the evaluation of fixpoint expressions. Theor. Comput. Sci. 178(1\u20132), 237\u2013255 (1997). \nhttps:\/\/doi.org\/10.1016\/S0304-3975(96)00228-9","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"7_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). \nhttps:\/\/doi.org\/10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-54577-5_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"DG Cavezza","year":"2017","unstructured":"Cavezza, D.G., Alrajeh, D.: Interpolation-based GR(1) assumptions refinement. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 281\u2013297. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54577-5_16"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-78163-9_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Cimatti","year":"2008","unstructured":"Cimatti, A., Roveri, M., Schuppan, V., Tchaltsev, A.: Diagnostic information for realizability. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 52\u201367. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78163-9_9"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982). \nhttps:\/\/doi.org\/10.1007\/BFb0025774"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2430536.2430543","volume":"22","author":"N D\u2019Ippolito","year":"2013","unstructured":"D\u2019Ippolito, N., Braberman, V.A., Piterman, N., Uchitel, S.: Synthesizing nonanomalous event-based controllers for liveness goals. ACM Trans. Softw. Eng. Methodol. 22(1), 9 (2013). \nhttps:\/\/doi.org\/10.1145\/2430536.2430543","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: ICSE, pp. 411\u2013420. ACM (1999)","DOI":"10.1145\/302405.302672"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Ehlers, R., K\u00f6nighofer, R., Bloem, R.: Synthesizing cooperative reactive mission plans. In: 2015 IEEE\/RSJ International Conference on Intelligent Robots and Systems, IROS 2015, Hamburg, Germany, 28 September - 2 October 2015, pp. 3478\u20133485. IEEE (2015). \nhttps:\/\/doi.org\/10.1109\/IROS.2015.7353862","DOI":"10.1109\/IROS.2015.7353862"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"EA Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201csometimes\u201d and \u201cnot never\u201d revisited: on branching versus linear time temporal logic. J. ACM 33(1), 151\u2013178 (1986). \nhttps:\/\/doi.org\/10.1145\/4904.4999","journal-title":"J. ACM"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Filippidis, I., Dathathri, S., Livingston, S.C., Ozay, N., Murray, R.M.: Control design for hybrid systems with tulip: the temporal logic planning toolbox. In: 2016 IEEE Conference on Control Applications, CCA 2016, Buenos Aires, Argentina, 19\u201322 September 2016, pp. 1030\u20131041. IEEE (2016). \nhttps:\/\/doi.org\/10.1109\/CCA.2016.7587949","DOI":"10.1109\/CCA.2016.7587949"},{"issue":"01","key":"7_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129054102000935","volume":"13","author":"D Harel","year":"2002","unstructured":"Harel, D., Kugler, H.: Synthesizing state-based object systems from LSC specifications. Int. J. Found. Comput. Sci. 13(01), 5\u201351 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR19","volume-title":"Object-Oriented Software Engineering: A Use Case Driven Approach","author":"I Jacobson","year":"2004","unstructured":"Jacobson, I.: Object-Oriented Software Engineering: A Use Case Driven Approach. Addison Wesley Longman Publishing Co. Inc, Redwood City (2004)"},{"key":"7_CR20","unstructured":"Kesten, Y., Piterman, N., Pnueli, A.: Bridging the gap between fair simulation and trace inclusion. Inf. Comput. 200(1), 35\u201361 (2005). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540105000234"},{"issue":"5\u20136","key":"7_CR21","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10009-011-0221-y","volume":"15","author":"R K\u00f6nighofer","year":"2013","unstructured":"K\u00f6nighofer, R., Hofferek, G., Bloem, R.: Debugging formal specifications: a practical approach using model-based diagnosis and counterstrategies. STTT 15(5\u20136), 563\u2013583 (2013). \nhttps:\/\/doi.org\/10.1007\/s10009-011-0221-y","journal-title":"STTT"},{"key":"7_CR22","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$-calculus. In: Proceedings of the 9th Colloquium on Automata, Languages and Programming, pp. 348\u2013359. Springer, London (1982). \nhttp:\/\/dl.acm.org\/citation.cfm?id=646236.682866"},{"issue":"6","key":"7_CR23","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1109\/TRO.2009.2030225","volume":"25","author":"H Kress-Gazit","year":"2009","unstructured":"Kress-Gazit, H., Fainekos, G.E., Pappas, G.J.: Temporal-logic-based reactive mission and motion planning. IEEE Trans. Robot. 25(6), 1370\u20131381 (2009). \nhttps:\/\/doi.org\/10.1109\/TRO.2009.2030225","journal-title":"IEEE Trans. Robot."},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-31980-1_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Kugler","year":"2005","unstructured":"Kugler, H., Harel, D., Pnueli, A., Lu, Y., Bontemps, Y.: Temporal logic for scenario-based specifications. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 445\u2013460. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31980-1_29"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-94-015-9586-5_6","volume-title":"Advances in Temporal Logic","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesis with incomplete information. In: Barringer, H., Fisher, M., Gabbay, D., Gough, G. (eds.) Advances in Temporal Logic, vol. 16, pp. 109\u2013127. Springer, Dordrecht (2000). \nhttps:\/\/doi.org\/10.1007\/978-94-015-9586-5_6"},{"key":"7_CR26","unstructured":"Majumdar, R., Piterman, N., Schmuck, A.: Environmentally-friendly GR(1) synthesis. CoRR abs\/1902.05629 (2019). \nhttp:\/\/arxiv.org\/abs\/1902.05629"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Maniatopoulos, S., Schillinger, P., Pong, V., Conner, D.C., Kress-Gazit, H.: Reactive high-level behavior synthesis for an atlas humanoid robot. In: Kragic, D., Bicchi, A., Luca, A.D. (eds.) 2016 IEEE International Conference on Robotics and Automation, ICRA 2016, Stockholm, Sweden, 16\u201321 May 2016, pp. 4192\u20134199. IEEE (2016). \nhttps:\/\/doi.org\/10.1109\/ICRA.2016.7487613","DOI":"10.1109\/ICRA.2016.7487613"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Maoz, S., Ringert, J.O.: GR(1) synthesis for LTL specification patterns. In: ESEC\/FSE, pp. 96\u2013106. ACM (2015). \nhttps:\/\/doi.org\/10.1145\/2786805.2786824","DOI":"10.1145\/2786805.2786824"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Maoz, S., Ringert, J.O.: On well-separation of GR(1) specifications. In: Zimmermann, T., Cleland-Huang, J., Su, Z. (eds.) Proceedings of the 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2016, Seattle, WA, USA, 13\u201318 November 2016, pp. 362\u2013372. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2950290.2950300","DOI":"10.1145\/2950290.2950300"},{"key":"7_CR30","unstructured":"Maoz, S., Ringert, J.O.: Spectra: a specification language for reactive systems. CoRR abs\/1904.06668 (2019). \nhttp:\/\/arxiv.org\/abs\/1904.06668"},{"key":"7_CR31","unstructured":"Maoz, S., Ringert, J.O., Shalom, R.: Symbolic repairs for GR(1) specifications. In: Mussbacher, G., Atlee, J.M., Bultan, T. (eds.) Proceedings of the 41st International Conference on Software Engineering, ICSE 2019, Montreal, QC, Canada, 25\u201331 May 2019, pp. 1016\u20131026. IEEE\/ACM (2019). \nhttps:\/\/dl.acm.org\/citation.cfm?id=3339632"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Maoz, S., Sa\u2019ar, Y.: AspectLTL: an aspect language for LTL specifications. In: AOSD, pp. 19\u201330. ACM (2011). \nhttps:\/\/doi.org\/10.1145\/1960275.1960280","DOI":"10.1145\/1960275.1960280"},{"key":"7_CR33","series-title":"MODELS 2012 LNCS","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-33666-9_22","volume-title":"Model Driven Engineering Languages and Systems","author":"S Maoz","year":"2012","unstructured":"Maoz, S., Sa\u2019ar, Y.: Assume-guarantee scenarios: semantics and synthesis. In: France, R.B., Kazmeier, J., Breu, R., Atkinson, C. (eds.) Model Driven Engineering Languages and Systems. MODELS 2012 LNCS, vol. 7590, pp. 335\u2013351. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33666-9_22"},{"key":"7_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11609773_24","volume-title":"Verification, Model Checking, and Abstract Interpretation VMCAI 2006","author":"N Piterman","year":"2005","unstructured":"Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive (1) designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) Verification, Model Checking, and Abstract Interpretation VMCAI 2006. LNCS, vol. 3855, pp. 364\u2013380. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11609773_24"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October \u2013 1 November 1977, pp. 46\u201357. IEEE Computer Society (1977). \nhttps:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"key":"7_CR37","unstructured":"Pohl, K.: Requirements Engineering: Fundamentals, Principles, and Techniques, 1st edn. Springer Publishing Company, Incorporated (2010)"},{"key":"7_CR38","unstructured":"Rosner, R.: Modular synthesis of reactive systems. Ph.D. thesis, Weizmann Institute of Science (1992)"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Sibay, G., Uchitel, S., Braberman, V.: Existential live sequence charts revisited. In: Proceedings of the 30th international conference on Software engineering, pp. 41\u201350. ACM (2008)","DOI":"10.1145\/1368088.1368095"},{"issue":"7","key":"7_CR40","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1109\/TSE.2012.62","volume":"39","author":"GE Sibay","year":"2013","unstructured":"Sibay, G.E., Braberman, V., Uchitel, S., Kramer, J.: Synthesizing modal transition systems from triggered scenarios. IEEE Trans. Softw. Eng. 39(7), 975\u20131001 (2013)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR41","unstructured":"Somenzi, F.: CUDD: CU Decision Diagram Package Release 3.0.0 (2015). \nhttp:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/cudd.pdf"},{"issue":"12","key":"7_CR42","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1109\/32.738340","volume":"24","author":"AG Sutcliffe","year":"1998","unstructured":"Sutcliffe, A.G., Maiden, N.A., Minocha, S., Manuel, D.: Supporting scenario-based requirements engineering. IEEE Trans. Softw. Eng. 24(12), 1072\u20131088 (1998)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"7_CR43","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955). \nhttps:\/\/doi.org\/10.2140\/pjm.1955.5.285","journal-title":"Pac. J. Math."},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Uchitel, S., Brunet, G., Chechik, M.: Behaviour model synthesis from properties and scenarios. In: Proceedings of the 29th international conference on Software Engineering, pp. 34\u201343. IEEE Computer Society (2007)","DOI":"10.1109\/ICSE.2007.21"},{"issue":"3","key":"7_CR45","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TSE.2008.107","volume":"35","author":"S Uchitel","year":"2009","unstructured":"Uchitel, S., Brunet, G., Chechik, M.: Synthesis of partial behavior models from properties and scenarios. IEEE Trans. Softw. Eng. 35(3), 384\u2013406 (2009)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR46","doi-asserted-by":"publisher","unstructured":"Walker, A., Ryzhyk, L.: Predicate abstraction for reactive synthesis. In: Formal Methods in Computer-Aided Design, FMCAD 2014, Lausanne, Switzerland, 21\u201324 October 2014, pp. 219\u2013226. IEEE (2014). \nhttps:\/\/doi.org\/10.1109\/FMCAD.2014.6987617","DOI":"10.1109\/FMCAD.2014.6987617"},{"issue":"5","key":"7_CR47","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1109\/MS.2005.134","volume":"22","author":"K Zachos","year":"2005","unstructured":"Zachos, K., Maiden, N., Tosar, A.: Rich-media scenarios for discovering requirements. IEEE Softw. 22(5), 89\u201397 (2005)","journal-title":"IEEE Softw."},{"key":"7_CR48","unstructured":"Spectra Website. \nhttp:\/\/smlab.cs.tau.ac.il\/syntech\/spectra\/"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T06:06:51Z","timestamp":1588658811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30942-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030309411","9783030309428"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30942-8_7","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)"}}]}}