Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Redundant proofs of non-interference in Levin-Gries CSP program proofs

  • Published:
Acta Informatica Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Summary

The proof system for Hoare's CSP language proposed by Levin and Gries requires that non-interference be proven for each assertion used in the proof of a process. In the worst case, the effort required to provide such proofs could be enormous. The need for these proofs has been identified as a significant weakness of the system. In this paper, we show that most of the proofs of non-interference required are unnecessary. This suggest that proving non-interference in the Levin-Gries system may be far less burdensome than had previously been assumed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 communicating sequential processes. ACM Trans. Program. Lang. Syst. 2, 359–385 (1980)

    Google Scholar 

  2. Apt, K.R.: Proving correctness of CSP program, a tutorial. In: Broy, M. (ed.), Control Flow and Data Flow: Concepts of Distributed Programming, pp. 441–474. Berlin-Heidelberg-New York-Tokyo: Springer 1985

    Google Scholar 

  3. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21, 666–677 (1978)

    Google Scholar 

  4. Lamport, L.: The ‘Hoare logic’ of concurrent programs. Acta Inf. 14, 21–37 (1980)

    Google Scholar 

  5. Lamport, L., Schneider, F.B.: The ‘Hoare logic’ of CSP, and all that. ACM Trans. Program. Lang. Syst. 6, 281–296 (1984)

    Google Scholar 

  6. Levin, G.M., Gries, D.: Proof techniques for communicating sequential processes. Acta Inf. 15, 281–302 (1981)

    Google Scholar 

  7. Misra, J., Chandy, K.M.: Proofs of networks of processes. IEEE Trans. Software Eng. 7, 417–426 (1981)

    Google Scholar 

  8. Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Inf. 6, 319–340 (1976)

    Google Scholar 

  9. Prasad, V.R.: Interference-freedom in proofs of CSP programs. Proceedings of the 4th IEEE International Conference on Distributed Computing Systems. San Francisco, May 1984, 79–86

  10. Soundararajan, N.: Axiomatic semantics of communicating sequential processes. ACM Trans. Program. Lang. Syst. 6, 647–662 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Williams College, 01267, Williams Town, MA, USA

    Thomas P. Murtagh

Authors
  1. Thomas P. Murtagh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Murtagh, T.P. Redundant proofs of non-interference in Levin-Gries CSP program proofs. Acta Informatica 24, 145–156 (1987). https://doi.org/10.1007/BF00264361

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation