Pages that link to "Item:Q2819821"
From MaRDI portal
The following pages link to A coalgebraic decision procedure for NetKAT (Q2819821):
Displaying 15 items.
- Towards an analysis of dynamic gossip in Net\textsc{kat} (Q1617832) (← links)
- Verified iptables firewall analysis and verification (Q1663231) (← links)
- Actor-based model checking for software-defined networks (Q1996852) (← links)
- Explaining safety failures in NetKAT (Q2043810) (← links)
- Some complexity results for stateful network verification (Q2335903) (← links)
- Completeness and incompleteness in nominal Kleene algebra (Q2401017) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- A fast compiler for NetKAT (Q2981979) (← links)
- Nominal Kleene Coalgebra (Q3449483) (← links)
- (Q4029593) (← links)
- Undecidable Problems for Probabilistic Network Programming (Q5111285) (← links)
- (Q5875403) (← links)
- A complete inference system for skip-free guarded Kleene algebra with tests (Q6535242) (← links)
- Kleene theorems for lasso languages and \(\omega \)-languages (Q6636074) (← links)
- On star expressions and completeness theorems (Q6653760) (← links)