From May 2015 to May 2016 I am working on my master thesis. As part of that project I am writing software to verify whether a certain state can occur within a computation. This is also the basic goal of Formal Verification; a research area where source code is verified for correctness.

The subtitle uses the word "non-introduction" because my master thesis itself is about differential cryptanalysis, which I won't cover in the talk. I will only cover practical parts of my master thesis which will give us a basic understanding of primitives in Formal Verification.

Let's be more specific: In this talk I will discuss a few python libraries for SAT solving (I wrote) and finally introduce a package modeling bitvectors which can be used to describe computed values symbolically.