Wikipedia and links from there.
Computer Science has no Nobel prize. The nearest we have is the Turing award. I've asked generations of Chalmers/GU students in computer science what this award is, who has won it, and for what. They typically have no idea. I think this reflects a failing on the part of the department, so here is a first attempt to fix our lack of historical awareness.
Below is a list of researchers who won the Turing award mostly for work in concurrency, though many of the other winners too did related work.
You can read their acceptance speeches (the Turing lectures), and all the others, at
The others you should read are, at least,
You will no doubt be tempted by the titles of several of the others. Give in! In fact, glancing through the whole lot (they are all informal and easy to read) will introduce you to several other related issues, whether to do with computers or programming languages, and is an excellent way to get a broad liberal computer science education. Learn from the masters!
The talks also frequently mention other researchers who did not get the Turing award (they only give one a year). It's useful to pick up names.
Many of the papers below are still under copyright, so we cannot give a direct link. Instead, you will have to get them from the Chalmers library. Search with the paper title, except if otherwise indicated.
If I had to pick one person whose collected works give you a liberal education in computer science, it would be Robin Milner. The wikipedia page
gives a starting point, as do
Items 1 and 2 below deal with papers by others describing Milner's work.
C. A. R. Hoare is together with Milner probably the researcher who has been in the field longest and had a comparable impact.
will lead you to many more links. A few of Hoare's most important works:
Monitors: an operating system structuring concept by Tony Hoare
You can read the CACM 1974 typeset paper via the library.
Communicating Sequential Processes by Tony Hoare Communications of the ACM 1978
Can be read via the library, or at http://www.cs.ucf.edu/courses/cop4020/sum2009/CSP-hoare.pdf
Communicating Sequential Processes (book by Tony Hoare)
is available online at http://www.usingcsp.com/cspbook.pdf
Algorithm 64: Quicksort
Comm. ACM 4 (7): 321. (1961)
It is almost unbelievable what an early work this algorithm was, and how fortunate we are that the inventor is still with us!
An axiomatic basis for computer programming by Hoare, C. A. R.
Communications of the ACM 12 (10): 576–580. (October 1969).
What we now call axiomatic semantics (pre- and post-conditions, or a version of contracts), as opposed to operational or denotational semantics.
A towering figure, particularly in the early days of concurrent programming, and very insistent on properly defining concepts such as priority that tended to be used informally late into the 1970's. He is associated with the first definition of semaphores, and was also a brilliant programmer who invented the concept of guarded commands, a version of which turns up in Promela.
In addition to the usual wikipedia links
http://en.wikipedia.org/wiki/Edsger_W._Dijkstra http://en.wikipedia.org/wiki/Semaphore_(programming) http://en.wikipedia.org/wiki/Guarded_Command_Language http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm http://en.wikipedia.org/wiki/Dining_philosophers_problem
you can read Tony Hoare's obituary here:
Cooperating sequential processes by E. W.Dijkstra
appeared in Programming Languages edited by F. Genuys, Academic Press. (1968). Available online now at http://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD123.html
Behind the old-fashioned notation lurk surprisingly modern treatments of semaphores and still standard problems.
Guarded commands, non-determinacy and formal derivation of programs
by E. W.Dijkstra Communications of the ACM 18 (1975), 8: 453–457.
Available online at http://www.cs.utexas.edu/users/EWD/ewd04xx/EWD472.PDF
Letters to the editor: go to statement considered harmful
by Dijkstra, E. W.
Communications of the ACM 11 (3): 147–148. (March 1968).
doi:10.1145/362929.362947. ISSN 0001-0782.
This famous letter started the movement known as Structured Programming, also the title of a book by O.-J. Dahl, E. W. Dijkstra, C. A. R. Hoare, Academic Press, London, 1972 ISBN 0-12-200550-3 which also includes the beginning of object oriented programming.
The ideas behind the "goto" problem have been so thoroughly absorbed that even beginning students expect to only need sequencing, conditionals and loops. In 1968, most people were puzzled as to how one could program without arbitrary jumps.
A small selection of classic papers.
E. D. Dijkstra (1968) "Cooperating sequential processes"
Tony Hoare, "Monitors: an operating system structuring concept"
(you can read the CACM 1974 typeset paper via the library)
Tony Hoare's CSP book is online.
His paper of the same name, CACM 1978, can be read via the library, or at
Carriero and Gelernter's LINDA paper is available at
For most other references from the textbook, you will have to use the library. As and when we locate other versions online, we will add links here. A major failing of Ben-Ari is that he does not link to Milner's work. Read his papers from the library. E.g., his original CCS (calculus of communicating systems) book.
Several of the references in Ben-Ari's textbook (see the Bibliography at the end) are to books, and these are typically not available online. But the papers are, through the library. Look them up! Bibliographies and lists of references, whether in your textbook or in the papers I hope you will read, are not there to be ignored. The original papers have a freshness that can never be recaptured in a re-telling. Reading the original literature is an essential part of becoming a scientist.
Turing Lecture: The Computer Science of Concurrency: The Early Years by Leslie Lamport
See "Det dunkelt sagda är det dunkelt tänkta" in
There are many reports about the Gaisal train accident, but most deal with politics. The timing issue and the mix-up between the various safety systems is mentioned in
Here are two paragraphs from the report referring to the programming-related errors:
"Chandra thought that it is a matter of 15 minutes and the train will make it to Gaisal much before Brahmputra crosses it and then shift to the up-line. He granted paper-line clear to Awadh-Assam Express but his fatal error was that he failed to inform Gaisal about it. He should have told Gaisal station master to ensure that Awadh-Assam has reached, before giving clearance to Brahmputra Mail, an official, part of CCRS inquiry, said.
What the Kishanganj ASM did not know was that Awadh-Assam driver was waiting at the next station, Panjipara, for 12 minutes awaiting paper-line clear. The driver knew he was on the wrong line and wanted to continue only after receiving clearance from Panjipara, which was given to him, in utter complacency. So he proceeded towards Gaisal, unaware that Gaisal did not know about his arrival. The Gaisal station staff, meanwhile, did not know about the approaching Awadh-Assam and gave clearance to Brahmputra for arrival."
The teaching team will be glad to organize a student poster exhibition if there is interest. The idea is that you (individually or in teams of any size) prepare a brief presentation on any paper or work you choose, classic or recent, in an area at least distantly related to concurrency. You do not give a lecture to the class; instead, you prepare a few minutes' worth of slides, diagrams, animation or films (any or all of those) and stand next to a handwritten poster announcing your topic. Visitors come to you if they wish, and ask whatever they want. You answer as best you can.
Participation is entirely voluntary and carries no credit towards your grade. You do a poster presentation if you wish, and visit the exhibition if you wish. The purpose is only to give you an occasion to get (back) into the habit of finding out something and telling others about it.
We will decide when and where to hold the exhibition once we know how many students would like to take part, so please express your interest via the Google group. If you wish, we can help you pick a paper.