Fixpoint approach to the theory of computation
Communications of the ACM
The specification of process synchronization by path expressions
Operating Systems, Proceedings of an International Symposium
Implementation and applications of Scott's logic for computable functions
Proceedings of ACM conference on Proving assertions about programs
Axioms and theorems for integers, lists and finite sets in LCF.
Axioms and theorems for integers, lists and finite sets in LCF.
On synchronization primitive systems
On synchronization primitive systems
Mathematical concepts in programming language semantics
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A class of allocation strategies inducing bounded delays only
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
The denotational semantics of programming languages
Communications of the ACM
Survey of recent operating systems research, designs and implementations
ACM SIGOPS Operating Systems Review
| Hi-index | 0.02 |
This paper presents a semantic model for parallel systems with a scheduling mechanism that is useful for expressing and proving a wider range of properties than semantic models that do not consider scheduling.We formally describe a number of properties related to scheduling and deadlock, including "Fairness" and "Fullness", and show that schedulers with these properties behave in desirable ways.Lastly, we prove and conjecture some proof rules for scheduled systems and outline briefly the relation of this work to modelling protection in parallel systems.