Decomposition of Distributed Programs into Communication-Closed Layers

  title={Decomposition of Distributed Programs into Communication-Closed Layers},
  author={T. Elrad and N. Francez},
  journal={Sci. Comput. Program.},
  • T. Elrad, N. Francez
  • Published 1982
  • Computer Science
  • Sci. Comput. Program.
  • Abstract The safe decomposition of a distributed program into communication closed layers is suggested as a superstructure of its decomposition into a collection of communicating processes. This decomposition may simplify the analysis of a distributed program, as is exemplified by examples of program verification. A programming language construct to enforce safety of a decomposition is introduced. The application to systematic construction of distributed programs is also shown. 
    221 Citations

    Topics from this paper

    Communication-Closed Layers as Paradigm for Distributed Systems: A Manifesto
    • Highly Influenced
    • PDF
    On Proving Communication Closedness of Distributed Layers
    • 17
    • PDF
    Verifying Semantic of System Composition for an Aspect-Oriented Approach
    • 1
    • Highly Influenced
    • PDF
    Script: A Communication Abstraction Mechanism and its Verification
    • 32
    Layers as Knowledge Transitions in the Design of Distributed Systems
    • 9
    • Highly Influenced
    • PDF
    Proof Rules for Communication Abstractions (Abstract)
    • PDF
    Automatic Construction of CSP Programs from Sequential Non-Deterministic Programs
    • A. Moitra
    • Computer Science
    • Sci. Comput. Program.
    • 1985
    • 6
    • Highly Influenced
    • PDF
    Abstract data groups: structuring distributed programs as layers
    • S. Gadkari
    • Computer Science
    • Proceedings of the 1992 International Conference on Computer Languages
    • 1992


    Synchronization in Distributed Programs
    • 154
    • PDF
    Extended naming conventions for communicating processes
    • 14
    A Proof System for Communicating Sequential Processes
    • 362
    • PDF
    A linear history semantics for distributed languages extended abstract
    • 13
    Communicating sequential processes
    • 11,986
    • PDF
    Reduction: a method of proving properties of parallel programs
    • 466
    • PDF
    Semantics of Nondeterminism, Concurrency, and Communication
    • 98
    • PDF
    A Weakest Precondition Semantics for Communicating Processes
    • 10
    Proofs of Networks of Processes
    • 588
    • PDF