Complete Requirements-based Testing with Finite State Machines
Wen-ling Huang, Jan Peleska

TL;DR
This paper introduces new requirements-based testing methods for deterministic finite state machines, providing strategies with proven fault coverage guarantees suitable for safety-critical systems.
Contribution
It presents two novel test generation strategies for requirements-based testing with formal guarantees, and discusses their practical applicability and complexity considerations.
Findings
First strategy guarantees requirement satisfaction if passed
Second strategy guarantees requirement satisfaction if and only if passed
Preferred for safety-critical systems due to thoroughness
Abstract
In this paper, new contributions to requirements-based testing with deterministic finite state machines are presented. Elementary requirements are specified as triples consisting of a state in the reference model, an input, and the expected reaction of the system under test defined by a set of admissible outputs, allowing for different implementation variants. Composite requirements are specified as collections of elementary ones. Two requirements-driven test generation strategies are introduced, and their fault coverage guarantees are proven. The first is exhaustive in the sense that it produces test suites guaranteeing requirements satisfaction if the test suite is passed. If the test suite execution fails for a given implementation, however, this does not imply that the requirement has been violated. Instead, the failure may indicate an arbitrary violation of I/O-equivalence, which…
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.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Software Reliability and Analysis Research · Formal Methods in Verification
