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 …

Fast and secure global payments with stellar

M Lokhava, G Losa, D Mazières, G Hoare… - Proceedings of the 27th …, 2019 - dl.acm.org
International payments are slow and expensive, in part because of multi-hop payment
routing through heterogeneous banking systems. Stellar is a new global payment network …

Interpretable and trustworthy deepfake detection via dynamic prototypes

L Trinh, M Tsang, S Rambhatla… - Proceedings of the IEEE …, 2021 - openaccess.thecvf.com
In this paper we propose a novel human-centered approach for detecting forgery in face
images, using dynamic prototypes as a form of visual explanations. Currently, most state-of …

Verus: A practical foundation for systems verification

A Lattuada, T Hance, J Bosamiya, M Brun… - Proceedings of the …, 2024 - dl.acm.org
Formal verification is a promising approach to eliminate bugs at compile time, before they
ship. Indeed, our community has verified a wide variety of system software. However, much …

{DuoAI}: Fast, automated inference of inductive invariants for verifying distributed protocols

J Yao, R Tao, R Gu, J Nieh - 16th USENIX Symposium on Operating …, 2022 - usenix.org
Distributed systems are complex and difficult to build correctly. Formal verification can
provably rule out bugs in such systems, but finding an inductive invariant that implies the …

Ivy: A multi-modal verification tool for distributed algorithms

KL McMillan, O Padon - … : 32nd International Conference, CAV 2020, Los …, 2020 - Springer
Ivy is a multi-modal verification tool for correct design and implementation of distributed
protocols and algorithms, supporting modular specification, implementation and proof. Ivy …

Deductive verification in decidable fragments with ivy

KL McMillan, O Padon - … Analysis: 25th International Symposium, SAS 2018 …, 2018 - Springer
This paper surveys the work to date on Ivy, a language and a tool for the formal specification
and verification of distributed systems. Ivy supports deductive verification using automated …

First-order quantified separators

JR Koenig, O Padon, N Immerman… - Proceedings of the 41st …, 2020 - dl.acm.org
Quantified first-order formulas, often with quantifier alternations, are increasingly used in the
verification of complex systems. While automated theorem provers for first-order logic are …

Advanced automata-based algorithms for program termination checking

YF Chen, M Heizmann, O Lengál, Y Li… - Proceedings of the 39th …, 2018 - dl.acm.org
In 2014, Heizmann et al. proposed a novel framework for program termination analysis. The
analysis starts with a termination proof of a sample path. The path is generalized to a Büchi …

Sound and complete witnesses for template-based verification of LTL properties on polynomial programs

K Chatterjee, A Goharshady, E Goharshady… - … Symposium on Formal …, 2024 - Springer
We study the classical problem of verifying programs with respect to formal specifications
given in the linear temporal logic (LTL). We first present novel sound and complete …