Summary
In this paper we propose an axiomatic system for proving the total correctness of CSP programs. The system is based on the partial correctness system of [6, 7]. We use the proposed system to prove the total correctness of a program for set partitioning.
Similar content being viewed by others
References
Apt, K.R., Francez, N., de Roever, W.P.: A proof system for CSP. ACM TOPLAS 2, 359–385 (1980)
Apt, K.R.: Formal justification for a proof system for CSP. J. Assoc. Comput. Mach. 30, 197–216 (1983)
Apt, K.R., Pneuli, A., Stavi, J.: Fair termination revisted with delay, in Proc. 2nd conf. FST and TCS. pp. 146–170, Bangalore, Tata Institute of Fundamental Research, Bombay 1982 (Also to appear in Theoret. Comput. Sci.)
Levin, G., Gries, D.: A proof technique for CSP. Acta Inf. 15, 281–302 (1981)
Manna, Z., Pneuli, A.: Axiomatic approach to total correctness of programs. Acta Inf. 3, 243–264 (1974)
Soundararajan, N.: Axiomatic semantics of CSP. ACM TOPLAS 6, 647–662 (1984)
Soundararajan, N., Dahl, O.J.: Partial correctness semantics of CSP. (To appear in BIT)
Soundararajan, N.: Total correctness of CSP programs. Draft, 1984
Author information
Authors and Affiliations
Additional information
This work was supported in part by the NSF grant no. ECS8404725
Rights and permissions
About this article
Cite this article
Soundararajan, N. Total correctness of CSP programs. Acta Informatica 23, 193–215 (1986). https://doi.org/10.1007/BF00289498
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289498