No label defined (Q3789045)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4052987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4052987 |
Statements
1988
0 references
distributed programs
0 references
communicating sequential processes
0 references
proof systems
0 references
communication complexity
0 references
CSP
0 references
time-complexity of sequential programs
0 references
0.7438786029815674
0 references
[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.
0 references