Well-Behaved (Co)algebraic Semantics of Regular Expressions Formally Verified in Dafny
The denotational and operational semantics of regular expressions are formally verified to coincide, up to pointwise bisimilarity, using the Dafny programming language and verification system.
