Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Nate Foster"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 142, Iss Proc. SYNT 2013, Pp 8-23 (2014)
Updates to network configurations are notoriously difficult to implement correctly. Even if the old and new configurations are correct, the update process can introduce transient errors such as forwarding loops, dropped packets, and access control vi
Externí odkaz:
https://doaj.org/article/77e413ecc3f949e5988e1d0a1cab3939
Autor:
Rudy Peterson, Eric Hayden Campbell, John Chen, Natalie Isak, Calvin Shyu, Ryan Doenges, Parisa Ataei, Nate Foster
Publikováno v:
Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs.
Publikováno v:
Proceedings of the 5th International Workshop on P4 in Europe.
Publikováno v:
ACM SIGCOMM Computer Communication Review. 50:82-88
Controlling an opaque system by reading some "dials" and setting some "knobs," without really knowing what they do, is a hazardous and fruitless endeavor, particularly at scale. What we need are transparent networks, that start at the top with a high
Programming languages like P4 enable specifying the behavior of network data planes in software. However, with increasingly powerful and complex applications running in the network, the risk of faults also increases. Hence, there is growing recogniti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0eaed521d93814a6fd8b8d9ff8c82d0b
Publikováno v:
Programming Languages and Systems ISBN: 9783030993351
Proceedings of ESOP 2022
Proceedings of ESOP 2022
We introduce Concurrent (), an extension of with operators for specifying and reasoning about concurrency in scenarios where multiple packets interact through state. We provide a model of the language based on partially-ordered multisets (pomsets), w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8124ce9f91df05bb3f8df8370fc403f1
https://doi.org/10.1007/978-3-030-99336-8_21
https://doi.org/10.1007/978-3-030-99336-8_21
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-28
Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union ($+$) and iteration ($*$) operations from KAT to predicate-guarded versions. We develop the (co)algebraic theory of GKAT a
Publikováno v:
CoNEXT
In this paper, we explore how programmable data planes can naturally provide a higher-level of service to user applications via a new abstraction called packet subscriptions. Packet subscriptions generalize forwarding rules, and can be used to expres
Publikováno v:
SIGCOMM
Dataplane languages like P4 enable flexible and efficient packet-processing using domain-specific primitives such as programmable parsers and match-action tables. Unfortunately, P4 programs tend to be monolithic and tightly coupled to the hardware ar
Autor:
Nate Foster, Samwise Parkinson, Santiago Bautista, Amanda Xu, Alex Y. Chang, Newton Ni, Rudy Peterson, Ryan Doenges, Mina Tahmasbi Arashloo, Alaia Solko-Breslin
P4 is a domain-specific language for programming and specifying packet-processing systems. It is based on an elegant design with high-level abstractions like parsers and match-action pipelines that can be compiled to efficient implementations in soft
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbdfadc7a6034078cc89bf8262905830