On Guarded Commands with Fair Choice. Sekerinski, E. In Backhouse, R. & Oliveira, J., editors, 5th International Conference on the Mathematics of Program Construction, MPC 2000, volume 1837, of Lecture Notes in Computer Science, pages 127–139, Ponte de Lima, Portugal, July, 2000. Springer-Verlag. CitationKey: Sekerinski00FairChoice
doi  abstract   bibtex   1 download  
For the purpose of program development, fairness is typically formalized by verification rules or, alternatively, through refinement rules. In this paper we give an account of (weak) fairness in an algebraic style, extending recently proposed algebraic accounts of iterations and loops using the predicate transformer model of statements.
@inproceedings{sekerinski_guarded_2000,
	address = {Ponte de Lima, Portugal},
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {On {Guarded} {Commands} with {Fair} {Choice}},
	volume = {1837},
	doi = {10.1007/10722010_9},
	abstract = {For the purpose of program development, fairness is typically formalized by verification rules or, alternatively, through refinement rules. In this paper we give an account of (weak) fairness in an algebraic style, extending recently proposed algebraic accounts of iterations and loops using the predicate transformer model of statements.},
	booktitle = {5th {International} {Conference} on the {Mathematics} of {Program} {Construction}, {MPC} 2000},
	publisher = {Springer-Verlag},
	author = {Sekerinski, Emil},
	editor = {Backhouse, Roland and Oliveira, Jose},
	month = jul,
	year = {2000},
	note = {CitationKey: Sekerinski00FairChoice},
	pages = {127--139},
}

Downloads: 1