| 2012 | ||
|---|---|---|
| j18 | Stephen D. Brookes, Achim Jung, Catherine Meadows, Michael W. Mislove, Prakash Panangaden: Dedication. Electr. Notes Theor. Comput. Sci. 286: 3 (2012) | |
| 2006 | ||
| j17 | Stephen D. Brookes: Variables as Resource for Shared-Memory Programs: Semantics and Soundness. Electr. Notes Theor. Comput. Sci. 158: 123-150 (2006) | |
| 2004 | ||
| c19 | Stephen D. Brookes: Retracing the Semantics of CSP. 25 Years Communicating Sequential Processes 2004: 1-14 | |
| c18 | ||
| 2002 | ||
| j16 | ||
| j15 | Stephen D. Brookes, Michael W. Mislove: Foreword - MFPS 1996. Theor. Comput. Sci. 278(1-2): 1-2 (2002) | |
| j14 | ||
| c17 | Stephen D. Brookes: Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes. CONCUR 2002: 466-482 | |
| 2001 | ||
| j13 | Stephen D. Brookes: Transfer Principles for Reasoning About Concurrent Programs. Electr. Notes Theor. Comput. Sci. 45: 22-40 (2001) | |
| j12 | Stephen D. Brookes, Michael W. Mislove: Preface. Electr. Notes Theor. Comput. Sci. 45: 463-464 (2001) | |
| 1999 | ||
| j11 | Stephen D. Brookes: Reasoning About Recursive Processes: Expansion is not Always Fair. Electr. Notes Theor. Comput. Sci. 20: 182-201 (1999) | |
| j10 | Stephen D. Brookes, Achim Jung, Michael W. Mislove, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 20: 512-513 (1999) | |
| 1997 | ||
| j9 | Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove: Foreword. Electr. Notes Theor. Comput. Sci. 6: 1-2 (1997) | |
| j8 | Stephen D. Brookes: Idealized CSP: combining procedures with communicating processes. Electr. Notes Theor. Comput. Sci. 6: 60-76 (1997) | |
| 1996 | ||
| j7 | Stephen D. Brookes: Full Abstraction for a Shared-Variable Parallel Language. Inf. Comput. 127(2): 145-163 (1996) | |
| c16 | ||
| 1995 | ||
| j6 | Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove: Foreword and Dedication. Electr. Notes Theor. Comput. Sci. 1: 557-558 (1995) | |
| c15 | Stephen D. Brookes: A Category-Theoretic Treatment of a Parallel Algol-Like Language. Category Theory and Computer Science 1995: 180-181 | |
| c14 | Stephen D. Brookes, Denis Dancanet: Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness. POPL 1995: 13-24 | |
| 1994 | ||
| e3 | Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, LA, USA, April 7-10, 1993, Proceedings. Lecture Notes in Computer Science 802, Springer 1994, isbn 3-540-58027-1 | |
| 1993 | ||
| j5 | Stephen D. Brookes: Using Fixed-Point Semantics to Prove Retiming Lemmas. Formal Methods in System Design 2(1): 73-91 (1993) | |
| j4 | Stephen D. Brookes: Historical Introduction to "Concrete Domains" by G. Kahn and Gordon D. Plotkin. Theor. Comput. Sci. 121(1&2): 179-186 (1993) | |
| c13 | ||
| c12 | ||
| 1992 | ||
| j3 | Stephen D. Brookes, Shai Geva: Towards a Theory of Parallel Algorithms on Concrete Data Structures. Theor. Comput. Sci. 101(2): 177-221 (1992) | |
| e2 | Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991, Proceedings. Lecture Notes in Computer Science 598, Springer 1992, isbn 3-540-55511-0 | |
| 1991 | ||
| j2 | Stephen D. Brookes, A. W. Roscoe: Deadlock Analysis in Networks of Communicating Processes. Distributed Computing 4: 209-230 (1991) | |
| c11 | ||
| 1987 | ||
| c10 | ||
| 1986 | ||
| c9 | Stephen D. Brookes: A Semantically Based Proof System for Partial Correctness and Deadlock in CSP. LICS 1986: 58-65 | |
| 1985 | ||
| c8 | Stephen D. Brookes: An Axiomatic Treatment of a Parallel Programming Language. Logic of Programs 1985: 41-60 | |
| c7 | Stephen D. Brookes: A Fully Abstract Semantics and a Proof System for an ALGOL-Like Language with Sharing. Mathematical Foundations of Programming Semantics 1985: 59-100 | |
| e1 | Stephen D. Brookes, A. W. Roscoe, Glynn Winskel (Eds.): Seminar on Concurrency, Carnegie-Mellon University, Pittsburg, PA, USA, July 9-11, 1984. Lecture Notes in Computer Science 197, Springer 1985, isbn 3-540-15670-4 | |
| 1984 | ||
| j1 | Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe: A Theory of Communicating Sequential Processes. J. ACM 31(3): 560-599 (1984) | |
| c6 | ||
| c5 | Stephen D. Brookes, A. W. Roscoe: An Improved Failures Model for Communicating Processes. Seminar on Concurrency 1984: 281-305 | |
| 1983 | ||
| c4 | ||
| c3 | Stephen D. Brookes, William C. Rounds: Behavioural Equivalence Relations Induced by Programming Logics. ICALP 1983: 97-108 | |
| c2 | Stephen D. Brookes: A Semantics and Proof System for Communicating Processes. Logic of Programs 1983: 68-85 | |
| 1981 | ||
| c1 | William C. Rounds, Stephen D. Brookes: Possible Futures, Acceptances, Refusals, and Communicating Processes. FOCS 1981: 140-149 | |
| 1 | Denis Dancanet | |
| 2 | Shai Geva | |
| 3 | C. A. R. Hoare (Tony Hoare) | |
| 4 | Achim Jung | |
| 5 | Michael G. Main | |
| 6 | Catherine Meadows | |
| 7 | Austin Melton | |
| 8 | Michael W. Mislove | |
| 9 | Prakash Panangaden | |
| 10 | A. W. Roscoe (A. William Roscoe, Bill Roscoe) | |
| 11 | William C. Rounds | |
| 12 | Andre Scedrov | |
| 13 | David A. Schmidt | |
| 14 | Glynn Winskel |
Data released under the ODC-BY 1.0 license — See also our legal information page