\(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6838878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms |
scientific article; zbMATH DE number 6838878 |
Statements
\(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (English)
0 references
14 February 2018
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.9216331243515016
0 references
0.8522895574569702
0 references
0.8520016074180603
0 references
0.7956783175468445
0 references
0.7854727506637573
0 references
