Communications of the ACM
Scheduling tasks with critical sections
ACM '77 Proceedings of the 1977 annual conference
Variables as Resource in Separation Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.02 |
This paper appears in the March, 1972, issue of the Communications of the ACM. Its abstract is reproduced below. Formalization of a well-defined synchronization mechanism can be used to prove that concurrently running processes of a system communicate correctly. This is demonstrated for a system consisting of many sending processes which deposit messages in a buffer and many receiving processes which remove messages from that buffer. The formal description makes it very easy to prove that the buffer will neither overflow nor underflow, that senders and receivers will never operate on the same message frame in the buffer nor will they run into a deadlock.