Refining Santa: An Exercise in Efficient Synchronization. Sekerinski, E. & Yao, S. In Derrick, J., Dongol, B., & Reeves, S., editors, Proceedings 18th Refinement Workshop, Oxford, UK, 18th July 2018, volume 282, of Electronic Proceedings in Theoretical Computer Science, pages 68–86, October, 2018. Open Publishing Association.
Refining Santa: An Exercise in Efficient Synchronization [link]Paper  doi  abstract   bibtex   3 downloads  
The Santa Claus Problem is an intricate exercise for concurrent programming. This paper outlines the refinement steps to develop a highly efficient implementation with concurrent objects, starting from a simple specification. The efficiency of the implementation is compared to those in other languages.
@inproceedings{SekerinskiYao18RefiningSanta,
	series = {Electronic {Proceedings} in {Theoretical} {Computer} {Science}},
	title = {Refining {Santa}: {An} {Exercise} in {Efficient} {Synchronization}},
	volume = {282},
	url = {http://eptcs.web.cse.unsw.edu.au/content.cgi?Refine2018},
	doi = {10.4204/EPTCS.282.6},
	abstract = {The Santa Claus Problem is an intricate exercise for concurrent programming. This paper outlines the refinement steps to develop a highly efficient implementation with concurrent objects, starting from a simple specification. The efficiency of the implementation is compared to those in other languages.},
	booktitle = {Proceedings 18th {Refinement} {Workshop}, {Oxford}, {UK}, 18th {July} 2018},
	publisher = {Open Publishing Association},
	author = {Sekerinski, Emil and Yao, Shucai},
	editor = {Derrick, John and Dongol, Brijesh and Reeves, Steve},
	month = oct,
	year = {2018},
	pages = {68--86},
}

Downloads: 3