Some things I learned by attending POPL talks.
The LFI-Problog algorithm, for doing inference on probabilistic logic programs.
How the CUP parser generator explains conflicts.
A system for implementing and verifying distributed algorithms.
A unified model for understanding many transactional systems.
Vector addition systems are a model of computation.
For this model, coverability is one of the easiest decision problems.
This post presents an old (1978) upper bound, with accompanying code.
Circular buffers are one of the most fundamental and pervasive data structures.
They are an efficient implementation for buffering linear sequences.
Tree buffers are a more general data structure.