scientific article; zbMATH DE number 4052987
[For the entire collection see Zbl 0638.00034.] Our main aim is to obtain proof systems for the analysis of communication complexity of CSP programs [cf. \textit{C. A. R. Hoare}, Commun. ACM 21, 666-667 (1978; Zbl 0383.68028)] that permits us to view the informal analysis of CSP programs for arriving at the communication complexity as formal proofs in the proof systems of the programs by ignoring the information in the program that is not relevant for the analysis of run- time behaviour. The development of Hoare-like proof systems for the analysis of time-complexity of sequential programs as by \textit{H. R. Nielson} [Foundations of software technology and theoretical computer science, 3rd Conf., Bangalore/India 1983, 258-273 (1983; Zbl 0533.68009)] has been the primary motivation for this work.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789045)