Mathematically Proven Code
Serdyuk, Kyrill ; Wolf, Brandon
Serdyuk, Kyrill
Wolf, Brandon
Citations
Altmetric:
License
0
License
DOI
Abstract
Computers always do what they are told, but how do you know you told them what you meant? This is the purpose of formal verification, the art of proving the correctness of code using mathematics. Using the Lean Theorem Prover, we construct theorems and proofs that verify the correctness of the translation of regular expressions into finite automata. This translation is a key step in the construction of efficient search algorithms used in a variety of thechnologies from text editing to ad-blockers.
Description
Undergraduate
Date
2023-01-01
