AI Navigate

The FABRIC Strategy for Verifying Neural Feedback Systems

arXiv cs.AI / 3/11/2026

Ideas & Deep AnalysisTools & Practical UsageModels & Research

Key Points

  • The paper introduces new algorithms for computing over- and underapproximations of backward reachable sets in nonlinear neural feedback systems, addressing a previously underexplored aspect of verification.
  • It integrates these backward reachability algorithms with existing forward reachability methods into a unified approach named FaBRIC (Forward and Backward Reachability Integration for Certification).
  • Experimental evaluation shows that FaBRIC significantly outperforms prior state-of-the-art techniques on representative benchmarks, improving the efficiency and scalability of verifying neural feedback systems.
  • The work fills a critical gap in the verification domain by leveraging backward reachability to enhance the robustness and reliability analysis of dynamical systems controlled by neural networks.

Computer Science > Artificial Intelligence

arXiv:2603.08964 (cs)
[Submitted on 9 Mar 2026]

Title:The FABRIC Strategy for Verifying Neural Feedback Systems

View a PDF of the paper titled The FABRIC Strategy for Verifying Neural Feedback Systems, by I. Samuel Akinwande and 3 other authors
View PDF HTML (experimental)
Abstract:Forward reachability analysis is a dominant approach for verifying reach-avoid specifications in neural feedback systems, i.e., dynamical systems controlled by neural networks, and a number of directions have been proposed and studied. In contrast, far less attention has been given to backward reachability analysis for these systems, in part because of the limited scalability of known techniques. In this work, we begin to address this gap by introducing new algorithms for computing both over- and underapproximations of backward reachable sets for nonlinear neural feedback systems. We also describe and implement an integration of these backward reachability techniques with existing ones for forward analysis. We call the resulting algorithm Forward and Backward Reachability Integration for Certification (FaBRIC). We evaluate our algorithms on a representative set of benchmarks and show that they significantly outperform the prior state of the art.
Subjects: Artificial Intelligence (cs.AI); Systems and Control (eess.SY)
Cite as: arXiv:2603.08964 [cs.AI]
  (or arXiv:2603.08964v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2603.08964
Focus to learn more
arXiv-issued DOI via DataCite

Submission history

From: Samuel Akinwande [view email]
[v1] Mon, 9 Mar 2026 21:54:07 UTC (43 KB)
Full-text links:

Access Paper:

Current browse context:
cs.AI
< prev   |   next >
Change to browse by:

References & Citations

export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
Links to Code Toggle
Papers with Code (What is Papers with Code?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.