Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about a novel tool for automatically testing state invariant predicates in finite-state machines through this 20-minute conference presentation from the Scheme 2025 workshop. Discover how this programming-based approach to Formal Languages and Automata Theory education addresses the challenge of writing comprehensive unit tests for state invariant predicates, which traditionally require large and impractical test suites. Explore the FSM domain-specific language embedded in Racket that enables students to design, implement, validate, and verify both deterministic and nondeterministic finite-state machines following a structured design recipe. Understand how the presented tool leverages a machine's transition relation to provide proper test coverage and enables thorough testing of all state invariant predicates using a single elegant expression, making the validation process more efficient and practical for educational purposes.
