Philosophers May Dine - Definitively!

Taha, Safouan; Wolff, Burkhart; Ye, Lina

doi:10.1007/978-3-030-63461-2_23

Cited by 2 publications

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The utility of this link is to allow ITrees to act as a target of refinement. Existing mechanisations of the CSP set-based and relational semantics [35,15] can be used to capture nondeterministic specifications, and ITrees provide implementations.…”

Section: Circusmentioning

confidence: 99%

See 1 more Smart Citation

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

Foster¹,

Hur²,

Woodcock³

2021

Preprint

View full text Add to dashboard Cite

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.

show abstract

Section: Circusmentioning

confidence: 99%

“…Extensions of our theory support reasoning about hybrid dynamical systems, which make it ideal for verifying autonomous robots. Recently, the set-based theory of CSP has also been mechanised [35]. However, such reactive specifications, even if deterministic, are not executable and so there is a semantic gap with implementations.…”

Section: Introductionmentioning

confidence: 99%