Skip to main content
SpringerLink
Log in

Total correctness of CSP programs

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apt, K.R., Francez, N., de Roever, W.P.: A proof system for CSP. ACM TOPLAS 2, 359–385 (1980)

    Google Scholar 

  2. Apt, K.R.: Formal justification for a proof system for CSP. J. Assoc. Comput. Mach. 30, 197–216 (1983)

    Google Scholar 

  3. 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.)

    Google Scholar 

  4. Levin, G., Gries, D.: A proof technique for CSP. Acta Inf. 15, 281–302 (1981)

    Google Scholar 

  5. Manna, Z., Pneuli, A.: Axiomatic approach to total correctness of programs. Acta Inf. 3, 243–264 (1974)

    Google Scholar 

  6. Soundararajan, N.: Axiomatic semantics of CSP. ACM TOPLAS 6, 647–662 (1984)

    Google Scholar 

  7. Soundararajan, N., Dahl, O.J.: Partial correctness semantics of CSP. (To appear in BIT)

  8. Soundararajan, N.: Total correctness of CSP programs. Draft, 1984

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, The Ohio State University, 43210, Columbus, OH, USA

    N. Soundararajan

Authors
  1. N. Soundararajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported in part by the NSF grant no. ECS8404725

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289498

Keywords

Search

Navigation