Formally Verified Simulations of State-Rich Processes using Interaction Trees in Isabelle/HOL

Simon Foster, Chung-Kil Hur, Jim Woodcock

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Simulation and formal verification are important complementary techniques necessary in high assurance model-based systems development. In order to support coherent results, it is necessary to provide unifying semantics and automation for both activities. In this paper we apply Interaction Trees in Isabelle/HOL to produce a verification and simulation framework for state-rich process languages. We develop the core theory and verification techniques for Interaction Trees, use them to give a semantics to the CSP and Circus languages, and formally link our new semantics with the failures-divergences semantic model. We also show how the Isabelle code generator can be used to generate verified executable simulations for reactive and concurrent programs.
Original languageEnglish
Title of host publicationInternational Conference on Concurrency Theory (CONCUR 2021)
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany
Publication statusPublished - 13 Aug 2021

Publication series

ISSN (Electronic)1868-8969

Bibliographical note

14 pages, submitted to CONCUR 2021


  • cs.LO

Cite this