Cargando…

Para[Formula: see text] : parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms

Automatic verification of threshold-based fault-tolerant distributed algorithms (FTDA) is challenging: FTDAs have multiple parameters that are restricted by arithmetic conditions, the number of processes and faults is parameterized, and the algorithm code is parameterized due to conditions counting...

Descripción completa

Detalles Bibliográficos
Autores principales: Konnov, Igor, Lazić, Marijana, Veith, Helmut, Widder, Josef
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6959411/
https://www.ncbi.nlm.nih.gov/pubmed/32009739
http://dx.doi.org/10.1007/s10703-017-0297-4

Ejemplares similares