Refinement-based verification of sequential implementations of Stateflow charts

Alvaro Miyazawa
(University of York)
Ana Cavalcanti
(University of York)

Simulink/Stateflow charts are widely used in industry for the specification of control systems, which are often safety-critical. This suggests a need for a formal treatment of such models. In previous work, we have proposed a technique for automatic generation of formal models of Stateflow blocks to support refinement-based reasoning. In this article, we present a refinement strategy that supports the verification of automatically generated sequential C implementations of Stateflow charts. In particular, we discuss how this strategy can be specialised to take advantage of architectural features in order to allow a higher level of automation.

In John Derrick, Eerke Boiten and Steve Reeves: Proceedings 15th International Refinement Workshop (Refine 2011), Limerick, Ireland, 20th June 2011, Electronic Proceedings in Theoretical Computer Science 55, pp. 65–83.
Published: 17th June 2011.

ArXived at: https://dx.doi.org/10.4204/EPTCS.55.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org