Deterministic Replay Verification of Interval Programs over a Finite Primitive Core via Quantifier-Free Integer Certificates
Authors/Creators
Description
The Analytically Derived Interval Computation Integrity Certificates (ADIC) framework is a replay-verification framework for interval-based computations over a fixed finite primitive core. The paper does not introduce a new family of interval operators. Instead, it shows that the verifier obligations for this primitive core can be reduced to finite, instantiated, quantifier-free integer checks over a realized ledger. The framework combines a fixed-point encoding of real intervals, a strict Galois insertion, explicit Euclidean witnesses for nontrivial primitive rules, and a replayable compilation of program and specification constraints. For the fixed primitive core considered here, verifier acceptance is proved to imply the existence of a concrete trajectory and enclosure of the certified specification constraints. The verifier performs deterministic replay over the realized program and specification ledgers, with linear dependence on ledger size up to integer bit-complexity. The claim concerns the verifier core only; transfer to deployed floating-point implementations is handled separately through an explicit implementation-inclusion assumption.
A machine-checked Lean formalization of selected core lemmas and replay-verifier components associated with this work is publicly available at:
\url{https://github.com/GhostDriftTheory/adic-lean-proof/tree/main}.
The repository contains the formal development and proof scripts used to independently verify parts of the integer replay framework described in this paper.
Files
Deterministic Replay Verification of Interval Programs over a Finite Primitive Core via Quantifier-Free Integer Certificates.pdf
Files
(412.5 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:31232f7e08beae9e31182d5ed45646b5
|
46.0 kB | Download |
|
md5:4d5246289a0ece3205bd471702b88158
|
366.5 kB | Preview Download |