A Coq formalization of the Stable Routing Problem and of effective abstractions as presented in the paper Control Plane Compression. Only the fact that choice-equivalence implies label and forwarding-equivalence has been proved. It remains to show that stable solutions of the concrete and abstract network are choice-equivalent.
-
Notifications
You must be signed in to change notification settings - Fork 0
A formalization of SRPs and Control Plane Compression in Coq.
License
nickgian/Bonsai-coq
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A formalization of SRPs and Control Plane Compression in Coq.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published