This chapter discusses the definition of formal verification as stating mathematical properties about programs and their proofs. It explores different flavors and implementations of the language of mathematics and the use of proof assistants for writing proofs.
In this week's episode, we sit down with Martin Lundfall from Dapphub & MakerDAO to discuss formal verification - a topic request that comes directly from the Zero Knowledge audience.
We cover what formal verification is, where it makes sense, where it doesn't, the k-framework, how different this approach is to the "move fast and break things" approach, and much more.