Testing Zyzzyva
An evaluation and comparison of Byzantine Fault Tolerant algorithm testing strategies
I.S. Pahwa (TU Delft - Electrical Engineering, Mathematics and Computer Science)
João Miguel Louro Neto – Mentor (TU Delft - Software Engineering)
Burcu Kulahcioglu Kulahcioglu Ozkan – Mentor (TU Delft - Software Engineering)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Testing Byzantine Fault Tolerant (BFT) algorithms is crucial in uncovering potential liveness and safety violations for distributed systems. This pa- per focuses on testing Zyzzyva with ByzzFuzz and Twins and evaluating their performance with each other and a baseline testing strategy. We also inves- tigate if ByzzFuzz can uncover faults in Zyzzyva, and how small-scope mutations compare to any- scope mutations. We also discuss limitations with ByzzFuzz when it comes to testing BFT protocols. We find that ByzzFuzz is currently unable to find known safety violations in Zyzzyva, but can find injected violations and Twins does not find viola- tions given our small sample size.