On interprocess communication. I: Basic formalism
From MaRDI portal
Recommendations
Cites work
- A calculus of communicating systems
- A New Approach to Proving the Correctness of Multiprocess Programs
- scientific article; zbMATH DE number 3921989 (Why is no real title available?)
- scientific article; zbMATH DE number 3761044 (Why is no real title available?)
- On interprocess communication. II: Algorithms
- Time, clocks, and the ordering of events in a distributed system
Cited in
(only showing first 100 items - show all)- A queue based mutual exclusion algorithm
- Distributed algorithm to detect strong conjunctive predicates
- Script: A communication abstraction mechanism and its verification
- On interprocess communication. II: Algorithms
- A framework for viewing atomic events in distributed computations
- A criterion for atomicity
- Defining conditional independence using collapses
- Modelling knowledge and action in distributed systems
- A fine-grained solution to the mutual exclusion problem
- On the mutual-exclusion problem -- a quest for minimal solutions
- Clock construction in fully asynchronous parallel systems and PRAM simulation
- Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
- Reasoning about causality between distributed nonatomic events
- Mutual exclusion as a matter of priority
- Improved time bounds for linearizable implementations of abstract data types
- Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
- Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
- On specification of multiprocessor computing
- Self-stabilizing timestamps
- Efficient algorithms for checking the atomicity of a run of read and write operations
- Simple extensions of 1-writer atomic variable constructions to multiwriter ones
- Timing and causality in process algebra
- Randomized registers and iterative algorithms
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Election in fully anonymous shared memory systems: tight space bounds and algorithms
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
- On atomic registers and randomized consensus in m\&m systems
- A visit to mutual exclusion in seven dates
- Leader-based de-anonymization of an anonymous read/write memory
- Time-efficient read/write register in crash-prone asynchronous message-passing systems
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- Tight space bounds for \(\ell\)-exclusion
- Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations
- Mutual exclusion in fully anonymous shared memory systems
- Two-process synchronization
- Composite registers
- Optimal propagation-based protocols implementing causal memories
- The \(k\)-simultaneous consensus problem
- Implementing dataflow with threads
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
- Time and space optimal implementations of atomic multi-writer register
- Interleaving set temporal logic
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
- Event-based proof of the mutual exclusion property of Peterson's algorithm
- scientific article; zbMATH DE number 982545 (Why is no real title available?)
- Concurrent use of write-once memory
- t-resilient immediate snapshot Is impossible
- The time complexity of updating snapshot memories
- Concurrent abstract state machines
- Tight space bounds for -exclusion
- Distributed universality
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- Regular register: an implementation in a churn prone environment
- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
- Under the hood of the bakery algorithm: mutual exclusion as a matter of priority
- Optimistic Erasure-Coded Distributed Storage
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
- The topology of distributed adversaries
- Power and limits of distributed computing shared memory models
- scientific article; zbMATH DE number 49717 (Why is no real title available?)
- scientific article; zbMATH DE number 139604 (Why is no real title available?)
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
- scientific article; zbMATH DE number 176735 (Why is no real title available?)
- From the happened-before relation to the causal ordered set abstraction
- Introduction à l'algorithmique des objets partagés
- Data-stream-based global event monitoring using pairwise interactions
- scientific article; zbMATH DE number 1497839 (Why is no real title available?)
- scientific article; zbMATH DE number 1759600 (Why is no real title available?)
- Computing k-atomicity in polynomial time
- scientific article; zbMATH DE number 220134 (Why is no real title available?)
- scientific article; zbMATH DE number 3999273 (Why is no real title available?)
- Linear-time snapshot implementations in unbalanced systems
- Languages of higher-dimensional automata
- A simple object that spans the whole consensus hierarchy
- Concurrent specifications beyond linearizability
- How a rainbow coloring function can simulate wait-free handshaking
- Generating Posets Beyond N
- Causal memory: definitions, implementation, and programming
- What can be computed in a distributed system?
- A coded shared atomic memory algorithm for message passing architectures
- The computability of relaxed data structures: queues and stacks as examples
- Formalization of parallelism forms in IPCL
- Logical classification of distributed algorithms (Bakery algorithms as an example)
- Weak atomicity: A helpful notion in the construction of atomic shared variables
- Finite-state concurrent programs can be expressed in pairwise normal form
- Wait-free computing
- Self-stabilization of wait-free shared memory objects
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
- Making Linearizability Compositional for Partially Ordered Executions
- Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API
- Towards an automatic proof of the bakery algorithm
- Asymmetric distributed trust
- On interprocess communication and the implementation of multi-writer atomic registers
- Optimal resilience in systems that mix shared memory and message passing
- Structure of concurrency
- Bisimulation and action refinement
- Process-algebraic models of multi-writer multi-reader non-atomic registers
- Presenting interval pomsets with interfaces
This page was built for publication: On interprocess communication. I: Basic formalism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079945)
