{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:37:54Z","timestamp":1781836674615,"version":"3.54.5"},"reference-count":81,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T00:00:00Z","timestamp":1745884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/S001190\/1"],"award-info":[{"award-number":["EP\/S001190\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"RoboCalc","award":["EP\/M025756\/1"],"award-info":[{"award-number":["EP\/M025756\/1"]}]},{"name":"RoboTest","award":["EP\/R025479\/1"],"award-info":[{"award-number":["EP\/R025479\/1"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Korean Ministry of Science and ICT","award":["RS-2024-00355459"],"award-info":[{"award-number":["RS-2024-00355459"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2025,5,31]]},"abstract":"<jats:p>Model execution allows us to prototype and analyse software engineering models by stepping through their possible behaviours, using techniques like animation and simulation. On the other hand, deductive verification allows us to construct formal proofs demonstrating satisfaction of certain critical properties in support of high-assurance software engineering. To ensure coherent results between execution and proof, we need unifying semantics and automation. In this article, we mechanise Interaction Trees (ITrees) in Isabelle\/HOL to produce an execution and verification framework. ITrees are coinductive structures that allow us to encode infinite labelled transition systems, yet they are inherently executable. We use ITrees to create verification tools for stateful imperative programs, concurrent programs with message passing in the form of the CSP and Circus languages, and abstract system models in the style of the Z and B methods. We demonstrate how ITrees can account for diverse semantic presentations, such as structural operational semantics, a relational program model, and CSP's failures-divergences trace model. Finally, we demonstrate how ITrees can be executed using the Isabelle code generator to support the animation of models.<\/jats:p>","DOI":"10.1145\/3702981","type":"journal-article","created":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T14:52:13Z","timestamp":1730904733000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle\/HOL"],"prefix":"10.1145","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9889-9514","authenticated-orcid":false,"given":"Simon","family":"Foster","sequence":"first","affiliation":[{"name":"University of York, York, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1656-0913","authenticated-orcid":false,"given":"Chung-Kil","family":"Hur","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7955-2702","authenticated-orcid":false,"given":"Jim","family":"Woodcock","sequence":"additional","affiliation":[{"name":"Southwest University, Chongqing, China and Aarhus University, Aarhus, Denmark and University of York, York, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,4,29]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book: Assigning Programs to Meanings","author":"Abrial Jean-Raymond","year":"1996","unstructured":"Jean-Raymond Abrial. 1996. The B-Book: Assigning Programs to Meanings. Cambridge University Press."},{"issue":"1","key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1017\/S0956796812000019","article-title":"A compiled implementation of normalisation by evaluation","volume":"22","author":"Aehlig K.","year":"2012","unstructured":"K. Aehlig, F. Haftmann, and T. Nipkow. 2012. A compiled implementation of normalisation by evaluation. Journal of Functional Programming 22, 1 (2012), 9\u201330.","journal-title":"Journal of Functional Programming"},{"issue":"2","key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s00165-015-0343-1","article-title":"Building program construction and verification tools from algebraic principles","volume":"28","author":"Armstrong A.","year":"2015","unstructured":"A. Armstrong, V. Gomes, and G. Struth. 2015. Building program construction and verification tools from algebraic principles. Formal Aspects of Computing 28, 2 (2015), 265\u2013293.","journal-title":"Formal Aspects of Computing"},{"key":"e_1_3_2_5_2","series-title":"LNCS, Vol. 551","volume-title":"Formal Software Development Methods","author":"Arthan R.","year":"1991","unstructured":"R. Arthan. 1991. On formal specification of a proof tool. In Formal Software Development Methods. LNCS, Vol. 551. Springer."},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01558665","article-title":"Decentralization of process nets with centralized control","volume":"3","author":"Back R.-J.","year":"1989","unstructured":"R.-J. Back and R. Kurki-Suonio. 1989. Decentralization of process nets with centralized control. Distributed Computing 3 (June 1989), 73\u201387.","journal-title":"Distributed Computing"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-020-00394-3"},{"key":"e_1_3_2_8_2","volume-title":"Coq\u2019Art: The Calculus of Inductive Constructions","author":"Bertot Y.","year":"2004","unstructured":"Y. Bertot and P. Cast\u00e9ran. 2004. Coq\u2019Art: The Calculus of Inductive Constructions. Springer."},{"key":"e_1_3_2_9_2","volume-title":"Proceedings of the Programming Languages and Systems, 26th European Symposium on Programming (ESOP \u201917)","author":"Blanchette J. C.","year":"2017","unstructured":"J. C. Blanchette, A. Bouzy, A. Lochbihler, A. Popescu, and D. Traytel. 2017. Friends with benefits: Implementing corecursion in foundational proof assistants. In Proceedings of the Programming Languages and Systems, 26th European Symposium on Programming (ESOP \u201917)."},{"key":"e_1_3_2_10_2","series-title":"LNCS, Vol. 8558","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-319-08970-6_7","volume-title":"Proceedings of the 5th International Conference on Interactive Theorem Proving (ITP \u201914)","author":"Blanchette J. C.","year":"2014","unstructured":"J. C. Blanchette, J. H\u00f6lzl, A. Lochbihler, L. Panny, A. Popescu, and D. Traytel. 2014. Truly modular (co)datatypes for isabelle\/HOL. In Proceedings of the 5th International Conference on Interactive Theorem Proving (ITP \u201914), LNCS, Vol. 8558, Gerwin Klein and Ruben Gamboa (Eds.), Springer, 93\u2013110."},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.6092\/issn.1972-5787\/4593"},{"key":"e_1_3_2_12_2","first-page":"192","volume-title":"Proceedings of the 20th International Conference on Functional Programming (ICFP \u201915)","author":"Blanchette J. C.","year":"2015","unstructured":"J. C. Blanchette, A. Popescu, and D. Traytel. 2015. Foundational extensible corecursion: a proof assistant perspective. In Proceedings of the 20th International Conference on Functional Programming (ICFP \u201915). ACM, 192\u2013204. DOI: 10.1145\/2858949.2784732"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9391-3"},{"key":"e_1_3_2_14_2","first-page":"129","volume-title":"Proceedings of the IFIP International Conference on Theorem Provers in Circuit Design","author":"Boulton R.","year":"1993","unstructured":"R. Boulton, A. Gordon, M. Gordon, J. Harrison, J. Herbert, and J. van Tassel. 1993. Experience with embedding hardware description languages in HOL. In Proceedings of the IFIP International Conference on Theorem Provers in Circuit Design, 129\u2013156."},{"key":"e_1_3_2_15_2","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/2997364.2997384","volume-title":"Proceedings of the 2016 ACM SIGPLAN International Conference on Software Language Engineering (SLE \u201916)","author":"Bousse E.","year":"2016","unstructured":"E. Bousse, T. Degueule, D. Vojtisek, T. Mayerhofer, J. Deantoni, and B. Combemale. 2016. Execution framework of the GEMOC studio (tool demo). In Proceedings of the 2016 ACM SIGPLAN International Conference on Software Language Engineering (SLE \u201916). ACM, 84\u201389. DOI: 10.1145\/2997364.2997384"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/828.833"},{"issue":"2","key":"e_1_3_2_17_2","first-page":"152","article-title":"HOL-Z 2.0: A proof environment for Z-specifications","volume":"9","author":"Brucker A. D.","year":"2003","unstructured":"A. D. Brucker, F. Rittinger, and B. Wolff. 2003. HOL-Z 2.0: A proof environment for Z-specifications. Journal of Universal Computer Science 9, 2 (February 2003), 152\u2013172.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_18_2","series-title":"LNCS, Vol. 2999","first-page":"40","volume-title":"Proceedings of the 4th International Conference on Integrated Formal Methods (IFM \u201904)","author":"Cavalcanti A.","year":"2004","unstructured":"A. Cavalcanti and J. Woodcock. 2004. A tutorial introduction to designs in unifying theories of programming. In Proceedings of the 4th International Conference on Integrated Formal Methods (IFM \u201904), LNCS, Vol. 2999, Springer, 40\u201366."},{"key":"e_1_3_2_19_2","volume-title":"Proceedings of the ACM Programming Lang (POPL \u201923)","volume":"61","author":"Chappe N.","year":"2023","unstructured":"N. Chappe, P. He, L. Henrio, Y. Zakowski, and S. Zdancewic. 2023. Choice trees: Representing nondeterministic, recursive, and impure programs in Coq. In Proceedings of the ACM Programming Lang (POPL \u201923), Vol. 61. ACM."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-018-0675-4"},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"104549","DOI":"10.1016\/j.robot.2023.104549","article-title":"Modeling and analysing cyber-physical systems in HOL-CSP","volume":"170","author":"Crisafulli P.","year":"2023","unstructured":"P. Crisafulli, S. Taha, and B. Wolff. 2023. Modeling and analysing cyber-physical systems in HOL-CSP. Robotics and Autonomous Systems 170 (2023), 104549.","journal-title":"Robotics and Autonomous Systems"},{"key":"e_1_3_2_22_2","volume-title":"Proceedings of the 25th International Conference on Automated Deduction (CADE \u201915)","author":"de Moura L.","year":"2015","unstructured":"L. de Moura, S. Kong, J. Avigad, F. van Doorn, and J. von Raumer. 2015. The lean theorem prover (system description). In Proceedings of the 25th International Conference on Automated Deduction (CADE \u201915)."},{"issue":"8","key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminacy and formal derivation of programs","volume":"18","author":"Dijkstra E. W.","year":"1975","unstructured":"E. W. Dijkstra. 1975. Guarded commands, nondeterminacy and formal derivation of programs. Communications of ACM 18, 8 (1975), 453\u2013457.","journal-title":"Communications of ACM"},{"key":"e_1_3_2_24_2","volume-title":"Model-Based Engineering with AADL: An Introduction to the SAE Architecture Analysis & Design Language","author":"Feiler P. H.","year":"2012","unstructured":"P. H. Feiler and D. P. Gluch. 2012. Model-Based Engineering with AADL: An Introduction to the SAE Architecture Analysis & Design Language. Addison-Wesley Professional."},{"key":"e_1_3_2_25_2","series-title":"LNCS, Vol. 8412","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/978-3-642-54830-7_20","volume-title":"Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FOSSACS \u201914)","author":"Ferlez J.","year":"2014","unstructured":"J. Ferlez, R. Cleaveland, and S. Marcus. 2014. Generalized synchronization trees. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FOSSACS \u201914), LNCS, Vol. 8412, Springer, 304\u2013319. DOI: 10.1007\/978-3-642-54830-7_20"},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1109\/CDC.2018.8619607","volume-title":"Proceedings of the 2018 IEEE Conf. on Decision and Control (CDC \u201918)","author":"Ferlez J.","year":"2018","unstructured":"J. Ferlez, R. Cleaveland, and S. I. Marcus. 2018. Bisimulation in behavioral dynamical systems and generalized synchronization trees. In Proceedings of the 2018 IEEE Conf. on Decision and Control (CDC \u201918). IEEE, 751\u2013758. DOI: 10.1109\/CDC.2018.8619607"},{"key":"e_1_3_2_27_2","volume-title":"Bidirectional Programming Languages","author":"Foster J.","year":"2009","unstructured":"J. Foster. 2009. Bidirectional Programming Languages. Ph. D. Dissertation. University of Pennsylvania."},{"key":"e_1_3_2_28_2","series-title":"LNCS, Vol. 11885","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/978-3-030-31038-7_7","volume-title":"Proceedings of the 7th International Symposium on Unifying Theories of Programming (UTP \u201919)","author":"Foster S.","year":"2019","unstructured":"S. Foster. 2019. Hybrid relations in Isabelle\/UTP. In Proceedings of the 7th International Symposium on Unifying Theories of Programming (UTP \u201919), LNCS, Vol. 11885. Springer, 130\u2013153."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2020.102510"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.09.017"},{"key":"e_1_3_2_31_2","series-title":"LIPIcs, Vol. 203","volume-title":"Proceedings of the 32nd International Conference on Concurrency Theory (CONCUR \u201921)","author":"Foster S.","year":"2021","unstructured":"S. Foster, C.-K. Hur, and J. Woodcock. 2021. Formally verified simulations of state-rich processes using interaction trees in Isabelle\/HOL. In Proceedings of the 32nd International Conference on Concurrency Theory (CONCUR \u201921), LIPIcs, Vol. 203, Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik."},{"issue":"6","key":"e_1_3_2_32_2","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1007\/s00165-021-00537-4","article-title":"Integration of formal proof into unified assurance cases with Isabelle\/SACM","volume":"33","author":"Foster S.","year":"2021","unstructured":"S. Foster, Y. Nemouchi, M. Gleirscher, R. Wei, and T. Kelly. 2021. Integration of formal proof into unified assurance cases with Isabelle\/SACM. Formal Aspects of Computing 33, 6 (2021), 855\u2013884.","journal-title":"Formal Aspects of Computing"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2021.100681"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/3372020.3391559","volume-title":"Proceedings of the 8th International Conference on Formal Methods in Software Engineering","author":"Foster Simon","year":"2020","unstructured":"Simon Foster, Yakoub Nemouchi, Colin O\u2019Halloran, Karen Stephenson, and Nick Tudor. 2020. Formal model-based assurance cases in Isabelle\/SACM: An autonomous underwater vehicle case study. In Proceedings of the 8th International Conference on Formal Methods in Software Engineering, 11\u201321."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90870-6_20"},{"key":"e_1_3_2_36_2","first-page":"339","volume-title":"Proceedings of the 19th International Conference on Functional Programming (ICFP \u201914)","author":"Gibbons J.","year":"2014","unstructured":"J. Gibbons and N. Wu. 2014. Folding domain-specific languages: Deep and shallow embeddings. In Proceedings of the 19th International Conference on Functional Programming (ICFP \u201914). ACM, 339\u2013347."},{"key":"e_1_3_2_37_2","first-page":"187","volume-title":"Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems","volume":"8413","author":"Gibson-Robinson T.","year":"2014","unstructured":"T. Gibson-Robinson, P. Armstrong, A. Boulgakov, and A. W. Roscoe. 2014. FDR3 \u2014 A modern refinement checker for CSP. In Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems. Erika \u00c1brah\u00e1m and Klaus Havelund (Eds.), LNCS, Vol. 8413. 187\u2013201."},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","unstructured":"M. Gleirscher S. Foster and J. Woodcock. 2019. New opportunities for integrated formal methods. ACM Computing Surveys 52 6 (2019) 36 pages.","DOI":"10.1145\/3357231"},{"key":"e_1_3_2_39_2","series-title":"LNCS, Vol. 9995","first-page":"310","volume-title":"Proceedings of the Formal Methods","author":"Gomes V. B. F","year":"2016","unstructured":"V. B. F Gomes and G. Struth. 2016. Modal Kleene algebra applied to program correctness. In Proceedings of the Formal Methods, LNCS, Vol. 9995, Springer, 310\u2013325."},{"key":"e_1_3_2_40_2","series-title":"LNCS, Vol. 7998","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-642-39634-2_10","volume-title":"Proceedings of the 4th International Conference on Interactive Theorem Proving (ITP \u201913)","author":"Haftmann F.","year":"2013","unstructured":"F. Haftmann, A. Krauss, O. Kuncar, and T. Nipkow. 2013. Data refinement in Isabelle\/HOL. In Proceedings of the 4th International Conference on Interactive Theorem Proving (ITP \u201913), LNCS, Vol. 7998, Springer, 100\u2013115."},{"key":"e_1_3_2_41_2","series-title":"LNCS, Vol. 6009","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-642-12251-4_9","volume-title":"Proceedings of the 10th International Symposium on Functional and Logic Programming (FLOPS \u201910)","author":"Haftmann F.","year":"2010","unstructured":"F. Haftmann and T. Nipkow. 2010. Code generation via higher-order rewrite systems. In Proceedings of the 10th International Symposium on Functional and Logic Programming (FLOPS \u201910), LNCS, Vol. 6009, Springer, 103\u2013117."},{"issue":"2","key":"e_1_3_2_42_2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","article-title":"A process algebra for timed systems","volume":"117","author":"Hennessy Matthew","year":"1995","unstructured":"Matthew Hennessy and Tim Regan. 1995. A process algebra for timed systems. Information and Computation 117, 2 (1995), 221\u2013239.","journal-title":"Information and Computation"},{"key":"e_1_3_2_43_2","volume-title":"Communicating Sequential Processes","author":"Hoare C. A. R.","year":"1985","unstructured":"C. A. R. Hoare. 1985. Communicating Sequential Processes. Prentice-Hall."},{"issue":"8","key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/27651.27653","article-title":"The laws of programming","volume":"30","author":"Hoare C. A. R.","year":"1987","unstructured":"C. A. R. Hoare, I. Hayes, J. He, C. Morgan, A. Roscoe, J. Sanders, I. S\u00f8rensen, J. Spivey, and B. Sufrin. 1987. The laws of programming. Communications of the ACM 30, 8 (August 1987), 672\u2013687.","journal-title":"Communications of the ACM"},{"key":"e_1_3_2_45_2","volume-title":"Unifying Theories of Programming","author":"Hoare C. A. R.","year":"1998","unstructured":"C. A. R. Hoare and J. He. 1998. Unifying Theories of Programming. Prentice-Hall."},{"key":"e_1_3_2_46_2","first-page":"207","volume-title":"Proceedings of the 22nd Symposium on Operating Systems Principles (SOSP \u201909)","author":"Klein G.","year":"2009","unstructured":"G. Klein, Kevin Elphinstone, Gernot Heiser, June Andronick, David Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, et al. 2009. seL4: Formal verification of an OS kernel. In Proceedings of the 22nd Symposium on Operating Systems Principles (SOSP \u201909). ACM, 207\u2013220."},{"key":"e_1_3_2_47_2","volume-title":"Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP \u201919)","author":"Koh Nicolas","year":"2019","unstructured":"Nicolas Koh, Yao Li, Yishuai Li, Li yao Xia, Lennart Beringer, Wolf Honor\u00e9, William Mansky, Benjamin C. Pierce, and Steve Zdancewic. 2019. From C to interaction trees: Specifying, verifying, and testing a networked server. In Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP \u201919). DOI: 10.1145\/3293880.3294106"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69927-9_4"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-007-0063-9"},{"key":"e_1_3_2_50_2","volume-title":"Proceedings of the 30th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA \u201921)","author":"Li Yishuai","year":"2021","unstructured":"Yishuai Li, Benjamin C. Pierce, and Steve Zdancewic. 2021. Model-based testing of networked applications. In Proceedings of the 30th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA \u201921)."},{"key":"e_1_3_2_51_2","volume-title":"Proceedings of the 29th European Symposium on Programming (ESOP \u201920)","author":"Mansky William","year":"2020","unstructured":"William Mansky, Wolf Honor\u00e9, and Andrew W. Appel. 2020. Connecting higher-order separation logic to a first-order outside world. In Proceedings of the 29th European Symposium on Programming (ESOP \u201920)."},{"key":"e_1_3_2_52_2","volume-title":"A Calculus of Communicating Systems. Lecture Notes in Computer Science","author":"Milner Robin","year":"1980","unstructured":"Robin Milner. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, Vol. 92, Springer."},{"key":"e_1_3_2_53_2","volume-title":"Communication and Concurrency","author":"Milner Robin","year":"1989","unstructured":"Robin Milner. 1989. Communication and Concurrency. Prentice Hall."},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-018-00710-z"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43520-2_11"},{"key":"e_1_3_2_56_2","volume-title":"Proof and System-Reliability","author":"Nipkow T.","year":"2002","unstructured":"T. Nipkow. 2002. Hoare logics in Isabelle\/HOL. In Proof and System-Reliability. H. Schwichtenberg and R. Steinbr\u00fcggen (Eds.), Springer."},{"key":"e_1_3_2_57_2","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","author":"Nipkow T.","year":"2002","unstructured":"T. Nipkow, M. Wenzel, and L. C. Paulson. 2002. Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. Springer."},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-007-0052-5"},{"key":"e_1_3_2_59_2","series-title":"LNCS, Vol. 1313","first-page":"473","volume-title":"Proceedings of the 4th. International Symposium on Formal Methods Europe (FME \u201997)","author":"Paige R. F.","year":"1997","unstructured":"R. F. Paige. 1997. A meta-method for formal method integration. In Proceedings of the 4th. International Symposium on Formal Methods Europe (FME \u201997), LNCS, Vol. 1313, Springer, 473\u2013494."},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.22152\/programming-journal.org\/2017\/1\/7"},{"key":"e_1_3_2_61_2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.tcs.2018.10.008","article-title":"Angelic processes for CSP via the UTP","volume":"756","author":"Ribeiro P.","year":"2019","unstructured":"P. Ribeiro and A. Cavalcanti. 2019. Angelic processes for CSP via the UTP. Theoretical Computer Science 756 (2019), 19\u201363.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_62_2","series-title":"LNCS, Vol. 197","first-page":"306","volume-title":"Proceedings of the International Seminar on Concurrency","author":"Roscoe A. W.","year":"1984","unstructured":"A. W. Roscoe. 1984. Denotational semantics for textsfoccam. In Proceedings of the International Seminar on Concurrency, LNCS, Vol. 197, Springer, 306\u2013329."},{"key":"e_1_3_2_63_2","volume-title":"The Theory and Practice of Concurrency","author":"Roscoe A. W.","year":"2005","unstructured":"A. W. Roscoe. 2005. The Theory and Practice of Concurrency. Prentice-Hall."},{"key":"e_1_3_2_64_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-258-0","volume-title":"Understanding Concurrent Systems","author":"Roscoe A. W.","year":"2010","unstructured":"A. W. Roscoe. 2010. Understanding Concurrent Systems. Springer."},{"key":"e_1_3_2_65_2","first-page":"1","volume-title":"Proceedings of the ACM on Programming Languages","volume":"5","author":"Silver Lucas","year":"2021","unstructured":"Lucas Silver and Steve Zdancewic. 2021. Dijkstra monads forever: Termination-sensitive specifications for interaction trees. Proceedings of the ACM on Programming Languages 5, POPL (January 2021), 1\u201328. DOI: 10.1145\/3434307"},{"key":"e_1_3_2_66_2","volume-title":"The Z Notation \u2014 A Reference Manual","author":"Spivey M.","year":"1989","unstructured":"M. Spivey. 1989. The Z Notation \u2014 A Reference Manual. Prentice Hall."},{"key":"e_1_3_2_67_2","first-page":"709","volume-title":"Proceedings of the 21th International Conference on Computer Aided Verification (CAV \u201909)","volume":"5643","author":"Sun Jun","year":"2009","unstructured":"Jun Sun, Yang Liu, Jin Song Dong, and Jun Pang. 2009. PAT: Towards flexible verification under fairness. In Proceedings of the 21th International Conference on Computer Aided Verification (CAV \u201909), Vol. 5643, 709\u2013714."},{"key":"e_1_3_2_68_2","volume-title":"Proceedings of the 16th International Conference on Integrated Formal Methods (LNCS \u201920)","author":"Taha S.","year":"2020","unstructured":"S. Taha, B. Wolff, and L. Ye. 2020. Philosophers may Dine \u2014 Definitively! In Proceedings of the 16th International Conference on Integrated Formal Methods (LNCS \u201920), Springer. DOI: 10.1007\/978-3-030-63461-2_23"},{"key":"e_1_3_2_69_2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0304-3975(96)00251-4","article-title":"Notes on the methodology of CCS and CSP","volume":"177","author":"van Glabbeek R. J.","year":"1997","unstructured":"R. J. van Glabbeek. 1997. Notes on the methodology of CCS and CSP. Theoretical Computer Science 177 (1997), 329\u2013349.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2024.112034"},{"key":"e_1_3_2_71_2","series-title":"LNCS, Vol. 11617","first-page":"1","volume-title":"Proceedings of the 12th International Conference on Intelligent Computer Mathematics (CICM \u201919)","author":"Wenzel M.","year":"2019","unstructured":"M. Wenzel. 2019. Interaction with formal mathematical documents in Isabelle\/PIDE. In Proceedings of the 12th International Conference on Intelligent Computer Mathematics (CICM \u201919), LNCS, Vol. 11617, Springer, 1\u201315."},{"key":"e_1_3_2_72_2","series-title":"LNCS, Vol. 4732","volume-title":"Proceedings of the International Conference on Theorem Proving in Higher Order Logics (TPHOLs \u201907)","author":"Wenzel M.","year":"2007","unstructured":"M. Wenzel and B. Wolff. 2007. Building formal method tools in the Isabelle\/Isar framework. In Proceedings of the International Conference on Theorem Proving in Higher Order Logics (TPHOLs \u201907), LNCS, Vol. 4732, Springer."},{"issue":"1","key":"e_1_3_2_73_2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(84)90112-9","article-title":"Synchronisation trees","volume":"34","author":"Winsel G.","year":"1984","unstructured":"G. Winsel. 1984. Synchronisation trees. Theoretical Computer Science 34, 1\u20132 (1984), 33\u201382.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_74_2","volume-title":"Proceedings of the 5th Irish Workshop on Formal Methods (IWFM \u201901) (Workshops in Computing)","author":"Woodcock J.","year":"2001","unstructured":"J. Woodcock and A. Cavalcanti. 2001. A concurrent language for refinement. In Proceedings of the 5th Irish Workshop on Formal Methods (IWFM \u201901) (Workshops in Computing). A. Butterfield, G. Strong, and C. Pahl (Eds.), BCS."},{"key":"e_1_3_2_75_2","volume-title":"Using Z: Specification, Refinement, and Proof","author":"Woodcock J.","year":"1996","unstructured":"J. Woodcock and J. Davies. 1996. Using Z: Specification, Refinement, and Proof. Prentice-Hall."},{"key":"e_1_3_2_76_2","volume-title":"Proceedings of the 47th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL \u201920)","author":"Xia L.-Y.","year":"2020","unstructured":"L.-Y. Xia, Y. Zakowski, P. He, C.-K. Hur, G. Malecha, B. C. Pierce, and S. Zdancewic. 2020. Interaction trees: Representing recursive and impure programs in Coq. In Proceedings of the 47th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL \u201920). ACM. DOI: 10.1145\/3371119"},{"key":"e_1_3_2_77_2","volume-title":"Executable Denotational Semantics with Interaction Trees","author":"Xia Li-yao","year":"2022","unstructured":"Li-yao Xia. 2022. Executable Denotational Semantics with Interaction Trees. Ph.D. University of Pennsylvania, Pennsylvania, United States. ISBN: 9798351434490."},{"key":"e_1_3_2_78_2","volume-title":"Proceedings of the 27th International Conference on Engineering of Complex Computer Systems (ICECCS \u201923)","author":"Yan F.","year":"2023","unstructured":"F. Yan, S. Foster, and I. Habli. 2023. Automated compositional verification for robotic state machines using Isabelle\/HOL. In Proceedings of the 27th International Conference on Engineering of Complex Computer Systems (ICECCS \u201923). IEEE. DOI: 10.1109\/ICECCS59891.2023.00029"},{"key":"e_1_3_2_79_2","doi-asserted-by":"crossref","first-page":"100940","DOI":"10.1016\/j.jlamp.2023.100940","article-title":"Formally verified animation for RoboChart using interaction trees","volume":"137","author":"Ye K.","year":"2024","unstructured":"K. Ye, S. Foster, and J. Woodcock. 2024. Formally verified animation for RoboChart using interaction trees. Journal of Logical and Algebraic Methods in Programming 137 (February 2024), 100940.","journal-title":"Journal of Logical and Algebraic Methods in Programming"},{"key":"e_1_3_2_80_2","volume-title":"Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP \u201920)","author":"Zakowski Yannick","year":"2020","unstructured":"Yannick Zakowski, Paul He, Chung-Kil Hur, and Steve Zdancewic. 2020. An equational theory for weak bisimulation via generalized parameterized coinduction. In Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP \u201920). DOI: 10.1145\/3372885.3373813"},{"key":"e_1_3_2_81_2","volume-title":"Proceedings of the 12th International Conference on Verified Software: Theories, Tools, Experiments (VSTTE \u201920)","author":"Zaliva Vadim","year":"2020","unstructured":"Vadim Zaliva, Ilia Zaichuk, and Franz Franchetti. 2020. Verified translation between purely functional and imperative domain specific languages in HELIX. In Proceedings of the 12th International Conference on Verified Software: Theories, Tools, Experiments (VSTTE \u201920)."},{"key":"e_1_3_2_82_2","volume-title":"Proceedings of the 12th International Conference on Interactive Theorem Proving (ITP \u201921)","author":"Zhang Hengchu","year":"2021","unstructured":"Hengchu Zhang, Wolf Honor\u00e9, Nicolas Koh, Yao Li, Yishuai Li, Li-Yao Xia, Lennart Beringer, William Mansky, Benjamin C. Pierce, and Steve Zdancewic. 2021. Verifying an HTTP key-value server with interaction trees and VST. In Proceedings of the 12th International Conference on Interactive Theorem Proving (ITP \u201921). DOI: 10.4230\/LIPIcs.ITP.2021.32"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3702981","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3702981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:04Z","timestamp":1750295884000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3702981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,29]]},"references-count":81,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,5,31]]}},"alternative-id":["10.1145\/3702981"],"URL":"https:\/\/doi.org\/10.1145\/3702981","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,29]]},"assertion":[{"value":"2024-02-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}