{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:38:47Z","timestamp":1743007127159,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031384981"},{"type":"electronic","value":"9783031384998"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"vor","delay-in-days":244,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The need to verify symbolic computation arises in diverse application areas. In this paper, based on earlier work on verifying computation of definite integrals in , we present a tool  for performing a variety of symbolic computations interactively, taking a middle ground in terms of easy of use and rigor between computer algebra systems and interactive theorem provers. The tool supports user-level definitions and dependency among computations, allowing construction and reuse of custom theories. Side conditions are checked on a best-effort basis. The tool is applied to highly non-trivial computations from the textbook Inside Interesting Integrals.<\/jats:p>","DOI":"10.1007\/978-3-031-38499-8_33","type":"book-chapter","created":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:03:25Z","timestamp":1693609405000},"page":"577-589","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Iscalc: An Interactive Symbolic Computation Framework (System Description)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5377-9351","authenticated-orcid":false,"given":"Bohua","family":"Zhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuheng","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiqiang","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runqing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"key":"33_CR1","unstructured":"MIT Integration Bee. https:\/\/www.mit.edu\/~pax\/integrationbee.html. Accessed 22 Jan 2020"},{"issue":"3","key":"33_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10817-009-9149-2","volume":"44","author":"B Akbarpour","year":"2010","unstructured":"Akbarpour, B., Paulson, L.C.: Metitarski: an automatic theorem prover for real-valued special functions. J. Autom. Reason. 44(3), 175\u2013205 (2010). https:\/\/doi.org\/10.1007\/s10817-009-9149-2","journal-title":"J. Autom. Reason."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"\u00c5str\u00f6m, K.J., Murray, R.M.: Feedback systems: An introduction for scientists and engineers (2008)","DOI":"10.1515\/9781400828739"},{"issue":"3","key":"33_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10817-015-9356-y","volume":"56","author":"J Avigad","year":"2016","unstructured":"Avigad, J., Lewis, R.Y., Roux, C.: A heuristic prover for real inequalities. J. Autom. Reason. 56(3), 367\u2013386 (2016). https:\/\/doi.org\/10.1007\/s10817-015-9356-y","journal-title":"J. Autom. Reason."},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1006079212546","volume":"21","author":"A Bauer","year":"1998","unstructured":"Bauer, A., Clarke, E.M., Zhao, X.: Analytica - an experiment in combining theorem proving and symbolic computation. J. Autom. Reason. 21(3), 295\u2013325 (1998). https:\/\/doi.org\/10.1023\/A:1006079212546","journal-title":"J. Autom. Reason."},{"issue":"7","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1017\/S0960129514000437","volume":"26","author":"S Boldo","year":"2016","unstructured":"Boldo, S., Lelay, C., Melquiond, G.: Formalization of real analysis: a survey of proof assistants and libraries. Math. Struct. Comput. Sci. 26(7), 1196\u20131233 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"33_CR7","doi-asserted-by":"publisher","unstructured":"Donato, P., Strub, P., Werner, B.: A drag-and-drop proof tactic. In: Popescu, A., Zdancewic, S. (eds.) 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2022, Philadelphia, PA, USA, 17\u201318 January 2022, pp. 197\u2013209. ACM (2022). https:\/\/doi.org\/10.1145\/3497775.3503692","DOI":"10.1145\/3497775.3503692"},{"key":"33_CR8","doi-asserted-by":"publisher","unstructured":"Eberl, M.: Verified real asymptotics in Isabelle\/HOL. In: Davenport, J.H., Wang, D., Kauers, M., Bradford, R.J. (eds.) Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, 15\u201318 July 2019, pp. 147\u2013154. ACM (2019). https:\/\/doi.org\/10.1145\/3326229.3326240","DOI":"10.1145\/3326229.3326240"},{"issue":"11\u201312","key":"33_CR9","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1016\/j.mcm.2006.04.002","volume":"44","author":"H Fu","year":"2006","unstructured":"Fu, H., Zhong, X., Zeng, Z.: Automated and readable simplification of trigonometric expressions. Math. Comput. Model. 44(11\u201312), 1169\u20131177 (2006). https:\/\/doi.org\/10.1016\/j.mcm.2006.04.002","journal-title":"Math. Comput. Model."},{"key":"33_CR10","unstructured":"Gruntz, D.: On computing limits in a symbolic manipulation system (1996)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Guarde\u00f1o, A.J.D., Riera, M.P., Malumbres, J.L.V.: The misfortunes of a trio of mathematicians using computer algebra systems. Can we trust in them? Not. Am. Math. Soc. 61, 1249\u20131252 (2014)","DOI":"10.1090\/noti1173"},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1023\/A:1006023127567","volume":"21","author":"J Harrison","year":"1998","unstructured":"Harrison, J., Th\u00e9ry, L.: A skeptic\u2019s approach to combining HOL and Maple. J. Autom. Reason. 21(3), 279\u2013294 (1998). https:\/\/doi.org\/10.1023\/A:1006023127567","journal-title":"J. Autom. Reason."},{"key":"33_CR13","unstructured":"Kouba, D.A.: The calculus page problems list. https:\/\/www.math.ucdavis.edu\/kouba\/ProblemsList.html. Accessed 22 Jan 2020"},{"issue":"2","key":"33_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10817-021-09611-1","volume":"66","author":"RY Lewis","year":"2022","unstructured":"Lewis, R.Y., Wu, M.: A bi-directional extensible interface between lean and mathematica. J. Autom. Reason. 66(2), 215\u2013238 (2022). https:\/\/doi.org\/10.1007\/s10817-021-09611-1","journal-title":"J. Autom. Reason."},{"issue":"2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10817-019-09521-3","volume":"64","author":"W Li","year":"2020","unstructured":"Li, W., Paulson, L.C.: Evaluating winding numbers and counting complex roots through Cauchy indices in Isabelle\/HOL. J. Autom. Reason. 64(2), 331\u2013360 (2020). https:\/\/doi.org\/10.1007\/s10817-019-09521-3","journal-title":"J. Autom. Reason."},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-030-79876-5_37","volume-title":"Automated Deduction \u2013 CADE 28","author":"L Moura","year":"2021","unstructured":"Moura, L., Ullrich, S.: The lean 4 theorem prover and programming language. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 625\u2013635. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_37"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Nahin, P.J.: Inside interesting integrals. Undergraduate Lecture Notes in Physics (2014)","DOI":"10.1007\/978-1-4939-1277-3"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-030-79876-5_28","volume-title":"Automated Deduction \u2013 CADE 28","author":"R Xu","year":"2021","unstructured":"Xu, R., Li, L., Zhan, B.: Verified interactive computation of definite integrals. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 485\u2013503. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_28"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-32409-4_6","volume-title":"Formal Methods and Software Engineering","author":"B Zhan","year":"2019","unstructured":"Zhan, B., Ji, Z., Zhou, W., Xiang, C., Hou, J., Sun, W.: Design of point-and-click user interfaces for proof assistants. In: Ait-Ameur, Y., Qin, S. (eds.) ICFEM 2019. LNCS, vol. 11852, pp. 86\u2013103. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32409-4_6"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 29"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38499-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:06:28Z","timestamp":1693609588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38499-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031384981","9783031384998"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38499-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Deduction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cade2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/cade2023\/","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":"77","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":"28","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":"5","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":"6","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)"}}]}}