On the public citation graph

Modular Control Plane Verification via Temporal Invariants

0 signed · 72 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/10722167_15openalex-snapshot
Counterexample-Guided Abstraction Refinement
inferredcites →https://doi.org/10.1007/3-540-36577-x_24openalex-snapshot
Learning Assumptions for Compositional Verification
inferredcites →https://doi.org/10.1007/3-540-44829-2_14openalex-snapshot
Thread-Modular Model Checking
inferredcites →https://doi.org/10.1007/3-540-63166-6_6openalex-snapshot
A compositional rule for hardware design refinement
inferredcites →https://doi.org/10.1007/978-3-030-11245-5_18openalex-snapshot
Fast BGP Simulation of Large Datacenters
inferredcites →https://doi.org/10.1007/978-3-319-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-319-10575-8_12openalex-snapshot
Compositional Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_14openalex-snapshot
Automated Assume-Guarantee Reasoning by Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-16901-4_15openalex-snapshot
Assume-Guarantee Reasoning with Local Specifications
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_32openalex-snapshot
Threader: A Constraint-Based Verifier for Multi-threaded Programs
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_5openalex-snapshot
In Transition From Global to Modular Temporal Reasoning about Programs
inferredcites →https://doi.org/10.1007/bfb0028765openalex-snapshot
You assume, we guarantee: Methodology and case studies
inferredcites →https://doi.org/10.1007/bfb0042302openalex-snapshot
Reducibility in analysis of coordination
inferredcites →https://doi.org/10.1007/s00165-017-0436-0openalex-snapshot
Automated circular assume-guarantee reasoning
inferredcites →https://doi.org/10.1023/a:1008739929481openalex-snapshot
Reactive Modules
inferredcites →https://doi.org/10.1109/90.993304openalex-snapshot
The stable paths problem and interdomain routing
inferredcites →https://doi.org/10.1109/icnp55882.2022.9940333openalex-snapshot
Kirigami, the Verifiable Art of Network Cutting
inferredcites →https://doi.org/10.1109/tnet.2005.857111openalex-snapshot
An algebraic theory of dynamic network routing
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/1080091.1080094openalex-snapshot
Metarouting
inferredcites →https://doi.org/10.1145/1402946.1402967openalex-snapshot
A scalable, commodity data center network architecture
inferredcites →https://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferredcites →https://doi.org/10.1145/2775051.2676980openalex-snapshot
Iris
inferredcites →https://doi.org/10.1145/2815400.2815428openalex-snapshot
IronFleet
inferredcites →https://doi.org/10.1145/2908080.2908118openalex-snapshot
Ivy: safety verification by interactive generalization
inferredcites →https://doi.org/10.1145/2934872.2934876openalex-snapshot
Fast Control Plane Analysis Using an Abstract Representation
inferredcites →https://doi.org/10.1145/2934872.2934909openalex-snapshot
Don't Mind the Gap
inferredcites →https://doi.org/10.1145/2983990.2984012openalex-snapshot
Scalable verification of border gateway protocol configurations with an SMT solver
inferredcites →https://doi.org/10.1145/3062341.3062367openalex-snapshot
Network configuration synthesis with abstract topologies
inferredcites →https://doi.org/10.1145/3098822.3098834openalex-snapshot
A General Approach to Network Configuration Verification
inferredcites →https://doi.org/10.1145/3158116openalex-snapshot
Programming and proving with distributed protocols
inferredcites →https://doi.org/10.1145/3230543.3230561openalex-snapshot
Asynchronous convergence of policy-rich distributed bellman-ford routing protocols
inferredcites →https://doi.org/10.1145/3230543.3230583openalex-snapshot
Control plane compression
inferredcites →https://doi.org/10.1145/3276529openalex-snapshot
Compositional programming and testing of dynamic distributed systems
inferredcites →https://doi.org/10.1145/3341301.3359651openalex-snapshot
I4
inferredcites →https://doi.org/10.1145/3341302.3342094openalex-snapshot
Validating datacenters at scale
inferredcites →https://doi.org/10.1145/3371110openalex-snapshot
Abstract interpretation of distributed network control planes
inferredcites →https://doi.org/10.1145/3385412.3386019openalex-snapshot
NV: an intermediate language for verification of network control planes
inferredcites →https://doi.org/10.1145/3387514.3406217openalex-snapshot
Accuracy, Scalability, Coverage
inferredcites →https://doi.org/10.1145/3422604.3425930openalex-snapshot
A General Framework for Compositional Network Modeling
inferredcites →https://doi.org/10.1145/3591222openalex-snapshot
Modular Control Plane Verification via Temporal Invariants
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/509705.509707openalex-snapshot
An assume-guarantee rule for checking simulation
inferredcites →https://doi.org/10.17487/rfc1058openalex-snapshot
Routing Information Protocol
inferredcites →https://doi.org/10.17487/rfc1142openalex-snapshot
OSI IS-IS Intra-domain Routing Protocol
inferredcites →https://doi.org/10.17487/rfc1267openalex-snapshot
Border Gateway Protocol 3 (BGP-3)
inferredcites →https://doi.org/10.5555/1251203.1251207openalex-snapshot
Detecting BGP configuration faults with static analysis
inferredcites →https://doi.org/10.5555/602902.602958openalex-snapshot
Decomposing refinement proofs using assume-guarantee reasoning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-66064-1_4openalex-snapshot
Specifying and Verifying a Real-World Packet Error-Correction System
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_7openalex-snapshot
Fast SMT-Based Fault Tolerance Verification for Wide Area Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_7openalex-snapshot
Model Checking for Flexible Network Protocols
inferred← citeshttps://doi.org/10.1016/j.comnet.2026.112177openalex-snapshot
DeepConfig: A verifiable configuration generation framework for MAN overlays using LLMs
inferred← citeshttps://doi.org/10.1108/ftpgl-11-2025-0068openalex-snapshot
Neurosymbolic code auditing
inferred← citeshttps://doi.org/10.1109/access.2024.3498737openalex-snapshot
Tempus: Probabilistic Network Latency Verification
inferred← citeshttps://doi.org/10.1109/icnp55882.2022.9940325openalex-snapshot
On the Complexity of Network-Wide Configuration Synthesis
inferred← citeshttps://doi.org/10.1109/icnp55882.2022.9940333openalex-snapshot
Kirigami, the Verifiable Art of Network Cutting
inferred← citeshttps://doi.org/10.1109/icnp65844.2025.11192328openalex-snapshot
Guided Exploration of Control-Plane Routing States
inferred← citeshttps://doi.org/10.1109/infocom59046.2026.11571428openalex-snapshot
CRONUS: Counterexample-Guided Constraint Learning for Network Update Synthesis
inferred← citeshttps://doi.org/10.1109/infocom59046.2026.11571533openalex-snapshot
Comprehensive Network Configuration Verification via Effective Environment Reduction
inferred← citeshttps://doi.org/10.1109/iwqos70441.2026.11661143openalex-snapshot
BGP-Shadow: Accelerating BGP Verification via Programmable Data Planes
inferred← citeshttps://doi.org/10.1109/tnet.2024.3360371openalex-snapshot
Kirigami, the Verifiable Art of Network Cutting
inferred← citeshttps://doi.org/10.1109/tnsm.2024.3442298openalex-snapshot
Multimodal Multitask Control Plane Verification Framework
inferred← citeshttps://doi.org/10.1145/3603269.3604842openalex-snapshot
Lightyear: Using Modularity to Scale BGP Control Plane Verification
inferred← citeshttps://doi.org/10.1145/3656454openalex-snapshot
KATch: A Fast Symbolic Verifier for NetKAT
inferred← citeshttps://doi.org/10.1145/3672199.3673889openalex-snapshot
Interpretable Network Synthesis via Localized Specifications
inferred← citeshttps://doi.org/10.1145/3750022.3750454openalex-snapshot
Incremental Network Configuration Verification via Localized Subspecification
inferred← citeshttps://doi.org/10.1145/3789240.3829180openalex-snapshot
Verifying Non-Deterministic Convergence on a Global Production WAN
inferred← citeshttps://doi.org/10.1145/3820441.3820471openalex-snapshot
Characterizing Network Configuration Repair Spaces with Localized Subspecifications
inferred← citeshttps://doi.org/10.54337/aau588616986openalex-snapshot
Quantitative Verification and Synthesis of Resilient Networks
showing the first 21 of 22 · page through all 22
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.