Pith. sign in

REVIEW 1 cited by

Protocols to Code: Formal Verification of a Next-Generation Internet Router

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.06074 v1 pith:BCBBJZBN submitted 2024-05-09 cs.CR cs.NIcs.PL

classification cs.CRcs.NIcs.PL
keywords protocolcodeimplementationinternetpropertiesrouterverificationcritical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present the first formally-verified Internet router, which is part of the SCION Internet architecture. SCION routers run a cryptographic protocol for secure packet forwarding in an adversarial environment. We verify both the protocol's network-wide security properties and low-level properties of its implementation. More precisely, we develop a series of protocol models by refinement in Isabelle/HOL and we use an automated program verifier to prove that the router's Go code satisfies memory safety, crash freedom, freedom from data races, and adheres to the protocol model. Both verification efforts are soundly linked together. Our work demonstrates the feasibility of coherently verifying a critical network component from high-level protocol models down to performance-optimized production code, developed by an independent team. In the process, we uncovered critical bugs in both the protocol and its implementation, which were confirmed by the code developers, and we strengthened the protocol's security properties. This paper explains our approach, summarizes the main results, and distills lessons for the design and implementation of verifiable systems, for the handling of continuous changes, and for the verification techniques and tools employed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Gradually Verifying Unfolding Expressions & Pure Functions

    cs.PL 2026-07 conditional novelty 6.0 of 10

    Formal symbolic-execution and runtime semantics for unfolding expressions and pure functions in gradual verification, with a soundness proof extending Zimmerman et al.'s Gradual Viper formalization.

Pith tools