PulseAugur
LIVE 07:37:04
research · [1 source] ·
0
research

AI governance theory formalized with machine-checked proofs in Coq

Researchers have developed a formal system for structural governance in cognitive workflow systems, with a significant portion of the work mechanized in Coq. The system introduces a coinductive safety predicate to ensure governance safety for infinite program behaviors. Key theorems establish uniformity of governance across recursive levels and the expressive completeness of four core primitives for intelligent systems. AI

Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →

IMPACT Formalizes governance for AI systems, potentially improving safety and reliability in complex cognitive workflows.

RANK_REASON This is a research paper presenting formal results and mechanized proofs for a new system.

Read on arXiv cs.AI →

COVERAGE [1]

  1. arXiv cs.AI TIER_1 · Alan L. McCann ·

    Mechanized Foundations of Structural Governance: Machine-Checked Proofs for Governed Intelligence

    arXiv:2604.27289v1 Announce Type: new Abstract: We present five results in the theory of structural governance for cognitive workflow systems. Three are mechanized in Coq 8.19 using the Interaction Trees library with parameterized coinduction; two are proved on paper with explici…