Work

X Proofs: Checked Layouts and Memoised Parallel Calls

Year: 2026
Type: preprint
Abstract: X Proofs provides mechanised semantic models for X’s ten language constructs in Lean 4. We prove preservation results for record-layout translation and concurrent memoisation, then combine them. For records stored in separate columns, we prove that layout translation preserves values, observations and the first invariant failure. The theorem covers writes through borrowed fields, any finite number of fields and any Boolean record invariant. For memoised calls, we prove that every completed response equals the uncached result when lookup and publication are atomic, even with simultaneous misses and colliding entries. We compose the two results to cover successful record updates followed by read-only calls. We prove that a decoded write and guard satisfying our validation criterion have the same outcome as the source write, then apply the checker to selected LLVM output. Tests of compiled X programs and executable counterexamples show why correctness depends on tracking record owners, checking each write immediately and comparing complete cache keys. Repository: https://github.com/WillKirkmanM/x-proofs
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W7235217752
Cites:
Cited by:
Related to: 10