Fairness for dynamic control

Authors:
Jochen Hoenicke;Ernst-Rüdiger Olderog;Andreas Podelski
Affiliations:
Institut für Informatik, Universität Freiburg, Freiburg, Germany;Department für Informatik, Universität Oldenburg, Oldenburg, Germany;Institut für Informatik, Universität Freiburg, Freiburg, Germany
Venue:
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2010

Citing 14
Cited 0

Fairness

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
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Transition Invariants

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
Specification and Verification of Dynamic Communication Systems

ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Proving thread termination

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Fair stateless model checking

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Already in Lamport's bakery algorithm, integers are used for fair schedulers of concurrent processes. In this paper, we present the extension of a fair scheduler from ‘static control' (the number of processes is fixed) to ‘dynamic control' (the number of processes changes during execution). We believe that our results shed new light on the concept of fairness in the setting of dynamic control.