TLA+ is a formal specification and verification language intended to help engineers specify, design and reason about complex, real-life algorithms and software or hardware systems. We explore its motivation, application and principles of design.

A subtle G++ bug from 2012, C++20's new comparison rules, and legacy Boost code can collide to crash Solidity's compiler on valid code. We unpack the surprising chain reaction and how to fix it.

Review: It's a history text, not a CS text

One of the neat things about AWS is that it's almost twenty years old. One of the unfortunate things about AWS is... that it's almost twenty years old

The first installment of the 'big bad' series described how a compiler can optimize your concur [...]

Note: Everything that follows is purely my personal opinion as an individual. It should not be seen as any sort of policy of the Meson buil...

Strongly Happens Before? It started innocently enough. I just wanted to brush up on C++ memory orderings. It’s been a while since I last stared into the abyss of std::atomic, so I figured, why not revisit some good ol’ std::memory_order mayhem?

Concurrency breaks ordering by design, but sometimes we need both. Explore three methods to preserve order in concurrent Go applications, from standard ReplyTo channels to sophisticated permission passing, with benchmarks and real-world trade-offs.

[My scheduler operations implementation]

A benefit of working on your own operating system is that you’re free from the usual "restraints" of coll...

Despite the fact that the Linux Kernel is mostly written in C, it makes broad use of some techn [...]

Frameworks for LLM Agents have been surprisingly disappointing. I want to offer some principles for building agents based on our own trial & error, and explain why some tempting ideas are actually quite bad in practice.

Discover the unique design challenges of creating a spherical planet out of Minecraft-like blocks.

Making performant dynamic manual memory management in C feel almost like garbage collection.