
doi: 10.1145/1780.1805
Summary: A simple definition of the axiomatic semantics of Communicating Sequential Processes is presented. The most important aspect of the approach is that it allows dealing with the individual processes of a program in isolation from the other processes. The axiomatic semantics is used to prove the correctness of a program for partitioning sets.
Specification and verification (program logics, model checking, etc.), axiomatic semantics, CSP, communicating processes, absence of deadlock, distributed termination, verification, Theory of operating systems, partial correctness
Specification and verification (program logics, model checking, etc.), axiomatic semantics, CSP, communicating processes, absence of deadlock, distributed termination, verification, Theory of operating systems, partial correctness
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 52 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
