From: Tobias Nipkow <nipkow@in.tum.de>
Verified Complete Test Strategies for Finite State Machines
Robert Sachtleben
This entry provides executable formalisations of complete test generation
algorithms for finite state machines. It covers testing for the
language-equivalence and reduction conformance relations, supporting the former
via the W, Wp, HSI, H, SPY and SPYH-methods, and the latter via adaptive state
counting. The test strategies are implemented using generic frameworks, allowing
for reuse of shared components between related strategies. This work is
described in the author's doctoral thesis.
https://www.isa-afp.org/entries/FSM_Tests.html
Enjoy!
smime.p7s
Last updated: Jan 04 2025 at 20:18 UTC