Author of the publication

Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks.

, , , , , and . ESOP, volume 13240 of Lecture Notes in Computer Science, page 575-602. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Categorical Framework for Learning Generalised Tree Automata., , , , and . CoRR, (2020)Formal Abstractions for Packet Scheduling., , , , and . Proc. ACM Program. Lang., 7 (OOPSLA2): 1338-1362 (October 2023)A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests., , and . ESOP, volume 13990 of Lecture Notes in Computer Science, page 309-336. Springer, (2023)Leapfrog: certified equivalence for protocol parsers., , , , and . PLDI, page 950-965. ACM, (2022)Soft component automata: Composition, compilation, logic, and verification., , , and . Sci. Comput. Program., (2019)Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks., , , , , and . ESOP, volume 13240 of Lecture Notes in Computer Science, page 575-602. Springer, (2022)A Categorical Framework for Learning Generalised Tree Automata., , , , and . CMCS, volume 13225 of Lecture Notes in Computer Science, page 67-87. Springer, (2022)Completeness and the Finite Model Property for Kleene Algebra, Reconsidered.. RAMiCS, volume 13896 of Lecture Notes in Computer Science, page 158-175. Springer, (2023)Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness., , , and . ICALP, volume 198 of LIPIcs, page 142:1-142:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity., , , , and . ICALP, volume 261 of LIPIcs, page 136:1-136:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)