Skip to content
Book Open access

Explaining Network Configurations Under Failures via Localized Subspecifications

Aug 2026 · Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · pp. 1839-1844 · 0 citations · 24 references
Computer Science

TL;DR

This work explores fault-tolerant subspecifications as a way to bridge the gap between network fault-tolerance verification and operators' guidance on which configuration fields are responsible for correctness or which local edits are safe under the full failure model.

Abstract

Network fault-tolerance verification checks whether configurations satisfy properties such as reachability and isolation under a bounded set of failures, but produces only a global pass/fail result. Operators are left without guidance on which configuration fields are responsible for correctness or which local edits are safe under the full failure model. We explore fault-tolerant subspecifications as a way to bridge this gap: for each configuration location h, a constraint ψ(h) that characterizes the replacement values guaranteed to preserve the global property across all failure scenarios within the budget. Our approach combines per-device SMT encodings with a failure-aware symbolic route; guarded routing branches induce branch-local constraints on h, whose intersection yields the fault-tolerant subspecification. We present the approach, illustrate it on a small BGP example, and discuss preliminary results that demonstrate feasibility and interpretability. We conclude with open problems and directions for future work.

Read PDF

Similar papers

Preprint Sep 2026

Specification-Guided Path Shortcutting for Efficient Probabilistic Model Checking

Given the safety-critical nature of many embedded systems, their safety assurance is essential. Because such systems are typically stochastic, probabilistic model checking is a particularly important technique. However, there is a well-known scalability issue due to state-space explosion, especially when verifying comp...

T. Matsumoto, Kazuki Watanabe, Masaki Waga · 0 citations
Book Open access Oct 2026

Repairing Conformance Violations with a Reference Model in the Context of Automata Decomposition

Existing conformance-checking approaches typically compare a reference model with a monolithic concrete model and therefore do not support decompositions into interacting subcomponents. We present a conformance-checking and repair approach for time-synchronous component-and-connector subarchitectures with statechart-ba...

Bahareh Taghavi, M. Stachon, Adrian Marin et al. · 0 citations
Preprint Oct 2026

Structural Analysis of Hybrid-Trace Nets: An Optimization Approach

Fault and error detection is crucial for ensuring the correctness of safety-critical systems. Safety verification often addresses reachability of bad system states, where exhaustive state inspection may be intractable due to the large state spaces of complex systems. We propose a reachability relaxation for hybrid trac...

L. Nguyen, C. Bonial, John G. Rogers et al. · 0 citations
Preprint Oct 2026

StateSync-GKR: Machine-Checking the Trust Chain from Sparse-Merkle State Transitions to GKR Verification

GKR soundness bounds false output claims about arithmetic circuits, but an application also needs assurance that its circuit encodes the intended state transition. We machine-check this connection for sparse-Merkle membership, non-membership, and update in Isabelle/HOL. A compiler model relates circuit acceptance to tr...

Jinwoo Kim · 0 citations
Open access Oct 2026

ConUT: Condition-Aware Test Generation for Complex Java Code

Automatically generating high-coverage unit tests for complex Java methods remains a formidable challenge, particularly when execution paths are guarded by intricate control-flow nesting and cross-class state dependencies. Existing LLM-based approaches predominantly follow a goal-driven paradigm, relying on unguided co...

Rui-Guo Yu, Rui-Qi Dong, Xi Xiao et al. · 0 citations
Preprint Sep 2026

Reachability, Not Observation: Containing Systems Whose Wiring Changes

Containment decisions -- where to put a firewall, which links to monitor, what a program may reach -- are computed from an observed structure, and observation is a snapshot. We ask what a snapshot misses when the wiring changes over time. On a hypercube whose active dimension rotates, a balanced split shows zero crossi...

Yoshiaki Takashita · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.