Thumbnail Image

Refinement-Based Verification of Communicating Unstructured Code

Jähnig, Nils; Göthel, Thomas; Glesner, Sabine

Formal model refinement aims at preserving safety and liveness properties of models. However, there is usually a verification gap between model and executed code, especially if concurrent processes are involved. The reason for this is that a manual implementation and further code optimizations can introduce implementation errors. In this paper, we present a framework that allows for formally proving a failures refinement between a CSP specification and its low-level implementation. The implementation is given in a generic unstructured language with gotos and an abstract communication instruction. We provide a failures-based denotational semantics of it with an appropriate Hoare calculus. Since failures-based refinement is compositional w.r.t. parallel composition of concurrent components and preserves safety and liveness properties, this contributes to reducing the verification gap between high-level specifications and their low-level implementations.
Published in: SEFM 2016: Software Engineering and Formal Methods, 10.1007/978-3-319-41591-8_5, Springer