{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T05:09:24Z","timestamp":1746508164702,"version":"3.40.3"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030576622"},{"type":"electronic","value":"9783030576639"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-57663-9_1","type":"book-chapter","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T12:15:06Z","timestamp":1597148106000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Teaching Formal Methods: An Experience Report"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6526-2544","authenticated-orcid":false,"given":"Mehrnoosh","family":"Askarpour","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5137-940X","authenticated-orcid":false,"given":"Marcello M.","family":"Bersani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,12]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abrial, J.R.: Teaching formal methods: an experience with event-B (invited speaker\u2019s extended abstract). In: Formal Methods in Computer Science Education, p. 1 (2008)","key":"1_CR1","DOI":"10.1007\/978-3-540-85762-4_1"},{"doi-asserted-by":"crossref","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Larsen, K.G., Srba, J.: Teaching concurrency: theory in practice. In: Proceedings of the Inernational Conference on TFM, pp. 158\u2013175 (2009)","key":"1_CR2","DOI":"10.1007\/978-3-642-04912-5_11"},{"doi-asserted-by":"crossref","unstructured":"Ahrendt, W., Bubel, R., H\u00e4hnle, R.: Integrated and tool-supported teaching of testing, debugging, and verification. In: Proceedings of the International Conference on TFM, pp. 125\u2013143 (2009)","key":"1_CR3","DOI":"10.1007\/978-3-642-04912-5_9"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-030-32441-4_6","volume-title":"Formal Methods Teaching","author":"AA Almeida","year":"2019","unstructured":"Almeida, A.A., Rocha-Oliveira, A.C., Ramos, T.M.F., de Moura, F.L.C., Ayala-Rinc\u00f3n, M.: The computational relevance of formal logic through formal proofs. In: Dongol, B., Petre, L., Smith, G. (eds.) FMTea 2019. LNCS, vol. 11758, pp. 81\u201396. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32441-4_6"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Artho, C., Taguchi, K., Tahara, Y., Honiden, S., Tanabe, Y.: Teaching software model checking. In: Workshop on Formal Methods in Computer Science Education, pp. 171\u2013179 (2008)","key":"1_CR6"},{"unstructured":"Back, R.J., Mannila, L., Peltomaki, M., Sibelius, P.: Structured derivations: a logic based approach to teaching mathematics. In: FORMED 2008: Formal Methods in Computer Science Education (2008)","key":"1_CR7"},{"unstructured":"Back, R.J., Von Wright, J., et al.: Structured derivations: a method for doing high-school mathematics carefully. In: Turku Centre for Computer Science (1999)","key":"1_CR8"},{"unstructured":"Boh\u00f3rquez, J., Rocha, C.: Assisted calculational proofs and proof checking based on partial orders. In: Formal Methods in Computer Science Education, p. 37 (2008)","key":"1_CR9"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-30472-2_5","volume-title":"Teaching Formal Methods","author":"E B\u00f6rger","year":"2004","unstructured":"B\u00f6rger, E.: A practice-oriented course on the principles of computation, programming, and system design and analysis. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 65\u201384. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_5"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/1595453.1595458","volume":"41","author":"R Boute","year":"2009","unstructured":"Boute, R.: Teaching and practicing computer science at the university level. ACM SIGCSE Bull. 41(2), 24\u201330 (2009)","journal-title":"ACM SIGCSE Bull."},{"unstructured":"Boyatt, R., Sinclair, J.: Experiences of teaching a lightweight formal method. In: Proceedings of Formal Methods in Computer Science Education (2008)","key":"1_CR12"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-30472-2_6","volume-title":"Teaching Formal Methods","author":"M Carro","year":"2004","unstructured":"Carro, M., Mari\u00f1o, J., Herranz, \u00c1., Moreno-Navarro, J.J.: Teaching how to derive correct concurrent programs from state-based specifications and code patterns. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 85\u2013106. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_6"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-030-32441-4_14","volume-title":"Formal Methods Teaching","author":"N Cata\u00f1o","year":"2019","unstructured":"Cata\u00f1o, N.: Teaching formal methods: Lessons learnt from using event-B. In: Dongol, B., Petre, L., Smith, G. (eds.) FMTea 2019. LNCS, vol. 11758, pp. 212\u2013227. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32441-4_14"},{"unstructured":"Dadeau, F., Tissot, R.: Teaching model-based testing with Leirios test generator (2008)","key":"1_CR15"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-30472-2_12","volume-title":"Teaching Formal Methods","author":"J Davies","year":"2004","unstructured":"Davies, J., Simpson, A., Martin, A.: Teaching formal methods in context. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 185\u2013202. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_12"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-30472-2_8","volume-title":"Teaching Formal Methods","author":"R Duke","year":"2004","unstructured":"Duke, R., Miller, T., Strooper, P.: Integrating formal specification and software verification and validation. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 124\u2013139. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_8"},{"unstructured":"FBK-IRST, group at Carnegie Mellon University, T.M.C., the Mechanized Reasoning Group at University of Genova, at University of Trento, T.M.R.G.: NuSMV (2015). http:\/\/nusmv.fbk.eu\/","key":"1_CR18"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-30472-2_10","volume-title":"Teaching Formal Methods","author":"MJ Fern\u00e1ndez-Iglesias","year":"2004","unstructured":"Fern\u00e1ndez-Iglesias, M.J., Llamas-Nistal, M.: An undergraduate course on protocol engineering \u2013 how to teach formal methods without scaring students. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 153\u2013165. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_10"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-04912-5_4","volume-title":"Teaching Formal Methods","author":"JF Ferreira","year":"2009","unstructured":"Ferreira, J.F., Mendes, A., Backhouse, R., Barbosa, L.S.: Which mathematics for the information society? In: Gibbons, J., Oliveira, J.N. (eds.) TFM 2009. LNCS, vol. 5846, pp. 39\u201356. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04912-5_4"},{"unstructured":"Filippidis, I.: A catalog of tools for verification and synthesis. github.com\/fm-tools","key":"1_CR21"},{"doi-asserted-by":"crossref","unstructured":"Furia, C.A., Mandrioli, D., Morzenti, A., Rossi, M.: Modeling time in computing: a taxonomy and a comparative survey. ACM Comput. Surv. 42(2), 6:1\u20136:59 (2010)","key":"1_CR22","DOI":"10.1145\/1667062.1667063"},{"unstructured":"Garavel, H., Jorgensen, M.: A catalog of tools for the quantitative zoo. http:\/\/cadp.inria.fr\/faq.html","key":"1_CR23"},{"unstructured":"Gibson, J.P., Lallet, E., Raffy, J.L.: How do i know if my design is correct. In: Formal Methods in Computer Science Education, pp. 61\u201370 (2008)","key":"1_CR24"},{"doi-asserted-by":"crossref","unstructured":"Gibson, P., M\u00e9ry, D.: Teaching formal methods: lessons to learn. In: 2nd Irish Workshop on Formal Methods, vol. 2, pp. 1\u201313 (1998)","key":"1_CR25","DOI":"10.14236\/ewic\/FM1998.4"},{"unstructured":"Guyomard, M.: Eb: A constructive approach for the teaching of data structures. In: Formal Methods in Computer Science Education, p. 25 (2008)","key":"1_CR26"},{"unstructured":"Habrias, H.: Teaching specifications, hands on. In: Formal Methods in Computer Science Education, pp. 5\u201315 (2008)","key":"1_CR27"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-30472-2_11","volume-title":"Teaching Formal Methods","author":"H Habrias","year":"2004","unstructured":"Habrias, H., Faucou, S.: Linking paradigms, semi-formal and formal notations. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 166\u2013184. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_11"},{"unstructured":"H\u00e4hnle, R., Bubel, R.: A Hoare-style calculus with explicit state updates. In: Formal Methods in Computer Science Education, pp. 49\u201360 (2008)","key":"1_CR29"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-04912-5_8","volume-title":"Teaching Formal Methods","author":"S Hallerstede","year":"2009","unstructured":"Hallerstede, S., Leuschel, M.: How to explain mistakes. In: Gibbons, J., Oliveira, J.N. (eds.) TFM 2009. LNCS, vol. 5846, pp. 105\u2013124. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04912-5_8"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-60675-0_50","volume-title":"Funtional Programming Languages in Education","author":"PH Hartel","year":"1995","unstructured":"Hartel, P.H., van Es, B., Tromp, D.: Basic proof skills of computer science students. In: Hartel, P.H., Plasmeijer, R. (eds.) FPLE 1995. LNCS, vol. 1022, pp. 269\u2013283. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60675-0_50"},{"unstructured":"Jard, C.: Teaching distributed algorithms using spin. In: Formal Methods in Computer Science Education, p. 101 (2008)","key":"1_CR32"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-04912-5_10","volume-title":"Teaching Formal Methods","author":"J Kofro\u0148","year":"2009","unstructured":"Kofro\u0148, J., Par\u00edzek, P., \u0160er\u00fd, O.: On teaching formal methods: behavior models and code analysis. In: Gibbons, J., Oliveira, J.N. (eds.) TFM 2009. LNCS, vol. 5846, pp. 144\u2013157. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04912-5_10"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-04912-5_1","volume-title":"Teaching Formal Methods","author":"J Kramer","year":"2009","unstructured":"Kramer, J.: Abstraction and modelling: A complementary partnership. In: Gibbons, J., Oliveira, J.N. (eds.) TFM 2009. LNCS, vol. 5846, pp. 1\u20131. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04912-5_1"},{"doi-asserted-by":"crossref","unstructured":"Lau, K.: A beginner\u2019s course on reasoning about imperative programs. In: Proceedings of CoLogNET\/FME Symposium on TFM, pp. 1\u201316 (2004)","key":"1_CR35","DOI":"10.1007\/978-3-540-30472-2_1"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30472-2_1","volume-title":"Teaching Formal Methods","author":"K-K Lau","year":"2004","unstructured":"Lau, K.-K.: A beginner\u2019s course on reasoning about imperative programs. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 1\u201316. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_1"},{"unstructured":"Anderson, L.W., Krathwohl, D.R., Bloom, B.S.: A taxonomy for learning, teaching, and assessing: A revision of Bloom\u2019s taxonomy of educational objectives (2001)","key":"1_CR37"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-30472-2_14","volume-title":"Teaching Formal Methods","author":"D Mandrioli","year":"2004","unstructured":"Mandrioli, D.: Advertising formal methods and organizing their teaching: Yes, but. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 214\u2013224. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_14"},{"key":"1_CR39","volume-title":"Theoretical Foundations of Computer Science","author":"D Mandrioli","year":"1987","unstructured":"Mandrioli, D., Ghezzi, C.: Theoretical Foundations of Computer Science. John Wiley & Sons, New York (1987)"},{"unstructured":"Naumowicz, A.: Teaching how to write a proof. In: Formal Methods in Computer Science Education, p. 91 (2008)","key":"1_CR40"},{"unstructured":"Noble, J., Pearce, D.J., Groves, L.: Introducing alloy in a software modelling course. In: Formal Methods in Computer Science Education, p. 81 (2008)","key":"1_CR41"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-04912-5_3","volume-title":"Teaching Formal Methods","author":"PC \u00d6lveczky","year":"2009","unstructured":"\u00d6lveczky, P.C.: Teaching formal methods based on rewriting logic and maude. In: Gibbons, J., Oliveira, J.N. (eds.) TFM 2009. LNCS, vol. 5846, pp. 20\u201338. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04912-5_3"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-30472-2_7","volume-title":"Teaching Formal Methods","author":"RF Paige","year":"2004","unstructured":"Paige, R.F., Ostroff, J.S.: Specification-driven design with eiffel and agents for teaching lightweight formal methods. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 107\u2013123. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_7"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-04912-5_7","volume-title":"Teaching Formal Methods","author":"E Poll","year":"2009","unstructured":"Poll, E.: Teaching program specification and verification using JML and ESC\/Java2. In: Gibbons, J., Oliveira, J.N. (eds.) TFM 2009. LNCS, vol. 5846, pp. 92\u2013104. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04912-5_7"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-30472-2_3","volume-title":"Teaching Formal Methods","author":"JN Reed","year":"2004","unstructured":"Reed, J.N., Sinclair, J.E.: Motivating study of formal methods in the classroom. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 32\u201346. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_3"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-30472-2_13","volume-title":"Teaching Formal Methods","author":"K Robinson","year":"2004","unstructured":"Robinson, K.: Embedding formal development in software engineering. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 203\u2013213. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_13"},{"unstructured":"Robinson, K.: Reflecting on the future: Objectives, strategies and experiences. In: Formal Methods in Computer Science Education, p. 15 (2008)","key":"1_CR47"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-30472-2_2","volume-title":"Teaching Formal Methods","author":"S da Rosa","year":"2004","unstructured":"da Rosa, S.: Designing algorithms in high school mathematics. In: Dean, C.N., Boute, R.T. (eds.) TFM 2004. LNCS, vol. 3294, pp. 17\u201331. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30472-2_2"},{"doi-asserted-by":"crossref","unstructured":"Schwartz, B.: The Paradox of Choice (2004)","key":"1_CR49","DOI":"10.1037\/e597322010-001"},{"unstructured":"Simonot, M., Homps, M., Bonnot, P.: Teaching abstraction in mathematics and computer science (2012)","key":"1_CR50"},{"unstructured":"Simonot, M., Homps, M., Bonnot, P.: Teaching abstraction in mathematics and computer science - A computer-supported approach with alloy. In: Proceedings of the 4th International Conference on Computer Supported Education, vol. 2, pp. 239\u2013245 (2012)","key":"1_CR51"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-319-50230-4_18","volume-title":"Software Technologies: Applications and Foundations","author":"M Spichkova","year":"2016","unstructured":"Spichkova, M.: \u201cBoring formal methods\" or \u201cSherlock Holmes deduction methods\"? In: Milazzo, P., Varr\u00f3, D., Wimmer, M. (eds.) STAF 2016. LNCS, vol. 9946, pp. 242\u2013252. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50230-4_18"},{"doi-asserted-by":"crossref","unstructured":"Spichkova, M., Zamansky, A.: Teaching of formal methods for software engineering. In: ENASE, pp. 370\u2013376 (2016)","key":"1_CR53","DOI":"10.5220\/0005928503700376"},{"key":"1_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-10431-7_27","volume-title":"Software Engineering and Formal Methods","author":"T Sznuk","year":"2014","unstructured":"Sznuk, T., Schubert, A.: Tool support for teaching Hoare logic. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 332\u2013346. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10431-7_27"},{"key":"1_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-04912-5_6","volume-title":"Teaching Formal Methods","author":"S Tarkan","year":"2009","unstructured":"Tarkan, S., Sazawal, V.: Chief chefs of Z to alloy: using a kitchen example to teach alloy with Z. In: Gibbons, J., Oliveira, J.N. (eds.) TFM 2009. LNCS, vol. 5846, pp. 72\u201391. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04912-5_6"},{"unstructured":"University of Torino: GreatSPN: Graphical editor and analyzer for timed and stochastic petri nets (2001). http:\/\/www.di.unito.it\/greatspn\/index.html","key":"1_CR56"},{"unstructured":"Department of Information Technology at Uppsala University, Sweden, the Department of Computer Science at Aalborg University in Denmark: Uppaal (2008). http:\/\/www.uppaal.org\/","key":"1_CR57"},{"doi-asserted-by":"crossref","unstructured":"Woodcock, J., Larsen, P.G., Bicarregui, J., Fitzgerald, J.: Formal methods: Practice and experience. ACM Comput. Surv. 41(4) (2009)","key":"1_CR58","DOI":"10.1145\/1592434.1592436"},{"unstructured":"Zot: A bounded satisfiability checker (2012). github.com\/fm-polimi\/zot","key":"1_CR59"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Software Engineering Education"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57663-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,6]],"date-time":"2022-11-06T14:22:06Z","timestamp":1667744526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-57663-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030576622","9783030576639"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57663-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"12 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FISEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Software Engineering Education","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Villebrumier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"11 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fisee2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.laser-foundation.org\/fisee\/fisee-2019\/","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":"26","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":"25","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":"96% - 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":"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":"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)"}},{"value":"Papers were invited; 3 papers stem from an associated TOOLS Workshop: Artificial and Natural Tools (ANT)","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)"}}]}}