A proof rule for fair termination of guarded commands
Information and Control - The MIT Press scientific computation series
Fairness
Fairness in parallel programs: the transformational approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantics of sequential and parallel programs
Semantics of sequential and parallel programs
Verification of sequential and concurrent programs (2nd ed.)
Verification of sequential and concurrent programs (2nd ed.)
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Adequacy for Algebraic Effects
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Transition predicate abstraction and fair termination
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination proofs for systems code
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Specification and Verification of Dynamic Communication Systems
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Separating fairness and well-foundedness for the analysis of fair discrete systems
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Abstraction refinement for termination
SAS'05 Proceedings of the 12th international conference on Static Analysis
| Hi-index | 0.00 |
In explicit fair schedulers, auxiliary integer-valued scheduling variables with non-deterministic assignments and with decrements keep track of each processor's relative urgency. Every scheduled execution is fair and yet, the scheduler is sufficiently permissive (every fair run can be scheduled). In this paper we investigate whether explicit fair scheduling also works with dynamic control, i.e., when new processes may be created dynamically. We give a positive and a negative answer.