Knowledge-Based Synthesis of Distributed Systems Using Event Structures

Bickford, Mark; Constable, Robert L.; Halpern, Joseph Y.; Petride, Sabina

doi:10.1007/978-3-540-32275-7_30

Cited by 9 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, there has been relatively little work on (automated) knowledge-based synthesis of programs. Initial steps have been taken by Engelhardt et al [9,10] ; we also have some preliminary results along these lines [5] that give us confidence in the general approach; we hope that further work will lend further credence to this approach.…”

Section: I) All Network Have Diameter At Most D and (Ii) All Agents mentioning

confidence: 91%

“…In our language, these impossibility results all show that there does not exist a k such that (N , i) ∼ k (N , i ) implies that f (N ) = f (N ) for Theorem 2.6. 5 Yamashita and Kameda characterize when global functions can be computed in undirected networks (which have no weights associated with the edges), assuming that an upper bound on the size of the network is known. They define a notion of view and show that two agents have the same information whenever their views are similar in a precise technical sense; f (N ) is computable iff for all networks N such that agents in N and N have similar views, f (N ) = f (N ).…”

Section: Theorem 26 the Global Function F Is Computable In N If And mentioning

confidence: 99%

See 1 more Smart Citation

A knowledge-based analysis of global function computation

Halpern

Petride

2010

Distrib. Comput.

Self Cite

View full text Add to dashboard Cite

Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends on the whole network, the goal is for every agent to eventually compute the value f (N ). We call this problem global function computation. Various solutions for instances of this problem, such as Boolean function computation, leader election, (minimum) spanning tree construction, and network determination, have been proposed, each under particular assumptions about what processors know about the system and how this knowledge can be acquired. We give a necessary and sufficient condition for the problem to be solvable that generalizes a number of well-known results (Attyia et al. in J ACM 35(4):845-875, 1988; Yamashita and Kameda in IEEE Trans Parallel Distrib Syst 7(1):69-89, 1996; Yamashita and Kameda in IEEE Trans Parallel Distrib Syst 10(9):878-887, 1999). We then provide a knowledge-based (kb) program (like those of Fagin et al. (Reasoning about knowledge, MIT Press,

show abstract

Section: I) All Network Have Diameter At Most D and (Ii) All Agents mentioning

confidence: 91%

Section: Theorem 26 the Global Function F Is Computable In N If And mentioning

confidence: 99%

A knowledge-based analysis of global function computation

Halpern

Petride

2010

Distrib. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In contrast, our specifications are based on concrete data structures (raising the level of abstraction of our specifications is left for future work). Also, Bickford et al [15], [7] synthesize correct-by-construction distributed programs from specifications written in a theory of events.…”

Section: Related Workmentioning

confidence: 99%

A diversified and correct-by-construction broadcast service

Rahli

Schiper

Renesse

et al. 2012

2012 20th IEEE International Conference on Network Protocols (ICNP)

Self Cite

View full text Add to dashboard Cite

We present a fault-tolerant ordered broadcast service that is correct-by-construction. Our broadcast service allows for diversity in space, whereby the participants in the broadcast protocol run different code, as well as in time, whereby the protocol itself is changed periodically. We use the Nuprl proof assistant to specify the service, prove correctness, and synthesize the code. The paper includes initial performance results.

show abstract

“…Many knowledge based systems have been developed to, e.g. : analyze distributed systems [Dwork and Moses 1990;Fagin et al 1997;Halpern 1987;Halpern and Moses 1990;Panangaden and Taylor 1992]; reason about synchronous systems [Ben-Zvi 2011; Ben-Zvi and Moses 2014; Castañeda et al 2014Castañeda et al , 2016Dan et al 2017;Goren and Moses 2018]; derive protocols [Halpern and Zuck 1992]; synthesize systems [Bickford et al 2004]; and reason about blockchain protocols [Halpern and Pass 2017]. However, as opposed to łstandardž knowledge theories that consider an external and logical notion of knowledge (that cannot necessarily be computed), Asphalion relies on a syntactic and explicit representation of knowledge [Fagin et al 2003], which is more pragmatic and computational, in the sense that pieces of knowledge are concrete pieces of data stored locally and exchanged through messages (allowing processes to gain knowledge [Chandy and Misra 1986;Halpern 1987]).…”

Section: High-level Reasoningmentioning

confidence: 99%

Asphalion: trustworthy shielding against Byzantine faults

Vukotic

Rahli

Esteves-Veríssimo

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Byzantine fault-tolerant state-machine replication (BFT-SMR) is a technique for hardening systems to tolerate arbitrary faults. Although robust, BFT-SMR protocols are very costly in terms of the number of required replicas (3f + 1 to tolerate f faults) and of exchanged messages. However, with łhybridž architectures, where łnormalž components trust some łspecialž components to provide properties in a trustworthy manner, the cost of using BFT can be dramatically reduced. Unfortunately, even though such hybridization techniques decrease the message/time/space complexity of BFT protocols, they also increase their structural complexity. Therefore, we introduce Asphalion, the first theorem prover-based framework for verifying implementations of hybrid systems and protocols. It relies on three novel languages: (1) HyLoE: a Hybrid Logic of Events to reason about hybrid fault models; (2) MoC: a Monadic Component language to implement systems as collections of interacting hybrid components; and (3) LoCK: a sound Logic of events-based Calculus of Knowledge to reason about both homogeneous and hybrid systems at a high-level of abstraction (thereby allowing reusing proofs, and capturing the high-level logic of distributed systems). In addition, Asphalion supports compositional reasoning, e.g., through mechanisms to lift properties about trusted-trustworthy components, to the level of the distributed systems they are integrated in. As a case study, we have verified crucial safety properties (e.g., agreement) of several implementations of hybrid protocols. CCS Concepts: • Theory of computation → Logic and verification.

show abstract

Knowledge-Based Synthesis of Distributed Systems Using Event Structures

Cited by 9 publications

References 15 publications

A knowledge-based analysis of global function computation

A knowledge-based analysis of global function computation

A diversified and correct-by-construction broadcast service

Asphalion: trustworthy shielding against Byzantine faults

Contact Info

Product

Resources

About