Formal verification analysis demonstrates the correctness of regular expression matching algorithms, highlighting the practical benefits of computer-assisted reasoning in software reliability.
We demonstrate the benefit of computer assisted reasoning by proving correctness of some matching algorithms for regular expressions. We give a brief survey of the system used for verification, illustrate the problem, discuss the computation and usage of derivatives, present the machine assisted proofs and report on the effort for creating them.
No takes yet. Share an insight, caveat, or question.
Christoph Walther (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: