Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
A Coalgebraic Decision Procedure for NetKAT
Nate Foster
, Dexter Kozen
,
Matthew Milano
, Alexandra Silva
, Laure Thompson
Research output
:
Contribution to journal
›
Article
›
peer-review
13
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A Coalgebraic Decision Procedure for NetKAT'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Network Topology
100%
Soundness
100%
Efficient Algorithm
100%
State Space
100%
Decision Procedure
100%
Sparse Representation
100%
Domain-Specific Language
100%
Equational Theory
100%
Packet Processing Function
100%
Network Packet
100%
Specialized Version
100%
Keyphrases
Decision Procedure
100%
NetKAT
100%
Network Topology
25%
Performance Improvement
25%
State Space
25%
All-pairs
25%
P-space
25%
Sparse Representation
25%
Processing Function
25%
Packet Header
25%
Domain-specific Languages
25%
Kleene Algebra with Tests
25%
Equational Theory
25%
Loop Freedom
25%
Bisimulation
25%
Network Packet Processing
25%
Standard Semantics
25%
Translation Validation
25%
Brzozowski Derivatives
25%