{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:09:45Z","timestamp":1743109785072,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030853143"},{"type":"electronic","value":"9783030853150"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85315-0_18","type":"book-chapter","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T12:05:42Z","timestamp":1629374742000},"page":"314-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["AlCons : Deductive Synthesis of Sorting Algorithms in Theorema"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4686-2864","authenticated-orcid":false,"given":"Isabela","family":"Dr\u0103mnesc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2247-2151","authenticated-orcid":false,"given":"Tudor","family":"Jebelean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00288643","volume":"13","author":"DR Barstow","year":"1980","unstructured":"Barstow, D.R.: Remarks on \u201cA synthesis of several sorting algorithms\u2019\u2019 by John Darlington. Acta Inf. 13, 225\u2013227 (1980)","journal-title":"Acta Inf."},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1305\/ndjfl\/1093634995","volume":"30","author":"WD Blizard","year":"1989","unstructured":"Blizard, W.D.: Multiset theory. Notre Dame J. Formal Log. 30(1), 36\u201366 (1989). https:\/\/doi.org\/10.1305\/ndjfl\/1093634995","journal-title":"Notre Dame J. Formal Log."},{"issue":"2","key":"18_CR3","first-page":"9","volume":"XXXVIII","author":"B Buchberger","year":"2000","unstructured":"Buchberger, B.: Theory exploration with Theorema. Analele Univ. Din Timisoara Ser. Mat.-Inf. XXXVIII(2), 9\u201332 (2000)","journal-title":"Analele Univ. Din Timisoara Ser. Mat.-Inf."},{"key":"18_CR4","first-page":"41","volume":"XLI","author":"B Buchberger","year":"2003","unstructured":"Buchberger, B.: Algorithm invention and verification by lazy thinking. Analele Univ. din Timisoara Ser. Mat. - Inf. XLI, 41\u201370 (2003)","journal-title":"Analele Univ. din Timisoara Ser. Mat. - Inf."},{"key":"18_CR5","unstructured":"Buchberger, B., Craciun, A.: Algorithm synthesis by lazy thinking: Using problem schemes. In: Proceedings of SYNASC 2004, pp. 90\u2013106 (2004)"},{"key":"18_CR6","unstructured":"Buchberger, B., et al.: The Theorema project: A progress report. In: Calculemus 2000, pp. 98\u2013113. A.K. Peters, Natick (2000)"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.6092\/issn.1972-5787\/4568","volume":"9","author":"B Buchberger","year":"2016","unstructured":"Buchberger, B., Jebelean, T., Kutsia, T., Maletzky, A., Windsteiger, W.: Theorema 2.0: Computer-assisted natural-style mathematics. J. Formal. Reason. 9(1), 149\u2013185 (2016). https:\/\/doi.org\/10.6092\/issn.1972-5787\/4568","journal-title":"J. Formal. Reason."},{"key":"18_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543326","volume-title":"Rippling: Meta-level Guidance for Mathematical Reasoning","author":"A Bundy","year":"2005","unstructured":"Bundy, A., Basin, D., Hutter, D., Ireland, A.: Rippling: Meta-level Guidance for Mathematical Reasoning. Cambridge University Press, Cambridge (2005)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2005.08.003","volume":"153","author":"A Bundy","year":"2006","unstructured":"Bundy, A., Dixon, L., Gow, J., Fleuriot, J.: Constructing induction rules for deductive synthesis proofs. Electron. Notes Theor. Comput. Sci. 153, 3\u201321 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2005.08.003","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00264597","volume":"11","author":"J Darlington","year":"1978","unstructured":"Darlington, J.: A synthesis of several sorting algorithms. Acta Inf. 11, 1\u201330 (1978)","journal-title":"Acta Inf."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jsc.2014.09.030","volume":"68","author":"I Dramnesc","year":"2015","unstructured":"Dramnesc, I., Jebelean, T.: Synthesis of list algorithms by mechanical proving. J. Symb. Comput. 68, 61\u201392 (2015). https:\/\/doi.org\/10.1016\/j.jsc.2014.09.030","journal-title":"J. Symb. Comput."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-030-43120-4_13","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"I Dr\u0103mnesc","year":"2020","unstructured":"Dr\u0103mnesc, I., Jebelean, T.: Automatic synthesis of merging and inserting algorithms on binary trees using multisets in Theorema. In: Slamanig, D., Tsigaridas, E., Zafeirakopoulos, Z. (eds.) MACIS 2019. LNCS, vol. 11989, pp. 153\u2013168. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43120-4_13"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T.: Proof-based synthesis of sorting algorithms using multisets in Theorema. In: FROM 2019, pp. 76\u201391. EPTCS 303 (2019). https:\/\/doi.org\/10.4204\/EPTCS.303.6","DOI":"10.4204\/EPTCS.303.6"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T.: Deductive synthesis of bubble-sort using multisets. In: SAMI 2020, pp. 165\u2013172. IEEE (2020). https:\/\/doi.org\/10.1109\/SAMI48414.2020.9108725","DOI":"10.1109\/SAMI48414.2020.9108725"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T.: Deductive synthesis of min-max-sort using multisets. In: SACI 2020, pp. 165\u2013172. IEEE (2020). https:\/\/doi.org\/10.1109\/SACI49304.2020.9118814","DOI":"10.1109\/SACI49304.2020.9118814"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T.: Synthesis of sorting algorithms using multisets in Theorema. J. Log. Algebraic Methods Programm. 119(100635) (2020). https:\/\/doi.org\/10.1016\/j.jlamp.2020.100635","DOI":"10.1016\/j.jlamp.2020.100635"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jsc.2018.04.002","volume":"90","author":"I Dramnesc","year":"2019","unstructured":"Dramnesc, I., Jebelean, T., Stratulat, S.: Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques. J. Symb. Comput. 90, 3\u201341 (2019). https:\/\/doi.org\/10.1016\/j.jsc.2018.04.002","journal-title":"J. Symb. Comput."},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T.: Synthesis of merging algorithms on binary trees using multisets in Theorema. In: SACI 2021, pp. 497\u2013502. IEEE (2021). https:\/\/doi.org\/10.1109\/SACI51354.2021.9465619","DOI":"10.1109\/SACI51354.2021.9465619"},{"issue":"6","key":"18_CR19","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1093\/comjnl\/30.6.512","volume":"30","author":"RG Dromey","year":"1987","unstructured":"Dromey, R.G.: Derivation of sorting algorithms from a specification. Comput. J. 30(6), 512\u2013518 (1987)","journal-title":"Comput. J."},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-02768-1_13","volume-title":"Programming Languages and Systems","author":"S Eguchi","year":"2018","unstructured":"Eguchi, S., Kobayashi, N., Tsukada, T.: Automated synthesis of functional programs with auxiliary functions. In: Ryu, S. (ed.) APLAS 2018. LNCS, vol. 11275, pp. 223\u2013241. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02768-1_13"},{"key":"18_CR21","unstructured":"Howard, B.T.: Another iteration on \u201cA synthesis of several sorting algorithms\u201d Technical report KSU CIS 94\u20138. Kansas State University, Department of Computing and Information Sciences (1994)"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Itzhaky, S., Peleg, H., Polikarpova, N., Rowe, R.N.S., Sergey, I.: Cyclic program synthesis. In: PLDI 2021, pp. 944\u2013959. ACM (2021). https:\/\/doi.org\/10.1145\/3453483.3454087","DOI":"10.1145\/3453483.3454087"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 2: Seminumerical Algorithms. 3 edn. Addison-Wesley (1998). https:\/\/doi.org\/10.1137\/1012065","DOI":"10.1137\/1012065"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11853886_21","volume-title":"Logics in Artificial Intelligence","author":"Y Korukhova","year":"2006","unstructured":"Korukhova, Y.: Automatic deductive synthesis of lisp programs in the system ALISA. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 242\u2013252. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11853886_21"},{"issue":"3\u20134","key":"18_CR25","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10472-007-9079-9","volume":"50","author":"Y Korukhova","year":"2007","unstructured":"Korukhova, Y.: An approach to automatic deductive synthesis of functional programs. Ann. Math. Artif. Intell. 50(3\u20134), 255\u2013271 (2007). https:\/\/doi.org\/10.1007\/s10472-007-9079-9","journal-title":"Ann. Math. Artif. Intell."},{"key":"18_CR26","first-page":"A001","volume":"35","author":"KK Lau","year":"1992","unstructured":"Lau, K.K.: Top-down synthesis of sorting algorithms. Comput. J. 35, A001\u2013A007 (1992)","journal-title":"Comput. J."},{"issue":"1","key":"18_CR27","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/357084.357090","volume":"2","author":"Z Manna","year":"1980","unstructured":"Manna, Z., Waldinger, R.: A deductive approach to program synthesis. ACM Trans. Programm. Lang. Syst. 2(1), 90\u2013121 (1980). https:\/\/doi.org\/10.1145\/357084.357090","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"18_CR28","doi-asserted-by":"publisher","unstructured":"Manna, Z., Waldinger, R.: The Logical Basis for Computer Programming, vol. 1: Deductive Reasoning. Addison-Wesley (1985). https:\/\/doi.org\/10.2307\/2275898","DOI":"10.2307\/2275898"},{"issue":"8","key":"18_CR29","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1109\/32.153379","volume":"18","author":"Z Manna","year":"1992","unstructured":"Manna, Z., Waldinger, R.: Fundamentals of deductive program synthesis. IEEE Trans. Softw. Eng. 18(8), 674\u2013704 (1992). https:\/\/doi.org\/10.1109\/32.153379","journal-title":"IEEE Trans. Softw. Eng."},{"key":"18_CR30","doi-asserted-by":"publisher","unstructured":"Polikarpova, N., Kuraj, I., Solar-Lezama, A.: Program synthesis from polymorphic refinement types. In: PLDI 2016, pp. 522\u2013538 (2016). https:\/\/doi.org\/10.1145\/2908080.2908093","DOI":"10.1145\/2908080.2908093"},{"key":"18_CR31","doi-asserted-by":"publisher","unstructured":"Radoaca, A.: Properties of multisets compared to sets. In: SYNASC 2015, pp. 187\u2013188 (2015). https:\/\/doi.org\/10.1109\/SYNASC.2015.37","DOI":"10.1109\/SYNASC.2015.37"},{"issue":"9","key":"18_CR32","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/32.578788","volume":"16","author":"DR Smith","year":"1990","unstructured":"Smith, D.R.: KIDS: a semiautomatic program development system. IEEE Trans. Softw. Eng. 16(9), 1024\u20131043 (1990). https:\/\/doi.org\/10.1109\/32.578788","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"18_CR33","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/1707801.1706337","volume":"45","author":"S Srivastava","year":"2010","unstructured":"Srivastava, S., Gulwani, S., Foster, J.S.: From program verification to program synthesis. SIGPLAN Not. 45(1), 313\u2013326 (2010). https:\/\/doi.org\/10.1145\/1707801.1706337","journal-title":"SIGPLAN Not."},{"key":"18_CR34","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jsco.2000.0469","volume":"32","author":"S Stratulat","year":"2001","unstructured":"Stratulat, S.: A general framework to build contextual cover set induction provers. J. Symb. Comput. 32, 403\u2013445 (2001)","journal-title":"J. Symb. Comput."},{"issue":"6","key":"18_CR35","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0747-7171(89)80040-9","volume":"7","author":"J Traugott","year":"1989","unstructured":"Traugott, J.: Deductive synthesis of sorting programs. J. Symb. Comput. 7(6), 533\u2013572 (1989). https:\/\/doi.org\/10.1016\/S0747-7171(89)80040-9","journal-title":"J. Symb. Comput."},{"key":"18_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-662-44199-2_9","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"W Windsteiger","year":"2014","unstructured":"Windsteiger, W.: Theorema 2.0: A system for mathematical theory exploration. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 49\u201352. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44199-2_9"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85315-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:03:41Z","timestamp":1630022621000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85315-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030853143","9783030853150"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85315-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2021.github.io\/","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":"55","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":"20","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":"36% - 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":"3","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)"}}]}}