Reductions and abstractions for formal verification of distributed round-based algorithms
- 1 September 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Software Quality Journal
- Vol. 29 (3), 705-731
- https://doi.org/10.1007/s11219-020-09539-6
Abstract
No abstract availableFunding Information
- Fundação para a Ciência e a Tecnologia (CISUC - UID/CEC/00326/2020, P2020-31/SI/2017, No. 040004)
- Fundação para a Ciência e a Tecnologia (LASIGE - UIDB/00408/2020)
This publication has 27 references indexed in Scilit:
- The Heard-Of model: computing in distributed systems with benign faultsDistributed Computing, 2009
- The timed asynchronous distributed system modelIEEE Transactions on Parallel and Distributed Systems, 1999
- Symmetry and model checkingFormal Methods in System Design, 1996
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Simulating authenticated broadcasts to derive simple fault-tolerant algorithmsDistributed Computing, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Decomposition of distributed programs into communication-closed layersScience of Computer Programming, 1982
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961
- On an Elementary Proof of Some Asymptotic Formulas in the Theory of PartitionsAnnals of Mathematics, 1942