Stephen D. Brookes

Affiliations:
  • Carnegie Mellon University, Pittsburgh, PA, USA


According to our database1, Stephen D. Brookes authored at least 50 papers between 1981 and 2022.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Wandering Spur Suppression in a 4.9-GHz Fractional-N Frequency Synthesizer.
IEEE J. Solid State Circuits, 2022

2021
Experimental Verification of Wandering Spur Suppression Technique in a 4.9 GHz Fractional-N Frequency Synthesizer.
Proceedings of the 47th ESSCIRC 2021, 2021

CSP: A Practical Process Algebra.
Proceedings of the Theories of Programming: The Life and Works of Tony Hoare, 2021

2019
4.48GHz 0.18μm SiGe BiCMOS Exact-Frequency Fractional-N Frequency Synthesizer with Spurious-Tone Suppression Yielding a -80dBc In-Band Fractional Spur.
Proceedings of the IEEE International Solid- State Circuits Conference, 2019

2018
A Denotational Semantics for SPARC TSO.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

A denotational account of C11-style memory.
CoRR, 2018

2016
Concurrent separation logic.
ACM SIGLOG News, 2016

2014
The Essence of Reynolds.
Formal Aspects Comput., 2014

On Grainless Footprint Semantics for Shared-memory Programs.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

2013
Dedication.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

2012
Dedication.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Syntactic Control of Interference and Concurrent Separation Logic.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

2011
A Revisionist History of Concurrent Separation Logic.
Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

2010
Fairness, Resources, and Separation.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

2007
A semantics for concurrent separation logic.
Theor. Comput. Sci., 2007

2006
Retracing CSP.
Electron. Notes Theor. Comput. Sci., 2006

Variables as Resource for Shared-Memory Programs: Semantics and Soundness.
Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

2005
A Grainless Semantics for Parallel Programs with Shared Mutable Data.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

2004
Retracing the Semantics of CSP.
Proceedings of the Communicating Sequential Processes: The First 25 Years, 2004

2002
Dedication.
Theor. Comput. Sci., 2002

Foreword - MFPS 1996.
Theor. Comput. Sci., 2002

The Essence of Parallel Algol.
Inf. Comput., 2002

Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes.
Proceedings of the CONCUR 2002, 2002

2001
Preface.
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

Transfer Principles for Reasoning About Concurrent Programs.
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

1999
Preface.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

Reasoning About Recursive Processes: Expansion is not Always Fair.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

1997
Foreword.
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

Idealized CSP: combining procedures with communicating processes.
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

1996
Full Abstraction for a Shared-Variable Parallel Language.
Inf. Comput., 1996

1995
Foreword and Dedication.
Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

A Category-Theoretic Treatment of a Parallel Algol-Like Language.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1993
Historical Introduction to "Concrete Domains" by G. Kahn and Gordon D. Plotkin.
Theor. Comput. Sci., 1993

Using Fixed-Point Semantics to Prove Retiming Lemmas.
Formal Methods Syst. Des., 1993

Sequential Functions on Indexed Domains and Full Abstraction for a Sub-Language of PCF.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992
Towards a Theory of Parallel Algorithms on Concrete Data Structures.
Theor. Comput. Sci., 1992

1991
Deadlock Analysis in Networks of Communicating Processes.
Distributed Comput., 1991

Continuous Functions and Parallel Algorithms on Concrete Data Structures.
Proceedings of the Mathematical Foundations of Programming Semantics, 1991

1987
Semantically Based Axiomatics.
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

1986
A Semantically Based Proof System for Partial Correctness and Deadlock in CSP
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985
A Fully Abstract Semantics and a Proof System for an ALGOL-Like Language with Sharing.
Proceedings of the Mathematical Foundations of Programming Semantics, 1985

An Axiomatic Treatment of a Parallel Programming Language.
Proceedings of the Logics of Programs, 1985

1984
A Theory of Communicating Sequential Processes.
J. ACM, 1984

An Improved Failures Model for Communicating Processes.
Proceedings of the Seminar on Concurrency, 1984

On the Axiomatic Treatment of Concurrency.
Proceedings of the Seminar on Concurrency, 1984

1983
A Semantics and Proof System for Communicating Processes.
Proceedings of the Logics of Programs, 1983

Behavioural Equivalence Relations Induced by Programming Logics.
Proceedings of the Automata, 1983

On the Relationship of CCS and CSP.
Proceedings of the Automata, 1983

1981
Possible Futures, Acceptances, Refusals, and Communicating Processes
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981


  Loading...