Bounded verification map

Different tools establish different properties.

LawVM combines CI checks, runtime contracts, generated tests, bounded model proofs, experimental independent checking, and case-specific external review. Each conclusion stays inside its mechanism and scope.

Reviewed: 11 August 2026Development snapshot
Maximum claim: this public projection maps named mechanisms to bounded properties. A formal certificate, complete test inventory, external audit, and frontend-by-frontend gate evidence require additional artifacts.

Property → tool → gate

What runs, what blocks, and what remains bounded

Verification mechanisms, enforcement, and limits
MechanismWhenBlocking?EstablishesOutside this mechanism
Ruff and TyCIyesDeclared lint and type propertiesReplay or legal-state correctness
Runtime construction contractsConstruction / runtimeyesNamed carrier and tree-operation invariantsComplete jurisdictional semantics
Property, stateful, metamorphic, and exhaustive testsCI / selected suitesyesNamed properties over real code, generated cases, and bounded spacesProof over every input or source universe
Z3 modelsManualnoTemporal, occupancy, and precedence properties for exact encodingsModel-to-Python refinement
TLA+ temporal-overlay modelNot TLC-run in current harnessnoAn inspectable finite abstraction and invariant vocabularyCurrent implementation conformance; the model is structurally stale
Executable temporal mirrorsCIyesSelected temporal invariants against the real selectorComplete legal-time doctrine or every model invariant
Experimental structural / trace checkerRepository fixturesnoBounded roots, links, and declared transition foldingSource-language entailment, authority, or a stable certificate product
External publisher or expert reviewCase-specificoutside CIDisposition of the exact reviewed caseGlobal accuracy or completeness

Model-to-code drift

Executable tests check the current selector.

bounded model

Z3

SMT proofs establish named propositions for deliberately encoded finite models. Their assumptions and mapping to production code remain separate review objects.

structurally stale

TLA+

The temporal-overlay source model preserves invariant vocabulary. Later expiry, tombstone behavior, and a regime-handoff rule remain to be incorporated.

real code in CI

Hypothesis mirrors

Generated tests call the actual selector for selected invariants, so implementation drift can fail CI. They still cover declared properties rather than all legal-time semantics.

Proof boundary

Open end-to-end proof obligations.

Refinement gap

A formal map from the TLA+ and Z3 abstractions to the production Python implementation remains open.

Amendment-semantics gap

Arbitrary legislative prose still requires a general formal semantics and independent entailment checker.

Profile-specific enforcement

Mutation observation, receipts, admission, and blocking differ by frontend, family, profile, and lane.

External audit gap

A complete audit would need independent review of the implementation, source universe, evidence plane, and release process.