{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T04:35:22Z","timestamp":1781238922581,"version":"3.54.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030908690","type":"print"},{"value":"9783030908706","type":"electronic"}],"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-90870-6_20","type":"book-chapter","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:06:44Z","timestamp":1636502804000},"page":"367-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Hybrid Systems Verification with Isabelle\/HOL: Simpler Syntax, Better Models, Faster Proofs"],"prefix":"10.1007","author":[{"given":"Simon","family":"Foster","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan Juli\u00e1n","family":"Huerta y Munive","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mario","family":"Gleirscher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,10]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-22102-1_3","volume-title":"Interactive Theorem Proving","author":"A Anand","year":"2015","unstructured":"Anand, A., Knepper, R.: ROSCoq: robots powered by constructive reals. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 34\u201350. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22102-1_3"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Ricketts, D., Malecha, G., Alvarez, M.M., Gowda, V., Lerner, S.: Towards verification of hybrid systems in a foundational proof assistant. In: MEMOCODE, pp. 248\u2013257. IEEE (2015)","DOI":"10.1109\/MEMCOD.2015.7340492"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-319-25423-4_25","volume-title":"Formal Methods and Software Engineering","author":"S Wang","year":"2015","unstructured":"Wang, S., Zhan, N., Zou, L.: An improved HHL prover: an interactive theorem prover for hybrid systems. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 382\u2013399. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25423-4_25"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-030-02149-8_14","volume-title":"Relational and Algebraic Methods in Computer Science","author":"JJ Huerta y Munive","year":"2018","unstructured":"Huerta y Munive, J.J., Struth, G.: Verifying hybrid systems with modal Kleene algebra. In: Desharnais, J., Guttmann, W., Joosten, S. (eds.) RAMiCS 2018. LNCS, vol. 11194, pp. 225\u2013243. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02149-8_14"},{"key":"20_CR5","unstructured":"Huerta y Munive, J.J., Struth, G.: Predicate transformer semantics for hybrid systems: verification components for Isabelle\/HOL. arXiv:1909.05618 [cs.LO] (2019)"},{"key":"20_CR6","unstructured":"Huerta y Munive, J.J.: Verification components for hybrid systems. Archive of Formal Proofs (2019)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-030-31038-7_7","volume-title":"Unifying Theories of Programming","author":"S Foster","year":"2019","unstructured":"Foster, S.: Hybrid relations in Isabelle\/UTP. In: Ribeiro, P., Sampaio, A. (eds.) UTP 2019. LNCS, vol. 11885, pp. 130\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31038-7_7"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-030-43520-2_11","volume-title":"Relational and Algebraic Methods in Computer Science","author":"S Foster","year":"2020","unstructured":"Foster, S., Huerta y Munive, J.J., Struth, G.: Differential Hoare logics and refinement calculi for hybrid systems with Isabelle\/HOL. In: Fahrenberg, U., Jipsen, P., Winter, M. (eds.) RAMiCS 2020. LNCS, vol. 12062, pp. 169\u2013186. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43520-2_11"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Immler, F., Traut, C.: The flow of ODEs: Formalization of variational equation and Poincar\u00e9 map. J. Autom. Reasoning 62(2), 215\u2013236 (2019)","DOI":"10.1007\/s10817-018-9449-5"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Foster, S., Baxter, J., Cavalcanti, A., Woodcock, J., Zeyda, F.: Unifying semantic foundations for automated verification tools in Isabelle\/UTP. Science of Computer Programming, vol. 197, October 2020","DOI":"10.1016\/j.scico.2020.102510"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Platzer, A.: Logical Foundations of Cyber-Physical Systems. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-63588-0","DOI":"10.1007\/978-3-319-63588-0"},{"key":"20_CR12","unstructured":"Boulton, R.J., Gordon, A.D., Gordon, M.J.C., Harrison, J., Herbert, J., Tassel, J.V.: Experience with embedding hardware description languages in HOL. In: IFIP Transactions, vol. A-10, pp. 129\u2013156, North-Holland (1992)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-30142-4_22","volume-title":"Theorem Proving in Higher Order Logics","author":"M Wildmoser","year":"2004","unstructured":"Wildmoser, M., Nipkow, T.: Certifying machine code safety: shallow versus deep embedding. In: Slind, K., Bunker, A., Gopalakrishnan, G. (eds.) TPHOLs 2004. LNCS, vol. 3223, pp. 305\u2013320. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30142-4_22"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-030-58768-0_5","volume-title":"Software Engineering and Formal Methods","author":"JJ Huerta y Munive","year":"2020","unstructured":"Huerta y Munive, J.J.: Affine systems of ODEs in Isabelle\/HOL for hybrid-program verification. In: de Boer, F., Cerone, A. (eds.) SEFM 2020. LNCS, vol. 12310, pp. 77\u201392. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58768-0_5"},{"key":"20_CR15","unstructured":"Huerta y Munive, J.J.: Matrices for ODEs. Archive of Formal Proofs (2020)"},{"key":"20_CR16","unstructured":"Hickman, T., Laursen, C.P., Foster, S., Huerta y Munive, J.J.: Certifying differential equation solutions from computer algebra systems in Isabelle\/HOL. arXiv:2102.02679 [cs.LO], February 2021"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Teschl, G.: Ordinary Differential Equations and Dynamical Systems. AMS (2012)","DOI":"10.1090\/gsm\/140"},{"key":"20_CR18","unstructured":"Mitsch, S., Huerta y Munive, J.J., Jin, X., Zhan, B., Wang, S., Zhan, N.: ARCH-COMP20 category report: Hybrid systems theorem proving. ARCH 20, 141\u2013161 (2019)"},{"key":"20_CR19","unstructured":"Foster, S., Zeyda, F.: Optics. Archive of Formal Proofs, May 2017"},{"key":"20_CR20","unstructured":"Oles, F.: A Category-theoretic approach to the semantics of programming languages. Ph.D. thesis, Syracuse University (1982)"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Back, R., von Wright, J.: Refinement Calculus\u2013A Systematic Introduction. Springer, New York (1998). https:\/\/doi.org\/10.1007\/978-1-4612-1674-2","DOI":"10.1007\/978-1-4612-1674-2"},{"key":"20_CR22","unstructured":"Foster, J.: Bidirectional programming languages. Ph.D. thesis, University of Pennsylvania (2009)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-030-43520-2_7","volume-title":"Relational and Algebraic Methods in Computer Science","author":"S Foster","year":"2020","unstructured":"Foster, S., Baxter, J.: Automated algebraic reasoning for collections and local variables with lenses. In: Fahrenberg, U., Jipsen, P., Winter, M. (eds.) RAMiCS 2020. LNCS, vol. 12062, pp. 100\u2013116. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43520-2_7"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Foster, S., Gleirscher, M., Calinescu, R.: Towards deductive verification of control algorithms for autonomous marine vehicles. In: ICECCS. IEEE, October 2020","DOI":"10.1109\/ICECCS51672.2020.00020"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-32347-8_26","volume-title":"Interactive Theorem Proving","author":"F Immler","year":"2012","unstructured":"Immler, F., H\u00f6lzl, J.: Numerical analysis of ordinary differential equations in Isabelle\/HOL. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol. 7406, pp. 377\u2013392. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32347-8_26"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-39634-2_21","volume-title":"Interactive Theorem Proving","author":"J H\u00f6lzl","year":"2013","unstructured":"H\u00f6lzl, J., Immler, F., Huffman, B.: Type classes and filters for mathematical analysis in Isabelle\/HOL. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 279\u2013294. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39634-2_21"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Foster, S., Nemouchi, Y., Gleirscher, M., Wei, R., Kelly, T.: Integration of formal proof into unified assurance cases with Isabelle\/SACM. Formal Aspects of Computing (2021)","DOI":"10.1007\/s00165-021-00537-4"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Kuncar, O., Popescu, A.: A consistent foundation for Isabelle\/HOL. J. Autom. Reasoning 62, 531\u2013555 (2019)","DOI":"10.1007\/s10817-018-9454-8"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Cheney, E.W.: Analysis for Applied Mathematics. Springer, New York (2001). https:\/\/doi.org\/10.1007\/978-1-4757-3559-8","DOI":"10.1007\/978-1-4757-3559-8"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Platzer, A.: The structure of differential invariants and differential cut elimination. Log. Meth. Comput. Sci. 8(4), 1\u201338 (2012). https:\/\/doi.org\/10.2168\/LMCS-8(4:16)2012","DOI":"10.2168\/LMCS-8(4:16)2012"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Platzer, A., Tan, Y.K.: Differential equation axiomatization: the impressive power of differential ghosts. In: LICS, pp. 819\u2013828. ACM (2018)","DOI":"10.1145\/3209108.3209147"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Matichuk, D., Murray, T.C., Wenzel, M.: Eisbach: a proof method language for Isabelle. J. Autom. Reasoning 56(3), 261\u2013282 (2016)","DOI":"10.1007\/s10817-015-9360-2"},{"key":"20_CR33","unstructured":"H\u00f6lzl, J.: Proving inequalities over reals with computation in Isabelle\/HOL. In: PLMMS, pp. 38\u201345. ACM (2009)"},{"key":"20_CR34","unstructured":"Blanchette, J.C., Kaliszyk, C., Paulson, L.C., Urban, J.: Hammering towards QED. J. Formalized Reasoning 9(1), 101\u2013148 (2016)"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Li, W., Passmore, G., Paulson, L.: Deciding univariate polynomial problems using untrusted certificates in Isabelle\/HOL. J. Autom. Reasoning 62, 29\u201391 (2019)","DOI":"10.1007\/s10817-017-9424-6"},{"key":"20_CR36","unstructured":"Cordwell, K., Yong, K.T., Platzer, A.: A verified decision procedure for univariate real arithmetic with the BKR algorithm. In Cohen, L., Kaliszyk, C. (eds.) ITP. Volume 193 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 14:1\u201314:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-319-21401-6_36","volume-title":"Automated Deduction - CADE-25","author":"N Fulton","year":"2015","unstructured":"Fulton, N., Mitsch, S., Quesel, J.-D., V\u00f6lp, M., Platzer, A.: KeYmaera\u00a0X: an axiomatic tactical theorem prover for hybrid systems. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 527\u2013538. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_36"},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Slagel, J.T., White, L., Dutle, A.: Formal verification of semi-algebraic sets and real analytic functions. In: CPP, pp. 278\u2013290. ACM (2021)","DOI":"10.1145\/3437992.3439933"},{"key":"20_CR39","doi-asserted-by":"crossref","unstructured":"Bohrer, B., Rahli, V., Vukotic, I., V\u00f6lp, M., Platzer, A.: Formally verified differential dynamic logic. In: CPP, pp. 208\u2013221. ACM (2017)","DOI":"10.1145\/3018610.3018616"},{"key":"20_CR40","unstructured":"Platzer, A.: Differential game logic. Archive of Formal Proofs (2019)"},{"key":"20_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-17164-2_1","volume-title":"Programming Languages and Systems","author":"J Liu","year":"2010","unstructured":"Liu, J., Lv, J., Quan, Z., Zhan, N., Zhao, H., Zhou, C., Zou, L.: A calculus for hybrid CSP. In: Ueda, K. (ed.) APLAS 2010. LNCS, vol. 6461, pp. 1\u201315. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17164-2_1"},{"key":"20_CR42","doi-asserted-by":"crossref","unstructured":"Preoteasa, V., Dragomir, I., Tripakis, S.: Refinement calculus of reactive systems. In: International Conference on Embedded Systems (EMSOFT). IEEE, October 2014","DOI":"10.1145\/2656045.2656068"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90870-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:09:54Z","timestamp":1636502994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90870-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030908690","9783030908706"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90870-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 November 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2021.csp.escience.cn\/dct\/page\/1","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":"131","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":"40","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":"2","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":"31% - 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":"9","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":"Additionally, this includes 4 invited full papers.","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)"}}]}}