Image de couverture de livre

Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundaries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	McCann, Alan L.
Format:	Preprint
Publié:	2026
Sujets:	Artificial Intelligence Logic in Computer Science Programming Languages D.2.4; D.3.1; F.3.1; I.2.0
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Algebraic Semantics of Governed Execution: Monoidal Categories, Effect Algebras, and Coterminous Boundaries
par: McCann, Alan L.
Publié: (2026)

Mechanized Foundations of Structural Governance: Machine-Checked Proofs for Governed Intelligence
par: McCann, Alan L.
Publié: (2026)

The Two Boundaries: Why Behavioral AI Governance Fails Structurally
par: McCann, Alan L.
Publié: (2026)

Certified Purity for Cognitive Workflow Executors: From Static Analysis to Cryptographic Attestation
par: McCann, Alan L.
Publié: (2026)

Governed Metaprogramming for Intelligent Systems: Reclassifying Eval as a Governed Effect
par: McCann, Alan L.
Publié: (2026)

Cryptographic Registry Provenance: Structural Defense Against Dependency Confusion in AI Package Ecosystems
par: McCann, Alan L.
Publié: (2026)

Constrained LTL Specification Learning from Examples
par: Zhang, Changjian, et autres
Publié: (2024)

Intent-Driven Computing: A Computational Model for Governed Autonomous Systems
par: McCann, Alan L.
Publié: (2026)

Verified VCG and Verified Compiler for Dafny
par: Nezamabadi, Daniel, et autres
Publié: (2025)

Modal Verification Patterns for Systems Software
par: Kuru, Ismail, et autres
Publié: (2025)

Context-Dependent Effects and Concurrency in Guarded Interaction Trees
par: Stepanenko, Sergei, et autres
Publié: (2025)

A Gentle Overview of Asynchronous Session-based Concurrency: Deadlock Freedom by Typing
par: Heuvel, Bas van den, et autres
Publié: (2024)

Complementing an imperative process algebra with a rely/guarantee logic
par: Middelburg, C. A.
Publié: (2025)

Probabilistic imperative process algebra
par: Middelburg, C. A.
Publié: (2026)

Verification of E-Voting Algorithms in Dafny
par: Büttner, Robert, et autres
Publié: (2025)

Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration (Extended Version)
par: Sextl, Florian, et autres
Publié: (2023)

SMT-based Symbolic Model-Checking for Operator Precedence Languages
par: Chiari, Michele, et autres
Publié: (2024)

Sound and Complete Invariant-Based Heap Encodings (Technical Report)
par: Esen, Zafer, et autres
Publié: (2025)

Semi-Automated Modular Formal Verification of Critical Software: Liveness and Completeness Thresholds
par: Reinhard, Tobias
Publié: (2024)

Automatic Function Annotations for Hoare Logic
par: Matichuk, Danielle
Publié: (2012)

Summa Summarum: Moessner's Theorem without Dynamic Programming
par: Danvy, Olivier
Publié: (2024)

Uniqueness is Separation
par: O'Connor, Liam, et autres
Publié: (2026)

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
par: Accattoli, Beniamino, et autres
Publié: (2025)

Baking for Dafny: A CakeML Backend for Dafny
par: Nezamabadi, Daniel, et autres
Publié: (2025)

Decidable Reversible Equivalences for Finite Petri Nets
par: Gorrieri, Roberto, et autres
Publié: (2025)

Space-time process algebra with asynchronous communication
par: Bergstra, J. A., et autres
Publié: (2024)

Dormancy-aware timed branching bisimilarity, with an application to communication protocol analysis
par: Middelburg, C. A.
Publié: (2021)

On the Decidability of Verification under Release/Acquire
par: Conrado, Giovanna Kobus, et autres
Publié: (2026)

The pitfalls of verifying floating-point computations
par: Monniaux, David
Publié: (2007)

FastLEC: Parallel Datapath Equivalence Checking with Hybrid Engines
par: Zhang, Xindi, et autres
Publié: (2025)

Simplifying Safety Proofs with Forward-Backward Reasoning and Prophecy
par: Frenkel, Eden, et autres
Publié: (2026)

Explicit Weakening
par: Wadler, Philip
Publié: (2024)

"What Is It That You Don't Understand?" Language Games and Black Box Algorithms
par: Demichelis, Remy
Publié: (2026)

Semantics for 2D Rasterization
par: Kulkarni, Bhargav, et autres
Publié: (2026)

Compile-Time Tensor Shape Checking via Staged Shape-Dependent Types
par: Suwa, Takashi, et autres
Publié: (2026)

NeuroLog: Reasoning You Can Audit -- Neuro-Symbolic Vulnerability Discovery via LLM Facts, Datalog, and SMT
par: Rawat, Sanjay
Publié: (2026)

Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
par: Waldinger, Richard
Publié: (2025)

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
par: Prebet, Enguerrand, et autres
Publié: (2026)

Uniform Substitution for Differential Refinement Logic
par: Prebet, Enguerrand, et autres
Publié: (2024)

Imandra CodeLogician: Neuro-Symbolic Reasoning for Precise Analysis of Software Logic
par: Lin, Hongyu, et autres
Publié: (2026)