Bounded Invariant Checking for Stateflow
Predrag Filipovikj (Scania CV AB), Gustav Ung (Scania CV AB), Dilian, Gurov (KTH Royal Institute of Technology), Mattias Nyberg (Scania CV AB)

TL;DR
This paper introduces a formal verification method using bounded model checking to analyze Stateflow models for invariant properties, ensuring safety in industrial applications.
Contribution
It presents a novel symbolic transition system representation and an incremental BMC approach for Stateflow models, with a prototype tool implementation.
Findings
Effective verification of industrial Stateflow models demonstrated.
Prototype tool successfully applied to example and industrial models.
Preliminary results show promising performance.
Abstract
Stateflow models are complex software models, often used as part of industrial safety-critical software solutions designed with Matlab Simulink. Being part of safety-critical solutions, these models require the application of rigorous verification techniques for assuring their correctness. In this paper, we propose a refutation-based formal verification approach for analyzing Stateflow models against invariant properties, based on bounded model checking (BMC). The crux of our technique is: i) a representation of the state space of Stateflow models as a symbolic transition system (STS) over the symbolic configurations of the model, and ii) application of incremental BMC, to generate verification results after each unrolling of the next-state relation of the transition system. To this end, we develop a symbolic structural operational semantics (SSOS) for Stateflow, starting from an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
