Summary
The center of study is programming that allows communication between program and its environment. A modified version of Hoare's CSP is applied as programming language and its main features in connection with semantics and completeness are investigated. Semantics is based on an appropriate type of games by using its tree representation. These entities are shown to be definable in first order logic. Hence the descriptive language is complete in the classical sense and a complete calculus is developed in the spirit of Floyd and Hoare.
To illustrate the usage of the descriptive language and its calculus a program simulating a simple calculator is considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Francez, N., Hoare, C.A.R., Lehmann, D.J., De Roever, W.P.: Semantics of nondeterminism, concurrency and communication, Journal of Computer and System Sciences, v. 19, 290–308 (1979)
Gergely, T., Úry, L.: Program behaviour specification through explicit time consideration, Lavington, S.H. (ed.). Information Processing 80, North Holland, 1980. pp. 107–111
Gergely, T., Úry, L.: Nondeterministic programming within the frame of first order classical logic, Acta Cybernetica, 1979. Tom 4. Fasc. 4. Szeged, 1980, pp. 334–375
Manna, Z.: The correctness of nondeterministic programs. Artificial Intelligence, v.1. 1970. N∘ 1-2, pp. 1–26
Hoare, C.A.R.: Communicating sequential processes. Comm. ACM, 21, 666–677 (1978)
Author information
Authors and Affiliations
Additional information
This research work was supported by the Grant of State Committee for Technical Development, Budapest, Hungary
Rights and permissions
About this article
Cite this article
Gergely, T., Úry, L. A theory of interactive programming. Acta Informatica 17, 1–20 (1982). https://doi.org/10.1007/BF00262972
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00262972