Tag
compiler-optimisation
- Sep 11, 2026 Slice Bounds Checks and the Conditions for Eliding Them How a length-carrying descriptor makes every index a checked operation, what the branch costs when it is not removable, and which static facts let a compiler prove it away. memory systems
- Sep 11, 2025 The DRF-SC Guarantee and What It Buys a Programmer Why race-free programs are sequentially consistent on hardware that is not, and the composition rules that let this promise survive layers of abstraction. memory systems
- Aug 20, 2025 Loop Dependences and What Blocks Vectorisation Why a loop that looks parallel to a reader is often sequential to a compiler, which dependences forbid combining iterations, and how runtime checks and reductions recover part of what static analysis loses. computer architecture
- Jul 11, 2024 Reassociation, Excess Precision, and the Limits of Bitwise Reproducibility Why identical source can produce different bits on two machines, which compiler transformations are responsible, and how ordering or exactness restores a stable result. scientific computing