Some complexity results for stateful network verification (Q2335903)

From MaRDI portal
Revision as of 00:09, 21 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Some complexity results for stateful network verification
scientific article

    Statements

    title
    Some complexity results for stateful network verification (English)
    0 references
    author
    Kalev Alpernas
    0 references
    Aurojit Panda
    0 references
    Alexander Rabinovich
    0 references
    Mooly Sagiv
    0 references
    Sharon Shoham
    0 references
    Yaron Velner
    0 references
    Scott J. Shenker
    0 references
    publication date
    18 November 2019
    0 references
    zbMATH Keywords
    safety verification
    0 references
    stateful networks
    0 references
    middleboxes
    0 references
    channel systems
    0 references
    Petri nets
    0 references
    complexity bounds
    0 references
    describes a project that uses
    VeriCon
    0 references
    NetKAT
    0 references
    LoLA
    0 references
    VeriFlow
    0 references
    Anteater
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q60
    0 references
    68M10
    0 references
    68Q25
    0 references
    68Q85
    0 references
    zbMATH DE Number
    7130923
    0 references
    OpenAlex ID
    W3170946043
    0 references
    arXiv ID
    2106.01030
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2335903&oldid=36538326"
    Powered by MediaWiki