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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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) · Networked Systems Design and Implementation · Cited by 844
VeriFlow: verifying network-wide invariants in real time
Khurshid, A., Zou, X. K., Zhou, W., Caesar, M., & Godfrey, P. B. (2013) · Networked Systems Design and Implementation · Cited by 642
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) · Networked Systems Design and Implementation · Cited by 574
Self-citationDebugging 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-citationFrenetic: a network programming language
Foster, N., Harrison, R., Freedman, M. J., Monsanto, C., Rexford, J., Story, A., & Walker, D. (2011) · Proceedings of the 16th ACM SIGPLAN international conference on Functional programming · doi:10.1145/2034773.2034812 · Cited by 269
Self-citationFlowChecker: configuration analysis and verification of federated openflow infrastructures
Al-Shaer, E., & Al-Haj, S. (2010) · Proceedings of the 3rd ACM workshop on Assurable and usable security configuration · doi:10.1145/1866898.1866905 · Cited by 249
Declarative routing: extensible routing with declarative queries
Loo, B. T., Hellerstein, J. M., Stoica, I., & Ramakrishnan, R. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080126 · Cited by 211
A compiler and run-time system for network programming languages
Monsanto, C., Foster, N., Harrison, R., & Walker, D. (2012) · ACM SIGPLAN Notices · doi:10.1145/2103621.2103685 · Cited by 201
Self-citationMaple: simplifying SDN programming using algorithmic policies
Voellmy, A., Wang, J., Yang, Y. R., Ford, B., & Hudak, P. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486030 · Cited by 188
Decidability and expressiveness aspects of logic queries
Shmueli, O. (1987) · Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/28659.28685 · Cited by 181
Debugging the data plane with anteater
Mai, H., Khurshid, A., Agarwal, R., Caesar, M., Godfrey, P. B., & King, S. T. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2043164.2018470 · Cited by 167
Splendid isolation: a slice abstraction for software-defined networks
Gutz, S., Story, A. S., Schlesinger, C., & Foster, N. (2012) · ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN) · doi:10.1145/2342441.2342458 · Cited by 149
Self-citationA compiler and run-time system for network programming languages
Monsanto, C., Foster, N., Harrison, R., & Walker, D. (2012) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2103656.2103685 · Cited by 139
Self-citationMachine-verified network controllers
Guha, A., Reitblatt, M., & Foster, N. (2013) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2491956.2462178 · Cited by 111
Self-citationCertification of Compiler Optimizations Using Kleene Algebra with Tests
Kozen, D. C., & Patron, M.-C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44957-4_38 · Cited by 100
Self-citationNettle: Functional Reactive Programming for OpenFlow Networks
Voellmy, A., Agarwal, A., & Hudak, P. (2010) · doi:10.21236/ada555162 · Cited by 61
Nelson, T., Guha, A., Dougherty, D. J., Fisler, K., & Krishnamurthi, S. (2013) · ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN) · doi:10.1145/2491185.2491201 · Cited by 43
Self-citationDeclarative routing: extensible routing with declarative queries
Loo, B. T., Hellerstein, J. M., Stoica, I. G., & Ramakrishnan, R. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1090191.1080126 · Cited by 38
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
Hybrid SDN Networks: A Survey of Existing Approaches
Amin, R., Reisslein, M., & Shah, N. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2837161 · Cited by 352
E2: a framework for NFV applications
Palkar, S., Lan, C., Han, S., Jang, K., Panda, A., Ratnasamy, S., Rizzo, L., & Shenker, S. (2015) · Proceedings of the 25th Symposium on Operating Systems Principles · doi:10.1145/2815400.2815423 · Cited by 322
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
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.