The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
NetKAT: semantic foundations for networks
Abstract
Recent years have seen growing interest in high-level languages for programming networks. But the design of these languages has been largely ad hoc, driven more by the needs of applications and the capabilities of network hardware than by foundational principles. The lack of a semantic foundation has left language designers with little guidance in determining how to incorporate new features, and programmers without a means to reason precisely about their code.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
McKeown (2008) · doi:10.1145/1355734.1355746 · Cited by 8,513
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
Header space analysis: static checking for networks
Kazemian, P., Varghese, G., & McKeown, N. (2012) · Cited by 651
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
Kozen, D. (1994) · Information and Computation · doi:10.1006/inco.1994.1037 · Cited by 634
Self-citationFrenetic: a network programming language
Foster, N., Harrison, R., Freedman, M. J., Monsanto, C., Rexford, J., Story, A., & Walker, D. (2011) · ACM SIGPLAN Notices · doi:10.1145/2034574.2034812 · Cited by 584
Self-citationAbstractions for network update
Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., & Walker, D. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342427 · Cited by 584
Self-citationComposing software-defined networks
Monsanto, C., Reich, J., Foster, N., Rexford, J., & Walker, D. (2013) · Cited by 497
Self-citationVeriFlow: verifying network-wide invariants in real time
Khurshid, A., Zou, X. K., Zhou, W., Caesar, M., & Godfrey, P. B. (2013) · Cited by 488
Debugging the data plane with anteater
Mai, H., Khurshid, A., Agarwal, R., Caesar, M., Godfrey, P. B., & King, S. T. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018470 · Cited by 365
Participatory networking: an API for application control of SDNs
Ferguson, A. D., Guha, A., Liang, C., Fonseca, R., & Krishnamurthi, S. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486003 · Cited by 269
Self-citation
Cited by
Software-Defined Networking: A Comprehensive Survey
Kreutz, D., Ramos, F. M. V., Esteves Verissimo, P., Esteve Rothenberg, C., Azodolmolky, S., & Uhlig, S. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2371999 · Cited by 5,050
Iqbal, W., Abbas, H., Daneshmand, M., Rauf, B., & Bangash, Y. A. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2997651 · Cited by 356
Singh, J., & Behal, S. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100279 · Cited by 253
Metadata
- Authors
- Anderson, C. J., Foster, N., Guha, A., Jeannin, J.-B., Kozen, D., Schlesinger, C., & Walker, D.
- Venue
- Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
- Publisher
- ACM
- Published
- 2014-01-08
- Pages
- 113-126
- OpenAlex
- W2130210899
- Cited by
- 373
- References
- 24
- FWCI
- 30.24
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: NetKAT: semantic foundations for networks. https://app.cochat.ai/papers/10.1145/2535838.2535862
- The paper
- Anderson, C. J., Foster, N., Guha, A., Jeannin, J.-B., Kozen, D., Schlesinger, C., & Walker, D. (2014). NetKAT: semantic foundations for networks. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. https://doi.org/10.1145/2535838.2535862
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
