Concurrent NetKAT

Wagemaker, Jana; Foster, Nate; Kappé, Tobias; Kozen, Dexter; Rot, Jurriaan; Silva, Alexandra

doi:10.1007/978-3-030-99336-8_21

Cited by 5 publications

(1 citation statement)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…WNetKAT [104] is a quantitative extension of NetKAT, but it lacks decision procedures. The recently proposed Concurrent NetKAT [166] extends NetKAT for reasoning about concurrency with multiple packets and mutable state.…”

Section: Verification Of Programmable Networkmentioning

confidence: 99%

Quantitative Verification and Synthesis of Resilient Networks

Schou

View full text Add to dashboard Cite

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.-Users may download and print one copy of any publication from the public portal for the purpose of private study or research. -You may not further distribute the material or use it for any profit-making activity or commercial gain -You may freely distribute the URL identifying the publication in the public portal -

show abstract

Section: Verification Of Programmable Networkmentioning

confidence: 99%

Quantitative Verification and Synthesis of Resilient Networks

Schou

View full text Add to dashboard Cite

show abstract

Concurrent NetKAT

Wagemaker

Foster

Kappé

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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), 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).

show abstract

An Algebraic Theory for Shared-State Concurrency

Dvir

Kammar

Lahav

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present a monadic denotational semantics for a higherorder programming language with shared-state concurrency, i.e. globalstate in the presence of interleaving concurrency. Central to our approach is the use of Plotkin and Power's algebraic effect methodology: designing an equational theory that captures the intended semantics, and proving a monadic representation theorem for it. We use Hyland et al.'s equational theory of resumptions that extends non-deterministic global-state with an operator for yielding to the environment. The representation is based on Brookes-style traces. Based on this representation we define a denotational semantics that is directionally adequate with respect to a standard operational semantics. We use this semantics to justify compiler transformations of interest: redundant access eliminations, each following from a mundane algebraic calculation; while structural transformations follow from reasoning over the monad's interface.

show abstract

Concurrent NetKAT

Cited by 5 publications

References 33 publications

Quantitative Verification and Synthesis of Resilient Networks

Quantitative Verification and Synthesis of Resilient Networks

Concurrent NetKAT

An Algebraic Theory for Shared-State Concurrency

Contact Info

Product

Resources

About