{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T11:06:48Z","timestamp":1790075208085,"version":"4.0.1"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","license":[{"start":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T00:00:00Z","timestamp":1780876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2026,6,8]]},"abstract":"<jats:p>\n                    Formally specifying, let alone verifying, properties of systems involving multiple programming languages is inherently challenging. We introduce\n                    <jats:italic toggle=\"yes\">Heterogeneous Dynamic Logic<\/jats:italic>\n                    (HDL), a framework for combining reasoning principles from distinct (dynamic) program logics in a modular and compositional way. HDL mirrors the architecture of satisfiability modulo theories (SMT): Individual dynamic logics, along with their calculi, are treated as\n                    <jats:italic toggle=\"yes\">dynamic theories<\/jats:italic>\n                    that can be combined to reason about heterogeneous systems whose components are verified using different program logics. HDL provides two key operations:\n                    <jats:italic toggle=\"yes\">Lifting<\/jats:italic>\n                    extends an individual dynamic theory with new program constructs (e.g., the havoc operation or regular programs) and automatically augments its calculus with sound reasoning principles for the new constructs; and\n                    <jats:italic toggle=\"yes\">Combination<\/jats:italic>\n                    enables cross-language reasoning in a\n                    <jats:italic toggle=\"yes\">single modality<\/jats:italic>\n                    via\n                    <jats:italic toggle=\"yes\">Heterogeneous Dynamic Theories<\/jats:italic>\n                    , facilitating the reuse of existing proof infrastructure. By lifting combined theories with regular programs, we obtain\n                    <jats:italic toggle=\"yes\">heterogeneous<\/jats:italic>\n                    control structures that allow us to reason about intertwined cross-language behavior. We formalize dynamic theories, their lifting and combination, and prove the soundness of all proof rules in Isabelle. We also introduce a proof rule combining deductive DL-based reasoning with reasoning principles from Kleene Algebras with Tests. Furthermore, we prove\n                    <jats:italic toggle=\"yes\">relative completeness<\/jats:italic>\n                    theorems for lifting and combination: Under usual assumptions, reasoning about lifted or combined theories is no harder than reasoning about the constituent dynamic theories and their common first-order structure (i.e., the \u201cdata theory\u201d). We demonstrate HDL\u2019s value by verifying an automotive case study where a Java controller (formalized in Java dynamic logic) steers a plant model (formalized in differential dynamic logic).\n                  <\/jats:p>","DOI":"10.1145\/3808295","type":"journal-article","created":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T18:04:09Z","timestamp":1780941849000},"page":"1202-1227","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Heterogeneous Dynamic Logic: Provability Modulo Program Theories"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7945-9110","authenticated-orcid":false,"given":"Samuel","family":"Teuber","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2350-1831","authenticated-orcid":false,"given":"Mattias","family":"Ulbrich","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7238-5710","authenticated-orcid":false,"given":"Andr\u00e9","family":"Platzer","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9672-3291","authenticated-orcid":false,"given":"Bernhard","family":"Beckert","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,8]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"Noah Abou El Wafa and Andr\u00e9 Platzer. 2025. Complete first-order game logic. CoRR abs\/2504.03495. arXiv: 2504.03495."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49812-6"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Gidon Ernst Matthias G\u00fcdemann Alexander Knapp Florian Nafz Frank Ortmeier Hella Ponsar Gerhard Schellhorn and Alexander Schiendorfer (Eds.) 2025. The many uses of dynamic logic. Go Where the Bugs Are \u2013 Essays Dedicated to Wolfgang Reif on the Occasion of His 65th Birthday. LNCS. Springer 56-82. doi:10.1007\/978-3-031-92196-4_4.","DOI":"10.1007\/978-3-031-92196-4_4"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3360573"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-1"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45165-X_2"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14125-1_2"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_23"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-57246-3_15"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06410-9_9"},{"key":"e_1_3_1_13_2","unstructured":"Rose Bohrer. 2017. Differential dynamic logic. Archive of Formal Proofs (Feb. 2017). https:\/\/isa-afp.org\/entries\/Differential_Dynamic_Logic.html Formal proof development."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209151"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.34727\/2025\/ISBN.978-3-85448-084-6_10"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/S10703-023-00434-X"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3594729"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1183278.1183285"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-75380-0_6"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-370366_8"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31038-7_7"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14806-9_2"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_36"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0349-4_1"},{"key":"e_1_3_1_27_2","volume-title":"Fibring Logics","author":"Gabbay Dov M.","year":"1999","unstructured":"Dov M. Gabbay. 1999. Fibring Logics. Clarendon Press, New York."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3302509.3311036"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01700692"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523722"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09237-4"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","unstructured":"David Harel Dexter Kozen and Jerzy Tiuryn. 2000. Dynamic Logic. The MIT Press (Sept. 2000). ISBN: 978-0-262-27495-1. doi:10.7551\/mitpress\/2516.001.0001.","DOI":"10.7551\/mitpress\/2516.001.0001"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/36"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60858-2_21"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/S10009-016-0434-1"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-65627-9_10"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.4230\/LITES.8.2.4"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/S00165-014-0326-7"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/QSW59989.2023.00029"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/256167.25"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3586037"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934555"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_2"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/357073.357079"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-90897-2_6"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90059-6"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-27481-7"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(4:17)2012"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/S10817-016-9385-1"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/S10"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.64"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10373-5_13"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3380825"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-6"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.2307\/1990888"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73770-4_3"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.3217\/JUCS-003-04-0377"},{"key":"e_1_3_1_58_2","unstructured":"Igor Sedl\u00e1r. 2023. Kleene algebra with dynamic tests: completeness and complexity. CoRR abs\/2311.06937. arXiv: 2311.06937."},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-28083-2_13"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.4064\/-9-1-31-46"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3595"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1007\/S00165-020-00525-0"},{"key":"e_1_3_1_63_2","unstructured":"Samuel Teuber Stefan Mitsch and Andr\u00e9 Platzer. 2024. Provably safe neural network controllers via differential dynamic logic. In Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024 NeurIPS 2024 Vancouver BC Canada December 10-15 2024. Amir Globersons Lester Mackey Danielle Belgrave Angela Fan Ulrich Paquet Jakub M. Tomczak and Cheng Zhang (Eds.)"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","unstructured":"[SW] Samuel Teuber Mattias Ulbrich Andr\u00e9 Platzer and Bernhard Beckert Artifact for \u201cHeterogeneous Dynamic Logic: Provability Modulo Program Theories\u201d Mar. 2026. doi:10.5281\/zenodo.19551156.","DOI":"10.5281\/zenodo.19551156"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","unstructured":"Samuel Teuber Mattias Ulbrich Andr\u00e9 Platzer and Bernhard Beckert. 2025. Heterogeneous dynamic logic: provability modulo program theories. CoRR abs\/2507.08581. doi:10.48550\/ARXIV.2507.08581.","DOI":"10.48550\/ARXIV.2507.08581"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0349-4_5"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30227-8_53"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18070-5_12"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","unstructured":"Mattias Ulbrich. 2013. Dynamic Logic for an Intermediate Language: Verification Interaction and Refinement. Ph.D. Dissertation. Karlsruhe Institute of Technology. doi:10.5445\/IR\/1000041169.","DOI":"10.5445\/IR\/1000041169"},{"key":"e_1_3_1_70_2","unstructured":"Yuanrui Zhang. 2024. Parameterized dynamic logic \u2013 towards A cyclic logical framework for program verification via operational semantics. CoRR abs\/2404.18098. arXiv:2404.18098."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3808295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T10:36:49Z","timestamp":1790073409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3808295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,8]]},"references-count":69,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2026,6,8]]}},"alternative-id":["10.1145\/3808295"],"URL":"https:\/\/doi.org\/10.1145\/3808295","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,8]]},"assertion":[{"value":"2025-11-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}