Some complexity results for stateful network verification (Q2335903): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LoLA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VeriFlow / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Anteater / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3170946043 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2106.01030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: NetKAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Coalgebraic Decision Procedure for NetKAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying lossy channel systems has nonprimitive recursive complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Multithreaded Programs with Asynchronous Atomic Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity results for stateful network verification / rank
 
Normal rank

Latest revision as of 23:09, 20 July 2024

scientific article
Language Label Description Also known as
English
Some complexity results for stateful network verification
scientific article

    Statements

    Some complexity results for stateful network verification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 November 2019
    0 references
    safety verification
    0 references
    stateful networks
    0 references
    middleboxes
    0 references
    channel systems
    0 references
    Petri nets
    0 references
    complexity bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references