Chapar: certified causally consistent distributed key-value stores

M Lesani, CJ Bell, A Chlipala - ACM SIGPLAN Notices, 2016 - dl.acm.org
Today's Internet services are often expected to stay available and render high
responsiveness even in the face of site crashes and network partitions. Theoretical results …

Velisarios: Byzantine fault-tolerant protocols powered by Coq

V Rahli, I Vukotic, M Völp… - … ESOP 2018, Held as Part of …, 2018 - Springer
Our increasing dependence on complex and critical information infrastructures and the
emerging threat of sophisticated attacks, ask for extended efforts to ensure the correctness …

Inductive diagrams for causal reasoning

J Castello, P Redmond, L Kuper - Proceedings of the ACM on …, 2024 - dl.acm.org
The Lamport diagram is a pervasive and intuitive tool for informal reasoning about “happens-
before” relationships in a concurrent system. However, traditional axiomatic formalizations of …

From clarity to efficiency for distributed algorithms

YA Liu, SD Stoller, B Lin, M Gorbovitski - Proceedings of the ACM …, 2012 - dl.acm.org
This paper describes a very high-level language for clear description of distributed
algorithms and optimizations necessary for generating efficient implementations. The …

[HTML][HTML] A novel formal logic for formal analysis of timeliness in non-repudiation protocols

K Yang, M Xiao, X Zhong, Y Zhong - … of King Saud University-Computer and …, 2023 - Elsevier
Non-repudiation protocols are aimed at exchanging digital messages and irrefutable
receipts between two mistrusting parties over the Internet, which form the cornerstones of …

Proving mutual authentication property of RCIA protocol in RFID based on logic of events

X Zhong, M Xiao, T Zhang, K Yang… - Chinese Journal of …, 2022 - Wiley Online Library
The increasing commercialization and massive deployment of radio frequency identification
(RFID) systems has raised many security related issues which in return evokes the need of …

Developing correctly replicated databases using formal tools

N Schiper, V Rahli, R Van Renesse… - 2014 44th Annual …, 2014 - ieeexplore.ieee.org
Fault-tolerant distributed systems often contain complex error handling code. Such code is
hard to test or model-check because there are often too many possible failure scenarios to …

From clarity to efficiency for distributed algorithms

YA Liu, SD Stoller, B Lin - ACM Transactions on Programming …, 2017 - dl.acm.org
This article describes a very high-level language for clear description of distributed
algorithms and optimizations necessary for generating efficient implementations. The …

Formal specification, verification, and implementation of fault-tolerant systems using EventML

V Rahli, D Guaspari, M Bickford… - … Communications of the …, 2015 - eceasst.org
Distributed programs are known to be extremely difficult to implement, test, verify, and
maintain. This is due in part to the large number of possible unforeseen interactions among …

EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems

V Rahli, D Guaspari, M Bickford… - Science of Computer …, 2017 - Elsevier
Distributed programs are known to be extremely difficult to implement, test, verify, and
maintain. This is due in part to the large number of possible unforeseen interactions among …