| |
| 1983 | ||
|---|---|---|
| 8 | David Michael Ritchie Park: Reasoning with Fairness Constraints. FCT 1983: 516-517 | |
| 1981 | ||
| 7 | David Michael Ritchie Park: Concurrency and Automata on Infinite Sequences. Theoretical Computer Science 1981: 167-183 | |
| 1979 | ||
| 6 | David Michael Ritchie Park: On the Semantics of Fair Parallelism. Abstract Software Specifications 1979: 504-526 | |
| 5 | Akira Kanda, David Michael Ritchie Park: When are two Effectively given Domains Identical?. Theoretical Computer Science 1979: 170-181 | |
| 1976 | ||
| 4 | David Michael Ritchie Park: Finiteness is Mu-Ineffable. Theor. Comput. Sci. 3(2): 173-181 (1976) | |
| 1975 | ||
| 3 | A. J. Kfoury, David Michael Ritchie Park: On the Termination of Program Schemas Information and Control 29(3): 243-251 (1975) | |
| 1972 | ||
| 2 | Peter Hitchcock, David Michael Ritchie Park: Induction Rules and Termination Proofs. ICALP 1972: 225-251 | |
| 1970 | ||
| 1 | David C. Luckham, David Michael Ritchie Park, Mike Paterson: On Formalised Computer Programs. J. Comput. Syst. Sci. 4(3): 220-249 (1970) | |
| 1 | Peter Hitchcock | [2] |
| 2 | Akira Kanda | [5] |
| 3 | Assaf J. Kfoury (A. J. Kfoury) | [3] |
| 4 | David C. Luckham | [1] |
| 5 | Mike Paterson | [1] |