Newest papers

Beyond Policy Engines: Binding-Complete Execution Admission

Lin Wang, Mengting Wu, Yong Zhang, Jiang Deng · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.29701 · cited by 0 works (OpenAlex) · open-access PDF

French

Ses moteurs de politique actuels déterminent si les politiques évaluées permettent une demande, mais une décision ALLOW correcte n'établit pas une participation complète à la source de la gouvernance, une obligation de contexte exacte ou des motifs suffisants pour l'admission à l'exécution. Ce document examine le fossé entre l'évaluation de la politique et l'admission à l'exécution. Nous introduisons le contrat d'admission à l'exécution complète obligatoire (BCEAC), un contrat relatif à la gouvernance pour les obligations de preuve de source indépendamment déterminées, une syntaxe d'exécution de la langue limite (EBL) exacte et de l'adhésion contextuelle, et des résultats d'admission typés

Machine translation (Meta M2M100); the English original follows.

Abstract

Policy engines determine whether evaluated policies permit a request, but a correct ALLOW decision does not establish complete governance-source participation, exact context binding, or sufficient grounds for execution admission. This paper examines the gap between policy evaluation and execution admission. We introduce the Binding-Complete Execution Admission Contract (BCEAC), a governance-relative contract for independently determined source obligations, exact policy and contextual binding, and typed admission outcomes under explicit trust assumptions. We propose a conditionally engine-agnostic architecture in which participating backends must satisfy declared semantic profiles, adapter contracts, and contextual correspondence obligations; an Execution Boundary Language (EBL) authoring syntax remains optional. The architecture separates governance resolution, policy evaluation, independent admission verification, and downstream execution mediation. We investigate two distinct experimental tracks: a finite Governance Source Completeness study and an OPA/Cedar experiment with archived native-engine records examined by offline review. The OPA/Cedar archive comprises 72 scenarios and 144 strict case-engine records (120 native-invoked and 24 pre-native), with eight additional permissive controls outside the strict denominator. The offline review did not rerun the original native OPA/Cedar executables. The results provide bounded evidence while retaining historical failures and unresolved implementation defects. The work does not establish constitutional adequacy, general semantic refinement, authenticated currentness, machine-checked execution-safety theorems, or protected external effects. Its contribution is an explicit, falsifiable framework for determining what must be established between a policy decision and an execution-admission judgment.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Computer science, Syntax, Context (archaeology), Corporate governance, Defeasible estate, Programming language

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange