A static analysis is proposed as a method of reducing complexity of the correctness proofs of CSP programs. This analysis is based on considering all possible sequences of communications which can arise in computations during which the boolean guards are not interpreted. Several examples are provided which clarify its various aspects.
CITATION STYLE
Apt, K. R. (1984). A static analysis of CSP programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 164 LNCS, pp. 1–17). Springer Verlag. https://doi.org/10.1007/3-540-12896-4_351
Mendeley helps you to discover research relevant for your work.