Search Results

Documents authored by Woodcock, Jim

Found 2 Possible Name Variants:

Woodcock, Jim C. P.

Document
DOI: 10.4230/DagSemProc.09381.1
09381 Extended Abstracts Collection – Refinement Based Methods for the Construction of Dependable Systems

Authors: Jean-Raymond Abrial, Michael Butler, Rajev Joshi, Elena Troubitsyna, and Jim C. P. Woodcock

Published in: Dagstuhl Seminar Proceedings, Volume 9381, Refinement Based Methods for the Construction of Dependable Systems (2010)

Abstract
With our growing reliance on computers, the total societal costs of their failures are hard to underestimate. Nowadays computers control critical systems from various domains such as aerospace, automotive, railway, business etc. Obviously, such systems must have a high degree of dependability – a degree of trust that can be justifiably placed on them. Although the currently operating systems do have an acceptable level of dependability, we believe that they development process is still rather immature and ad-hoc. The constantly growing system complexity poses an increasing challenge on the system developers and requires significant improvement on the existing developing practice. To address this problem, we investigated how to establish a set of refinement-based engineering methods that can provide the designers with a systematic methodology for development of complex systems.
Cite as

Jean-Raymond Abrial, Michael Butler, Rajev Joshi, Elena Troubitsyna, and Jim C. P. Woodcock. 09381 Extended Abstracts Collection – Refinement Based Methods for the Construction of Dependable Systems. In Refinement Based Methods for the Construction of Dependable Systems. Dagstuhl Seminar Proceedings, Volume 9381, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{abrial_et_al:DagSemProc.09381.1,
  author =	{Abrial, Jean-Raymond and Butler, Michael and Joshi, Rajev and Troubitsyna, Elena and Woodcock, Jim C. P.},
  title =	{{09381 Extended Abstracts Collection – Refinement Based Methods for the Construction of Dependable Systems}},
  booktitle =	{Refinement Based Methods for the Construction of Dependable Systems},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9381},
  editor =	{Jean-Raymond Abrial and Michael Butler and Rajeev Joshi and Elena Troubitsyna and Jim C. P. Woodcock},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09381.1},
  URN =		{urn:nbn:de:0030-drops-23746},
  doi =		{10.4230/DagSemProc.09381.1},
  annote =	{Keywords: Specification, refinement, verification, modelling, dependable systems}
}

Woodcock, Jim

Document
DOI: 10.4230/LIPIcs.CONCUR.2021.20
Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL

Authors: Simon Foster, Chung-Kil Hur, and Jim Woodcock

Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)

Abstract
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.
Cite as

Simon Foster, Chung-Kil Hur, and Jim Woodcock. Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{foster_et_al:LIPIcs.CONCUR.2021.20,
  author =	{Foster, Simon and Hur, Chung-Kil and Woodcock, Jim},
  title =	{{Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL}},
  booktitle =	{32nd International Conference on Concurrency Theory (CONCUR 2021)},
  pages =	{20:1--20:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-203-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{203},
  editor =	{Haddad, Serge and Varacca, Daniele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.20},
  URN =		{urn:nbn:de:0030-drops-143973},
  doi =		{10.4230/LIPIcs.CONCUR.2021.20},
  annote =	{Keywords: Coinduction, Process Algebra, Theorem Proving, Simulation}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact