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...
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
-
Tutorial: Parameterized Verification with Byzantine Model Checker
por: Konnov, Igor, et al.
Publicado: (2020) -
Parameterized Complexity of [Formula: see text]-Path Packing
por: Belmonte, Rémy, et al.
Publicado: (2020) -
Global parameterization of [Formula: see text] scattering up to 2 [Formula: see text]
por: Pelaez, J. R., et al.
Publicado: (2019) -
[Formula: see text] regularity properties of singular parameterizations in isogeometric
analysis
por: Takacs, T., et al.
Publicado: (2012) -
Transition Property for [Formula: see text]-Power Free Languages with [Formula: see text] and [Formula: see text] Letters
por: Rukavicka, Josef
Publicado: (2020)