Abstract
AbstractWe 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), which are a well-established mathematical structure for defining the denotational semantics of concurrent languages. We provide a sound and complete axiomatization of this model, and we illustrate the use of through examples. More generally, can be understood as an algebraic framework for reasoning about programs with both local state (in packets) and global state (in a global store).
Publisher
Springer International Publishing
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Stream Types;Proceedings of the ACM on Programming Languages;2024-06-20
2. An Algebraic Language for Specifying Quantum Networks;Proceedings of the ACM on Programming Languages;2024-06-20
3. Concurrent NetKAT with Ports;Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing;2024-04-08
4. Shoggoth: A Formal Foundation for Strategic Rewriting;Proceedings of the ACM on Programming Languages;2024-01-05
5. Using expression parsing and algebraic operations to generate test sequences.;Journal of Systems and Software;2023-10