Pages that link to "Item:Q1051420"
From MaRDI portal
The following pages link to Decomposition of distributed programs into communication-closed layers (Q1051420):
Displaying 34 items.
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Structural transformations for data-enriched real-time systems (Q493518) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- Defining conditional independence using collapses (Q1194331) (← links)
- Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
- Coupling coefficients of a distributed execution (Q1208733) (← links)
- Proving partial order properties (Q1322161) (← links)
- A principle for sequential reasoning about distributed algorithms (Q1346611) (← links)
- Deadlock-free absorption of barrier synchronisations (Q1350300) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- Reasoning about layered message passing systems (Q1886450) (← links)
- Layered reasoning for randomized distributed algorithms (Q1941864) (← links)
- Guessing the buffer bound for k-synchronizability (Q2117668) (← links)
- On the \(k\)-synchronizability of systems (Q2200819) (← links)
- A reduction theorem for randomized distributed algorithms under weak adversaries (Q2234073) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- Causing communication closure: safe program composition with reliable non-FIFO channels (Q2377131) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- Interleaving set temporal logic (Q2639046) (← links)
- Formal sequentialization of distributed systems via program rewriting (Q2867960) (← links)
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms (Q3646255) (← links)
- AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ (Q4485121) (← links)
- Derivation of Heard-of Predicates from Elementary Behavioral Patterns (Q5041279) (← links)
- (Q5090896) (← links)
- (Q5091093) (← links)
- Measure of parallelism of distributed computations (Q5096176) (← links)
- (Q5155689) (← links)
- Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
- (Q5875395) (← links)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
- Guessing the Buffer Bound for k-Synchronizability (Q6070755) (← links)
- Synchronous development of asynchronous systems (Q6104432) (← links)
- Quorum tree abstractions of consensus protocols (Q6535243) (← links)
