References

  1. Gregory R. Andrews (1991): Concurrent Programming: Principles and Practice. Benjamin/Cummings Publishing Company.
  2. Mordechai Ben-Ari (1998): How to solve the Santa Claus problem. Concurrency - Practice and Experience 10(6), pp. 485–496, doi:10.1002/(SICI)1096-9128(199805)10:6<485::AID-CPE329>3.0.CO;2-2.
  3. Nick Benton (2003): Jingle bells: Solving the Santa Claus problem in Polyphonic C#. Technical Report. Microsoft Research. Available at https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/santa.pdf.
  4. Marcello M. Bonsangue, Joost N. Kok & Kaisa Sere (1999): Developing Object-based Distributed Systems. In: P. Ciancarini, A. Fantechi & R. Gorrieri: 3rd IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS'99). Kluwer, pp. 19–34, doi:10.1007/978-0-387-35562-7_3.
  5. Martin Büchi & Emil Sekerinski (2000): A Foundation for Refining Concurrent Objects. Fundamenta Informaticae 44(1,2), pp. 25–61. Available at http://content.iospress.com/articles/fundamenta-informaticae/fi44-1-2-02.
  6. Peter A. Buhr (2016): High-Level Concurrency Constructs. In: Understanding Control Flow: Concurrent Programming Using μC++. Springer International Publishing, Cham, pp. 425–522, doi:10.1007/978-3-319-25703-7_9.
  7. Nick Cameron, Ferruccio Damiani, Sophia Drossopoulou, Elena Giachino & Paola Giannini (2006): Solving the Santa Claus problem using state classes. Technical Report. Dip. di inf., Univ. di Torino. Available at http://www.di.unito.it/~damiani/papers/scp.pdf.
  8. Steingrim Dovland (2006): Liberating Coroutines: Combining Sequential and Parallel Execution. University of Oslo, Department of Informatics. Available at http://urn.nb.no/URN:NBN:no-11637.
  9. Allen B. Downey (2016): Little Book of Semaphores. Green Tea Press. Available at http://greenteapress.com/semaphores.
  10. Jason Hurt & Jan B. Pedersen (2008): Solving the Santa Claus Problem: a Comparison of Various Concurrent Programming Techniques. In: Peter H. Welch, Susan Stepney, Fiona A.C. Polack, Frederick R.M. Barnes, Alistair A. McEwan & Adam T. Sampson Gardiner S. Stiles, Jan F. Broenink: Communicating Process Architectures 2008. IOS Press, pp. 381–396, doi:10.3233/978-1-58603-907-3-381.
  11. Jayadev Misra (2002): A Simple, Object-Based View of Multiprogramming. Formal Methods in System Design 20(1), pp. 23–45, doi:10.1023/A:1012904412467.
  12. Joshua Moore-Oliva, Emil Sekerinski & Shucai Yao (2014): A Comparison of Scalable Multi-Threaded Stack Mechanisms. Technical Report CAS-14-07-ES. McMaster University, Department of Computing and Software. Available at http://www.cas.mcmaster.ca/cas/0reports/CAS-14-07-ES.pdf.
  13. Piotr Nienaltowski (2007): Practical framework for contract-based concurrent object-oriented programming. ETH Zürich, doi:10.3929/ethz-a-005363875.
  14. Simon Peyton Jones (2007): Beautiful concurrency. In: A. Oram & G. Wilson: Beautiful Code: Leading Programmers Explain How They Think. O'Reilly, pp. 385–406. Available at https://www.schoolofhaskell.com/school/advanced-haskell/beautiful-concurrency.
  15. Emil Sekerinski (2005): Verification and Refinement with Fine-Grained Action-Based Concurrent Objects. Theoretical Computer Science 331(2–3), pp. 429–455, doi:10.1016/j.tcs.2004.09.024.
  16. John A. Trono (1994): A new exercise in concurrency. ACM SIGCSE Bulletin 26(3), pp. 8–10, doi:10.1145/187387.187391.
  17. Peter H. Welch & Jan B. Pedersen (2010): Santa Claus: Formal Analysis of a Process-oriented Solution. ACM Trans. Program. Lang. Syst. 32(4), pp. 14:1–14:37, doi:10.1145/1734206.1734211.
  18. Shucai Yao (2018, Draft): An Efficient Implementation of Guard-based Synchronization for an Object-Oriented Programming Language. McMaster University.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org