Graft: general purpose raft consensus in Elixir

Brun, Matthew Alan Le; Attard, Duncan Paul; Francalanza, Adrian

doi:10.1145/3471871.3472963

Cited by 3 publications

(1 citation statement)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We address these problems through an automated synthesis procedure that produces an enforcement monitor from a safety µHML formula, expressed in a syntactic fragment of sHML. This fragment, called sHML nf , has already been used to establish enforceability results in a uni-directional setting [ACFI18] and is the source logic employed by the tool detectEr 1 [AAA + 21, AAA + 22, AEF + 22] used to verify the correctness of concurrent systems written in Erlang [AAFI21] and Elixir [BAF21]; it also coincides with sHML in the regular setting [AAF + 20]. We show that the synthesised monitors are correct, according to Definition 4.9.…”

Section: Synthesising Action Disabling Monitorsmentioning

confidence: 99%

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties

Aceto¹,

Cassar²,

Francalanza³

et al. 2023

Logical Methods in Computer Science

View full text Add to dashboard Cite

Runtime enforcement is a dynamic analysis technique that instruments a monitor with a system in order to ensure its correctness as specified by some property. This paper explores bidirectional enforcement strategies for properties describing the input and output behaviour of a system. We develop an operational framework for bidirectional enforcement and use it to study the enforceability of the safety fragment of Hennessy-Milner logic with recursion (sHML). We provide an automated synthesis function that generates correct monitors from sHML formulas, and show that this logic is enforceable via a specific type of bidirectional enforcement monitors called action disabling monitors.

show abstract

Section: Synthesising Action Disabling Monitorsmentioning

confidence: 99%

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties

Aceto¹,

Cassar²,

Francalanza³

et al. 2023

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

Design of Elixir-Based Edge Server for Responsive IoT Applications

Fujita

2022

2022 Tenth International Symposium on Computing and Networking Workshops (CANDARW)

View full text Add to dashboard Cite

Evolution of blockchain consensus algorithms: a review on the latest milestones of blockchain consensus algorithms

Hussein,

Salama,

El-Rahman

2023

Cybersecurity

View full text Add to dashboard Cite

Blockchain technology has gained widespread adoption in recent years due to its ability to enable secure and transparent record-keeping and data transfer. A critical aspect of blockchain technology is the use of consensus algorithms, which allow distributed nodes in the network to agree on the state of the blockchain. In this review paper, we examine various consensus algorithms that are used in blockchain systems, including proof-of-work, proof-of-stake, and hybrid approaches. We go over the trade-offs and factors to think about when choosing a consensus algorithm, such as energy efficiency, decentralization, and security. We also look at the strengths and weaknesses of each algorithm as well as their potential impact on the scalability and adoption of blockchain technology.

show abstract

Graft: general purpose raft consensus in Elixir

Cited by 3 publications

References 36 publications

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties

Design of Elixir-Based Edge Server for Responsive IoT Applications

Evolution of blockchain consensus algorithms: a review on the latest milestones of blockchain consensus algorithms

Contact Info

Product

Resources

About