A verification path that submits formal proof artifacts to a Lean kernel.
Lean verification
in GenOS.
A verification path that submits formal proof artifacts to a Lean kernel.
What it means
in GenOS.
A proof assistant checks proof terms against a formal kernel and a declared logic. A successful kernel check establishes a theorem relative to that formalization and trusted implementation; it does not verify informal premises automatically.
A verification path that submits formal proof artifacts to a Lean kernel.
The proposition Γ⊢P is accepted only when a proof term inhabits P under context Γ and the kernel's inference rules. The trusted computing base and imported axioms bound the claim.
Explore the mechanism: Lean verification
A qualitative teaching model of this concept. It does not run GenOS or validate its implementation.
The modeled transition may proceed. Change the assumption and move through the stages to inspect the decision path.
How it works
at a glance.
State proposition
A verification path that submits formal proof artifacts to a Lean kernel.
Submit proof term
The proposition Γ⊢P is accepted only when a proof term inhabits P under context Γ and the kernel's inference rules. The trusted computing base and imported axioms bound the claim.
Check with Lean kernel
Check with Lean kernel. A proof assistant checks proof terms against a formal kernel and a declared logic. A successful kernel check establishes a theorem relative to that formalization and trusted implementation; it does not verify informal premises automatically.
What is connected,
and how far.
The linked, versioned GenOS source defines this concept's supported operations and limits. The status axes describe the implementation and evidence recorded for this entry; they do not establish general mission success, scientific equivalence or behavior beyond that scope.
Lean is available in a narrow worker evaluation path and a bounded Omega CHECK adapter with declared axiom policy. Toolchain availability and encoding correctness remain required; the partial benchmark does not establish general theorem-proving coverage.
Failure modes have not yet been separately cataloged for this entry; follow the source and evidence links before relying on the mechanism.
The mechanism
behind the analogy.
An axiomatic basis for computer programming
C. A. R. Hoare · Communications of the ACM 12(10), 576–580
Sets out axiomatic reasoning about program correctness. A checked property is only as relevant as its specification and assumptions.
Open publication ↗Primary research describes the cited mechanism; specific technologies may instead cite their original technical documentation. These sources provide context and do not validate the GenOS implementation.
Scope and validation boundaries
The linked, versioned GenOS source defines this concept's supported operations and limits. The status axes describe the implementation and evidence recorded for this entry; they do not establish general mission success, scientific equivalence or behavior beyond that scope.