Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
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 …
each managing critical systems (eg, a ZooKeeper cluster). A controller continuously …
Marlin: Two-phase BFT with linearity
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 …
HotStuff (PODC 2019) has received significant attention. HotStuff has three round-trips for …
Grove: A separation-logic library for verifying distributed systems
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 …
first to handle time-based leases, including their interaction with reconfiguration, crash …
Pono: A Flexible and Extensible SMT-Based Model Checker
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 …
bugs) in modern system designs. Because of this, improving the ease of use, scalability, and …
Rabia: Simplifying state-machine replication through randomization
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 …
machine replication (SMR) within a datacenter. The main innovation of Rabia is in using …
UCLID5: Multi-modal formal modeling, verification, and synthesis
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 …
It enables one to tackle verification problems for heterogeneous systems such as …
SplitBFT: Improving byzantine fault tolerance safety using trusted compartments
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 …
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
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 …
programs and systems. Quantifiers are essential for describing systems with unbounded …
[PDF][PDF] The civl verifier
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 …
layered refinement, which views the task of verifying a program as a sequence of program …
Network simulator-centric compositional testing
This article introduces a novel methodology, Network Simulator-centric Compositional
Testing (NSCT), to enhance the verification of network protocols with a particular focus on …
Testing (NSCT), to enhance the verification of network protocols with a particular focus on …