A second entry in the Abstract Interpretation series that gently builds a more formal understanding of value abstraction in program analysis. It also covers soundness and precision as major properties of an abstract domain.

This is a very basic introduction to Abstract Interpretation, merely setting the scene and gaining intuition about how to tease interesting semantic properties out of a program.

If you're working on a Ghidra plugin that performs some non-trivial program analysis you might be interested in unit testing your algorithms, this article is a collection of notes on set those up.

In this article I'm trying to clarify what constitutes superintelligence and push back against the idea of it being "beyond our reasoning".

In this article we start from a simple and inefficient algorithm that calculates population count a.k.a. Hamming weight, and then iteratively arrive at one of the efficient implementations that's in common use today.