Blog: Formal Verification

In the first part of our series about formal verification, we discuss the roots of formal verification in fields such as mathematical logic and theoretical computer science.

In the previous post, we briefly introduced the reader to dependently typed programming and theorem proving in Agda. Now we present an empty type to work with constructive negation. We discuss Marko…

Last week, we started a new blog series to introduce you to creating constructive and non-constructive proofs in Agda..

Where to start with Agda formal verification? Get familiar with the constructive logic behind it.