Decomposition of distributed programs into communication-closed layers
From MaRDI portal
Publication:1051420
DOI10.1016/0167-6423(83)90013-8zbMath0514.68033OpenAlexW2042981544MaRDI QIDQ1051420
Publication date: 1982
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(83)90013-8
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker, Derivation of Heard-of Predicates from Elementary Behavioral Patterns, Reasoning about layered message passing systems, The Heard-Of model: computing in distributed systems with benign faults, Causing communication closure: safe program composition with reliable non-FIFO channels, A principle for sequential reasoning about distributed algorithms, Deadlock-free absorption of barrier synchronisations, Interleaving set temporal logic, From wait-free to arbitrary concurrent solo executions in colorless distributed computing, Measure of parallelism of distributed computations, Guessing the Buffer Bound for k-Synchronizability, Synchronous development of asynchronous systems, Layered reasoning for randomized distributed algorithms, Unnamed Item, Consensus in the presence of mortal Byzantine faulty processes, On the \(k\)-synchronizability of systems, Formal communication elimination and sequentialization equivalence proofs for distributed system models, Structural transformations for data-enriched real-time systems, A reduction theorem for randomized distributed algorithms under weak adversaries, Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks, Defining conditional independence using collapses, Verification of distributed programs using representative interleaving sequences, Coupling coefficients of a distributed execution, Unnamed Item, Unnamed Item, Step failures semantics and a complete proof system, Untangling Partial Agreement: Iterated x-consensus Simulations, A Reduction Theorem for the Verification of Round-Based Distributed Algorithms, AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗, Unnamed Item, Formal Sequentialization of Distributed Systems via Program Rewriting, Proving partial order properties, Guessing the buffer bound for k-synchronizability
