claimroutineinferred_dep
Clock invariant bounds shared facilities
Clock potential never increases, so shared facilities use space
bounds clocks and shared facility space
Claim·§11.5 The uniform space theorem·inside thmController interfaces have restoring O(B)-space implementations
Statement (paper)
Along an active chain with boundaries , the clock inequality gives , and since , all clocks are . Consequently the public scratch calculations are bounded in the same way, and the single shared facilities (master environment, cursor, catalyst, scratch and their global scan counters) use total space ; in the actual application, where , all these facilities and active records use bits.
In plain English
Along an active chain with boundaries , the potential never increases, so every clock is . Hence the public scratch calculations and the shared facilities (master environment, cursor, catalyst, scratch, scan counters) use space, which is when .
Why it's here
The local clock inequality from the allowance contract makes monotone down the chain, and then caps every descendant clock by the top value. This bounds the clock-dependent shared facilities, complementing the telescoping bound on live records, and yields the facility space and total space in the realization theorem's third assertion.
Classified routine:
Direct consequence of the local clock inequality in the allowance definition (def-ctrl-allowance): monotonicity of Ψ down the chain plus t_i ≤ Ψ gives the bound, which is then routine space bookkeeping complementing the telescoping claim.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §11.5 The uniform space theorem
- Page
- —
- Label
—- Line
sections/implementation.tex:1316
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Clock invariant bounds shared facilities" rests on def:ctrl-allowance
- infoinferred_depoutline: "Clock invariant bounds shared facilities" rests on claim-thm-ctrl-realization-5