\(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580)

From MaRDI portal
Revision as of 21:02, 9 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59607712, #quickstatements; #temporary_batch_1717959530040)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
\(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
scientific article

    Statements

    \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (English)
    0 references
    0 references
    14 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized verification
    0 references
    bounded model checking
    0 references
    completeness
    0 references
    partial orders in distributed systems
    0 references
    reduction
    0 references
    fault-tolerant distributed algorithms
    0 references
    Byzantine faults
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references