| Bakery Algorithm |
Lamport, L. |
1974-08 |
Computing Foundations |
Has Notes |
|
| Can Programming be Liberated from the Von Neumann Style?: a Functional Style and its Algebra of Programs |
Backus, J. |
1978-08 |
Computing Foundations |
Has Notes |
|
| Co-operating Sequential Processes |
Dijkstra, E. W. |
1966 |
Computing Foundations |
Has Notes |
|
| Communicating Sequential Processes |
Hoare, C. A. R. |
1978 |
Computing Foundations |
Has Notes |
|
| The Computer Science of Concurrency: the Early Years |
Lamport, L. |
2015-05 |
Computing Foundations |
Has Notes |
|
| Defining Liveness |
Alpern, B.; Schneider, F. B. |
1985-10 |
Computing Foundations |
Has Notes |
|
| Fork and Join |
Conway, M. |
1963-11 |
Computing Foundations |
Has Notes |
|
| Guarded Commands, Nondeterminacy and Formal Derivation of Programs |
Dijkstra, E. W. |
1975-08 |
Computing Foundations |
Has Notes |
|
| LAMBDA: The Ultimate Declarative |
Steele, G. L. |
1976-11 |
Computing Foundations |
Has Notes |
|
| LAMBDA: the Ultimate Imperative |
Steele, G. L.; Sussman, G. J. |
1976-03-10 |
Computing Foundations |
Has Notes |
|
| The Notions of Time and Global State in a Distributed System |
Antoniadis, K.; Geurraoui, R. |
2015-05 |
Computing Foundations |
Has Notes |
|
| Principles of Transaction-Oriented Database Recovery |
Haerder, T.; Reuter, A. |
1983-12 |
Computing Foundations |
Has Notes |
|
| Self-Stabilizing Systems in Spite of Distributed Control |
Dijkstra, E. W. |
1974-11 |
Computing Foundations |
Has Notes |
|
| A Theory of Communicating Sequential Processes |
Brookes, S. D.; Hoare, C. A. R.; Roscoe, A. W. |
1984-07 |
Computing Foundations |
Has Notes |
|
| Why do Computers Stop and What can be Done About It? |
Gray, J. |
1985-06 |
Computing Foundations |
Has Notes |
|