We are excited to present our new paper at @pldi! The paper describes a family of ultra-cheap relational abstract domains, that can capture relations between variables such as y = 3 x + b or y = (x rot 3) xor 0xFF, among many others. These domains work particularly well with programs in SSA form (or when combined with our SSA-based abstract domains). A short, hopefully accessible, summary available here https://codex.top/papers/2025-pldi-relational-abstractions-labeled-uf.html. If you are assisting #PLDI, looking for a postdoc, research, or engineering position in analysis/compilers, or just want to chat -- feel free to reach out!