Decidable By Construction: Design-Time Verification for Truly Fearless Systems

arXiv:2603.25414 · cs.PL, cs.AI, cs.LG, cs.LO · Submitted 2026-03-26 · Read on arXiv

cs.PL, cs.AI, cs.LG, cs.LO

Submitted: 2026-03-26

Updated: 2026-10-08

Terminology

• Hypergraph — 1× in this paper · explained in 2 episodes
• Sparsity — 1× in this paper · explained in 4 episodes
• Verification — 1× in this paper · explained in 2 episodes

Related papers

• Griotte: Verified Compartmentalisation via Capabilities
• GraphMend: Code Transformations for Fixing Graph Breaks in PyTorch 2
• Two Birds One Stone: Effective Static Detection of Resource and Communication Deadlocks in Rust Programs
• Quasar: A Programming Language Specialized for LLM Code Actions