Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
America, P., de Boer, F.S.: A proof system for process creation. In: Pnueli, A. (ed.) Proc. of the TC2 Working Conference on Programming Concepts and Methods – Preprint, IFIP, pp. 292–320 (1990)
Apt, K.R., Olderog, E.R.: Proof rules and transformations dealing with fairness. Sci. of Comp. Progr. 3, 65–100 (1983)
Apt, K.-R., Olderog, E.-R.: Verification of Sequential and Concurrent Programs, 2nd edn. Springer, Heidelberg (1997)
Best, E.: Semantics of Sequential and Parallel Programs. Prentice-Hall, Englewood Cliffs (1996)
Bauer, J., Schaefer, I., Toben, T., Westphal, B.: Specification and verification of dynamic communication systems. In: Goossens, K., Petrucci, L. (eds.) Proc. of the 6th Intern. Conf. on Application of Concurrency to System Design (ACSD), Turku, Finland. IEEE, Los Alamitos (2006)
Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixedpoints. In: Proc. of 4th Symp. on Principles of Programming Languages (POPL), pp. 238–252. ACM, New York (1977)
Cook, B., Podelski, A., Rybalchenko, A.: Abstraction refinement for termination. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 87–101. Springer, Heidelberg (2005)
Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: Proc. of the ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI), pp. 415–426. ACM Press, New York (2006)
Cook, B., Podelski, A., Rybalchenko, A.: Proving thread termination. In: Proc. of the ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI). ACM Press, New York (2007)
de Boer, F.S.: A proof rule for process-creation. In: Wirsing, M. (ed.) Formal Description of Programming Concepts – III. IFIP, pp. 23–50. North-Holland, Amsterdam (1987)
Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Comm. of the ACM 18, 453–457 (1975)
Francez, N.: Fairness. Springer, New York (1986)
Grümberg, O., Francez, N., Makowsky, J.A., de Roever, W.-P.: A proof rule of fair termination of guarded commands. In: de Bakker, J.W., van Vliet, J.C. (eds.) Proc. of the IFIP Symposium on Algorithmic Languages, pp. 339–416. North-Holland, Amsterdam (1981)
Grümberg, O., Francez, N., Makowsky, J.A., de Roever, W.-P.: A proof rule of fair termination of guarded commands. Information and Control 66(1/2), 83–102 (1985); Revised version of [GFMdR81]
Hoare, C.A.R.: Remarks on fairness. Private communication (1996)
Lehmann, D., Pnueli, A., Stavi, J.: Impartiality, justice and fairness: the ethics of concurrent termination. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 264–277. Springer, Heidelberg (1981)
Musuvathi, M., Quadeer, S.: Fair stateless model checking. In: Proc. of ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI) (June 2008); Preprint appeared as Technical Report MSR-TR-2007-149, Microsoft Research, Redmond (December 2007)
Olderog, E.R., Apt, K.R.: Fairness in parallel programs, the transformational approach. ACM TOPLAS 10, 420–455 (1988)
Pnueli, A., Arons, T.: TLPVS: A PVS-based LTL verification system. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 598–625. Springer, Heidelberg (2004)
Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI-FN 19, Dept. of Comp. Sci., Aarhus University (1981)
Plotkin, G.D.: Adequacy for algebraic effects. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, p. 1. Springer, Heidelberg (2001)
Plotkin, G.D.: A structural approach to operational semantics. J. of Logic and Algebraic Programming 60-61, 17–139 (2004); Revised version of [?]
Pnueli, A., Podelski, A., Rybalchenko, A.: Separating fairness and well-foundedness for the analysis of fair discrete systems. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 124–139. Springer, Heidelberg (2005)
Podelski, A., Rybalchenko, A.: Transition invariants. In: Proc. of the 19th IEEE Symposium on Logic in Computer Science (LICS), pp. 32–41. IEEE Computer Society, Los Alamitos (2004)
Podelski, A., Rybalchenko, A.: Transition predicate abstraction and fair termination. In: Palsberg, J., Abadi, M. (eds.) Proc. of the 32nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL), pp. 132–144. ACM, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Olderog, ER., Podelski, A. (2010). Explicit Fair Scheduling for Dynamic Control. In: Dams, D., Hannemann, U., Steffen, M. (eds) Concurrency, Compositionality, and Correctness. Lecture Notes in Computer Science, vol 5930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11512-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-11512-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11511-0
Online ISBN: 978-3-642-11512-7
eBook Packages: Computer ScienceComputer Science (R0)