Teaching concurrency

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Teaching concurrency

Full text

Pdf (618 KB)

Source

ACM SIGACT News archive
Volume 40 , Issue 1 (March 2009) table of contents

COLUMN: Technical columns table of contents

Pages 58-62

Year of Publication: 2009

ISSN:0163-5700

Author

Leslie Lamport

Microsoft

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 105, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1515698.1515713 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	E. W. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, v.8 n.9, p.569, Sept. 1965 [doi>10.1145/365559.365617]
	2	R. W. Floyd. Assigning meanings to programs. In Proceedings of the Symposium on Applied Math., Vol. 19, pages 19--32. American Mathematical Society, 1967.
	3	C. A. R. Hoare, An axiomatic basis for computer programming, Communications of the ACM, v.12 n.10, p.576-580, Oct. 1969 [doi>10.1145/363235.363259]
	4	Leslie Lamport. The pluscal algorithm language. URL http://research.microsoft.com/users/lamport/tla/pluscal.html. The page can also be found by searching the Web for the 25-letter string obtained by removing the "-" from uid-lamportpluscalhomepage.
	5	Leslie Lamport. Specifying Systems. Addison-Wesley, Boston, 2003.