mlsanityData to 7 Oct 2026

Protected Cores Are Not Enough: Certifying AI-Proposed Revisions of Temporal Specifications

arXiv 2609.33461 ↗First posted 27 Sep 2026cs.LO cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Runtime monitoring traditionally evaluates a specification that is fixed before execution or externally modified when requirements change. In learning-enabled and data-intensive systems, however, the temporal relationships represented by a specification may themselves evolve. Allowing an AI component to directly replace a formal specification is unsafe: it may overfit transient behavior, weaken protected requirements, or activate statistically unsupported revisions. We introduce an intersymbolic architecture in which an untrusted AI proposer suggests temporal specification revisions and a symbolic governor controls their activation. Two results organize the framework. First, origin-version semantics makes the outcome of each obligation invariant to later revisions. Second, aggregate certification can conceal systematic failures on protected triggers; simultaneous aggregate and core-conditional post-selection certification controls both targets. A structural invariant preserves designer-protected components, and a proposer-independent lifetime error bound supports repeated activation decisions. The statistical bound concerns the predictable means of completed certification samples; interpreting it as future operational validity requires an additional stability assumption. Controlled synthetic experiments use a frozen supervised AI proposer to illustrate the masked-core failure at one decision and across repeated governed revisions. The proposer is a supervised regressor trained offline on synthetic tasks and frozen before use; it ranks candidates by predicted aggregate margin and never observes the protected-trigger success rate, so the masked-core failure arises from optimising the aggregate rather than from an adversary constructed by hand.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 23 references that are in the map. First posted on arXiv 27 Sep 2026.

Builds on

11 of 23 references.

References · 11

  1. 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 220
  2. 2020Estimating means of bounded random variables by bettingcited by 164
  3. 2021Tracking the risk of a deployed model and detecting harmful distribution shiftscited by 38
  4. 2025WATCH: Adaptive Monitoring for AI Deployments via Weighted-Conformal Martingalescited by 13
  5. 2026Self-Evolving Agents with Anytime-Valid Certificatescited by 6
  6. 2024Intersymbolic AI: Interlinking Symbolic AI and Subsymbolic AIcited by 3
  7. 2023Runtime Verification of Self-Adaptive Systems with Changing Requirementscited by 2
  8. 2026Robust Probabilistic Shielding for Safe Offline Reinforcement Learningcited by 2
  9. 2026Robust Shielding for Safe Reinforcement Learningcited by 2
  10. 2026Multi-Property Temporal Logic Monitoringcited by 1
  11. 2026SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logiccited by 1

Built on by

Not cited yet.