Appraising fairness in languages for distributed programming
From MaRDI portal
Publication:1112589
DOI10.1007/BF01872848zbMath0659.68023MaRDI QIDQ1112589
Nissim Francez, Shmuel Katz, Krzysztof R. Apt
Publication date: 1988
Published in: Distributed Computing (Search for Journal in Brave)
fairnesssynchronizationpartial order semanticsCSPcommunicating sequential processesdistributed computationsemantic criteria
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items
Abstraction and composition: a verification method for co-operating systems, Mutex needs fairness, On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes, On fairness and randomness, Population protocols with unreliable communication, Interleaving set temporal logic, Fairness and the axioms of control predicates, Foundations for using linear temporal logic in Event-B refinement, Appraising fairness in languages for distributed programming, A self-stabilizing algorithm for strong fairness, Timed runtime monitoring for multiparty conversations, On projective and separable properties, Modularity for timed and hybrid systems, Model checking with fairness assumptions using PAT, Modelling mutual exclusion in a process algebra with time-outs, Putting logic-based distributed systems on stable grounds, Just testing, On the limits of refinement-testing for model-checking CSP, Event fairness and non-interleaving concurrency, Protocols with constant local storage and unreliable communication, Unnamed Item, Fairness and hyperfairness, Action systems in incremental and aspect-oriented modeling, Positive Dedalus programs tolerate non-causality, Fairness and regularity for SCCS processes, Defining conditional independence using collapses, Sooner is safer than later, Verification of distributed programs using representative interleaving sequences, Combining partial-order reductions with on-the-fly model-checking., On equivalence-completions of fairness assumptions, Ensuring liveness properties of distributed systems: open problems, Fifty years of Hoare's logic, Some impossibility results in interprocess synchronization, Fairness and hyperfairness in multi-party interactions, Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability, An optimal self-stabilizing strarvation-free alternator, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, Strong fairness and full abstraction for communicating processes, On fairness notions in distributed systems. I: A characterization of implementability, On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof system for concurrent ADA programs
- Proof rules and transformations dealing with fairness
- A complete rule for equifair termination
- Concurrent histories: a basis for observing distributed systems
- Two normal form theorems for CSP programs
- Appraising fairness in languages for distributed programming
- Fairness and hyperfairness in multi-party interactions
- Interleaving set temporal logic
- A proof rule for fair termination of guarded commands
- Proving Liveness Properties of Concurrent Programs
- Guarded commands, nondeterminacy and formal derivation of programs
- Time, clocks, and the ordering of events in a distributed system
- Communicating sequential processes
