{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:23:52Z","timestamp":1743081832672,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549961"},{"type":"electronic","value":"9783030549978"}],"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-54997-8_13","type":"book-chapter","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:11:50Z","timestamp":1597090310000},"page":"200-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Open and Interactive Learning Resources for Algorithmic Problem Solving"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o F.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"Alexandra","family":"Mendes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"13_CR1","volume-title":"Algorithmic Problem Solving","author":"R Backhouse","year":"2011","unstructured":"Backhouse, R.: Algorithmic Problem Solving. Wiley, New York (2011)"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.scico.2010.05.006","volume":"76","author":"R Backhouse","year":"2011","unstructured":"Backhouse, R., Ferreira, J.F.: On Euclid\u2019s algorithm and elementary number theory. Sci. Comput. Programm. 76(3), 160\u2013180 (2011). \nhttps:\/\/doi.org\/10.1016\/j.scico.2010.05.006","journal-title":"Sci. Comput. Programm."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-70594-9_6","volume-title":"Mathematics of Program Construction","author":"R Backhouse","year":"2008","unstructured":"Backhouse, R., Ferreira, J.F.: Recounting the rationals: twice!. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol. 5133, pp. 79\u201391. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70594-9_6"},{"key":"13_CR4","volume-title":"Teaching for Quality Learning at University: What the Student does (Society for Research Into Higher Education)","author":"J Biggs","year":"2011","unstructured":"Biggs, J., Tang, C.: Teaching for Quality Learning at University: What the Student does (Society for Research Into Higher Education), 4th edn. Open Univ. Press, Buckingham (2011)","edition":"4"},{"key":"13_CR5","first-page":"7","volume":"3","author":"AW Chickering","year":"1987","unstructured":"Chickering, A.W., Gamson, Z.F.: Seven principles for good practice in undergraduate education. AAHE Bull. 3, 7 (1987)","journal-title":"AAHE Bull."},{"key":"13_CR6","unstructured":"Dijkstra, E.W.: Pruning the search tree, January 1997. \nhttp:\/\/www.cs.utexas.edu\/users\/EWD\/ewd12xx\/EWD1255.PDF"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-13321-3_10","volume-title":"Mathematics of Program Construction","author":"JF Ferreira","year":"2010","unstructured":"Ferreira, J.F.: Designing an algorithmic proof of the two-squares theorem. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol. 6120, pp. 140\u2013156. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13321-3_10"},{"key":"13_CR8","unstructured":"Ferreira, J.F.: Principles and applications of algorithmic problem solving. Ph.D. thesis, School of Computer Science, University of Nottingham (2010)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Ferreira, J.F., Mendes, A.: Students\u2019 feedback on teaching mathematics through the calculational method. In: 2009 39th IEEE Frontiers in Education Conference, pp. 1\u20136. IEEE (2009)","DOI":"10.1109\/FIE.2009.5350478"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Ferreira, J.F., Mendes, A.: The magic of algorithm design and analysis: teaching algorithmic skills using magic card tricks. In: ACM ITiCSE (2014)","DOI":"10.1145\/2591708.2591745"},{"key":"13_CR11","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04912-5_4"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-21350-2_8","volume-title":"Tools for Teaching Logic","author":"J Ferreira","year":"2011","unstructured":"Ferreira, J., et al.: Logic training through algorithmic problem solving. In: Blackburn, P., van Ditmarsch, H., Manzano, M., Soler-Toscano, F. (eds.) TICTTL 2011. LNCS (LNAI), vol. 6680, pp. 62\u201369. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21350-2_8"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-32441-4_1","volume-title":"Formal Methods Teaching","author":"T Hoare","year":"2019","unstructured":"Hoare, T., Mendes, A., Ferreira, J.F.: Logic, algebra, and geometry at the foundation of computer science. In: Dongol, B., Petre, L., Smith, G. (eds.) FMTea 2019. LNCS, vol. 11758, pp. 3\u201320. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-32441-4_1"},{"key":"13_CR14","unstructured":"Mendes, A.: Structured editing of handwritten mathematics. Ph.D. thesis, School of Computer Science, University of Nottingham, UK (2012)"},{"key":"13_CR15","unstructured":"Mendes, A., Backhouse, R., Ferreira, J.F.: Structure editing of handwritten mathematics: improving the computer support for the calculational method. In: ACM ITS (2014). \nhttp:\/\/doi.acm.org\/10.1145\/2669485.2669495"}],"container-title":["Lecture Notes in Computer Science","Formal Methods. FM 2019 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54997-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:16:48Z","timestamp":1597090608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-54997-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549961","9783030549978"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54997-8_13","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":"11 August 2020","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\/?page_id=84","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)"}}]}}