Výsledky vyhledávání

Autor: Wagemaker, J., Foster, N., Kappé, T., Kozen, D., Rot, J., Silva, A., Sergey, I.

Publikováno v: Sergey, I. (ed.), Programming Languages and Systems: 31st European Symposium on Programming, ESOP 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, 575-602. Cham : Springer International Publishing
STARTPAGE=575;ENDPAGE=602;ISSN=0302-9743;TITLE=Sergey, I. (ed.), Programming Languages and Systems: 31st European Symposium on Programming, ESOP 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings
Programming Languages and Systems: 31st European Symposium on Programming, ESOP 2022, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022 : proceedings, 575-602
STARTPAGE=575;ENDPAGE=602;TITLE=Programming Languages and Systems
Sergey, I. (ed.), Programming Languages and Systems: 31st European Symposium on Programming, ESOP 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, pp. 575-602

We introduce Concurrent NetKAT (CNetKAT), an extension of NetKAT 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 m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae76153d24492cdc4faeb88f01651422
https://doi.org/10.48550/arxiv.2201.10485

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Coinductive Predicates and Final Sequences in a Fibration

Autor: Hasuo, I., Cho, K., Kataoka, T., Jacobs, B., Kozen, D.

Publikováno v: Kozen, D. (ed.), Mathematical Foundations of Programming Semantics : Twenty-ninth Annual Conference Tulane University New Orleans, LA, USA June 23–25, 2013, pp. 197-214
Electronic Notes in Theoretical Computer Science, 197-214. S.l. : Elsevier
STARTPAGE=197;ENDPAGE=214;TITLE=Electronic Notes in Theoretical Computer Science

Contains fulltext : 117353.pdf (Publisher’s version ) (Open Access)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0dd3ca98183829ee609b3d1989b5a604
https://hdl.handle.net/2066/117353

Zobrazit plný text záznamu

A Coalgebraic Decision Procedure for NetKAT

Autor: Foster, N., Kozen, D., Milano, M., Silva, A., Thompson, L., Rajamani, S.

Publikováno v: Sigplan Notices, 50, 1, pp. 343-355
Rajamani, S. (ed.), POPL 2015: proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Tata Institute of Fundamental Research, Mumbai, India January 12-18, 2015, 343-355. New York : ACM
STARTPAGE=343;ENDPAGE=355;TITLE=Rajamani, S. (ed.), POPL 2015: proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Tata Institute of Fundamental Research, Mumbai, India January 12-18, 2015
Rajamani, S. (ed.), POPL 2015: proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Tata Institute of Fundamental Research, Mumbai, India January 12-18, 2015, pp. 343-355
Sigplan Notices, 50, 343-355
POPL
Technical Report ; 1813/36255. [S.l.] : Cornell University
Technical Report ; 1813/36255

NetKAT is a domain-specific language and logic for specifying and verifying network packet-processing functions. It consists of Kleene algebra with tests (KAT) augmented with primitives for testing and modifying packet headers and encoding network to

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7510b1e4e1a424ed0e0d6061b5bf9f3
https://hdl.handle.net/2066/143596

Zobrazit plný text záznamu

Completeness and incompleteness in nominal Kleene algebra

Autor: Kozen, D., Mamouras, K., Silva, A., Kahl, W.

Publikováno v: Kahl, W. (ed.), Relational and Algebraic Methods in Computer Science : 15th International Conference, RAMiCS 2015, Braga, Portugal, September 28-October 1, 2015, Proceedings, pp. 51-66
Relational and Algebraic Methods in Computer Science ISBN: 9783319247038
RAMICS
Lecture Notes in Computer Science ; 9348, 51-66. Berlin : Springer
STARTPAGE=51;ENDPAGE=66;TITLE=Lecture Notes in Computer Science ; 9348

Gabbay and Ciancia (2011) presented a nominal extension of Kleene algebra as a framework for trace semantics with statically scoped allocation of resources, along with a semantics consisting of nominal languages. They also provided an axiomatization

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c598a06c03e82ed68cdea3b40004c43
https://hdl.handle.net/2066/147308

Zobrazit plný text záznamu

Nominal Kleene Coalgebra

Autor: Kozen, D., Mamouras, K., Petrisan, D.L., Silva, A., Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B.

Publikováno v: Halldórsson, M.M.; Iwama, K.; Kobayashi, N. (ed.), Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, pp. 286-298
Lecture Notes in Computer Science ; 9135, 286-298. Berlin : Springer
STARTPAGE=286;ENDPAGE=298;TITLE=Lecture Notes in Computer Science ; 9135
Automata, Languages, and Programming ISBN: 9783662476659
ICALP (2)

We develop the coalgebraic theory of nominal Kleene algebra, including an alternative language-theoretic semantics, a nominal extension of the Brzozowski derivative, and a bisimulation-based decision procedure for the equational theory.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::914d892eb4eabd880853438919f35f73
https://hdl.handle.net/2066/143757

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání