\(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
From MaRDI portal
Publication:1696580
DOI10.1007/s10703-017-0297-4zbMath1380.68279WikidataQ59607712 ScholiaQ59607712MaRDI QIDQ1696580
Publication date: 14 February 2018
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-017-0297-4
reduction; completeness; bounded model checking; Byzantine faults; fault-tolerant distributed algorithms; parameterized verification; partial orders in distributed systems
68Q60: Specification and verification (program logics, model checking, etc.)
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Uses Software
Cites Work
