Anvil: Verifying liveness of cluster management controllers

X Sun, W Ma, JT Gu, Z Ma, T Chajed, J Howell… - … USENIX Symposium on …, 2024 - usenix.org
Modern clouds depend crucially on an extensible ecosystem of thousands of controllers,
each managing critical systems (eg, a ZooKeeper cluster). A controller continuously …

Marlin: Two-phase BFT with linearity

X Sui, S Duan, H Zhang - 2022 52nd Annual IEEE/IFIP …, 2022 - ieeexplore.ieee.org
As the first Byzantine fault-tolerant (BFT) protocol with linear communication complexity,
HotStuff (PODC 2019) has received significant attention. HotStuff has three round-trips for …

Grove: A separation-logic library for verifying distributed systems

U Sharma, R Jung, J Tassarotti, F Kaashoek… - Proceedings of the 29th …, 2023 - dl.acm.org
Grove is a concurrent separation logic library for verifying distributed systems. Grove is the
first to handle time-based leases, including their interaction with reconfiguration, crash …

Pono: A Flexible and Extensible SMT-Based Model Checker

M Mann, A Irfan, F Lonsing, Y Yang, H Zhang… - … on Computer Aided …, 2021 - Springer
Symbolic model checking is an important tool for finding bugs (or proving the absence of
bugs) in modern system designs. Because of this, improving the ease of use, scalability, and …

Rabia: Simplifying state-machine replication through randomization

H Pan, J Tuglu, N Zhou, T Wang, Y Shen… - Proceedings of the …, 2021 - dl.acm.org
We introduce Rabia, a simple and high performance framework for implementing state-
machine replication (SMR) within a datacenter. The main innovation of Rabia is in using …

UCLID5: Multi-modal formal modeling, verification, and synthesis

E Polgreen, K Cheang, P Gaddamadugu… - … on Computer Aided …, 2022 - Springer
UCLID5 is a tool for the multi-modal formal modeling, verification, and synthesis of systems.
It enables one to tackle verification problems for heterogeneous systems such as …

SplitBFT: Improving byzantine fault tolerance safety using trusted compartments

I Messadi, MH Becker, K Bleeke, L Jehl… - Proceedings of the 23rd …, 2022 - dl.acm.org
Byzantine fault-tolerant agreement (BFT) in a partially synchronous system usually requires
3f+ 1 nodes to tolerate f faulty replicas. Due to their high throughput and finality property …

An infinite needle in a finite haystack: Finding infinite counter-models in deductive verification

N Elad, O Padon, S Shoham - Proceedings of the ACM on Programming …, 2024 - dl.acm.org
First-order logic, and quantifiers in particular, are widely used in deductive verification of
programs and systems. Quantifiers are essential for describing systems with unbounded …

[PDF][PDF] The civl verifier

B Kragl, S Qadeer - 2021 Formal Methods in Computer Aided …, 2021 - library.oapen.org
Civl is a static verifier for concurrent programs designed around the conceptual framework of
layered refinement, which views the task of verifying a program as a sequence of program …

Network simulator-centric compositional testing

T Rousseaux, C Crochet, J Aoga, A Legay - International Conference on …, 2024 - Springer
This article introduces a novel methodology, Network Simulator-centric Compositional
Testing (NSCT), to enhance the verification of network protocols with a particular focus on …