What a process may share
A subject the papers are about. The loosest grouping, and the one to reach for last.
What concurrent processes may share, and what keeps the sharing honest. Collects both halves of that question: the language constructs -- semaphores, monitors, message passing -- and the proof rules that track ownership of the same state. Membership requires the work to be about the sharing discipline itself, not merely to be concurrent.
21 references
Models of Computation based on Automata: Formal Languages and Communicating Processes
Jos Baeten (2026) · Centrum Wiskunde & Informatica
Deductive verification of active objects with Crowbar
Eduard Kamburjan and others (2023) · Science of Computer Programming · Elsevier BV
The semantics of shared memory in Intel CPU/FPGA systems
Dan Iorga and others (2021) · Proceedings of the ACM on Programming Languages · Association for Computing Machinery
Concurrent separation logic
Stephen Brookes and others (2016) · ACM SIGLOG News
Communicating state transition systems for fine-grained concurrent resources
Aleksandar Nanevski and others (2014) · 23rd European Symposium on Programming Languages and Systems (ESOP) · Springer
Reactive Turing machines
J. C. M. Baeten and others (2013) · Information and Computation · Elsevier BV
Views: compositional reasoning for concurrent programs
Thomas Dinsdale-Young and others (2013) · 40th ACM Symposium on Principles of Programming Languages (POPL) · Association for Computing Machinery
Verification of Sequential and Concurrent Programs
Krzysztof R. Apt and others (2009) · Springer
Resources, concurrency, and local reasoning
Peter W. O'Hearn (2007) · Theoretical Computer Science · Elsevier
Distributed snapshots: determining global states of distributed systems
K. Mani Chandy and others (1985) · ACM Transactions on Computer Systems · Association for Computing Machinery
Experience with processes and monitors in Mesa
Butler W. Lampson and others (1980) · Communications of the ACM · Association for Computing Machinery
Distributed processes: a concurrent programming concept
Per Brinch Hansen (1978) · Communications of the ACM · Association for Computing Machinery
Reproducible testing of monitors
Per Brinch Hansen (1978) · Software: Practice and Experience · Wiley
Communicating sequential processes
C. A. R. Hoare (1978) · Communications of the ACM · Association for Computing Machinery
An axiomatic proof technique for parallel programs I
Susan Owicki and others (1976) · Acta Informatica · Springer
Verifying properties of parallel programs: An axiomatic approach
Susan Owicki and others (1976) · Communications of the ACM · Association for Computing Machinery (ACM)
Axiomatic Proof Techniques for Parallel Programs
Susan Speer Owicki (1975) · Cornell University
Monitors: an operating system structuring concept
C. A. R. Hoare (1974) · Communications of the ACM · Association for Computing Machinery
Structured multiprogramming
Per Brinch Hansen (1972) · Communications of the ACM · Association for Computing Machinery
The structure of the "THE"-multiprogramming system
Edsger W. Dijkstra (1968) · Communications of the ACM · Association for Computing Machinery
Solution of a problem in concurrent programming control
Edsger W. Dijkstra (1965) · Communications of the ACM · Association for Computing Machinery