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

Partial correctness of exits from concurrent structures

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A rudimentary exit-mechanism from the parallel command of the language fragment CSP is introduced. A method for embedding invariants in a standard partial correctness system with pre-and postconditions is presented. Proof rules for exits from concurrent systems are introduced, and a simple data flow system is verified.

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. C. A. R. Hoare,Communicating sequential processes. Communications of the ACM, 21(8): 666–677, 1978.

    Article  Google Scholar 

  2. Reference Manual for the Ada Programming Language. U.S. Department of Defense, January 1983. ANSI/MIL-STD-1815A.

  3. Occam Programming Manual. INMOS, 1983.

  4. Sigurd Meldal,An axiomatic semantics for nested concurrency. BIT 26: 2, 164–174, 1986.

    MathSciNet  Google Scholar 

  5. Sigurd Meldal,Predicting the future: Proof-rules for exceptions in concurrent structures. Research Report 101, Institute of Informatics, University of Oslo, April 1986.

  6. Sigurd Meldal,Language elements for hierarchical abstraction in concurrent structures. Research Report 102, Institute of Informatics, University of Oslo, March 1986.

  7. Neelam Soundararajan and Ole-Johan Dahl,Partial correctness semantics of CSP. Research Report 66, Institute of Informatics, University of Oslo, February 1982.

  8. Stephen A. Cook,Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing, 7(1): 70–90, February 1978.

    Article  Google Scholar 

  9. David C. Luckham and Wolfgang Polak,Ada exception handling — An axiomatic approach. ACM Transactions on Programming Languages and Systems, 2, 1980.

  10. Ole-Johan Dahl,Can program proving be made practical? In M. Amirchahy and D. Neel, editors,Les Fondements de la Programmation, pages 56–115, CCE-CREST, IRIA, December 1977. Also in: Research report no. 33, Institute of Informatics, University of Oslo.

  11. Krzysztof R. Apt,Ten years of Hoare's logic: A survey — Part 1. ACM Transactions on Programming Languages and Systems, 3(4): 431–483, 1981.

    Article  Google Scholar 

  12. Sigurd Meldal,Axiomatic semantics for access type tasks in Ada. Research Report 100, Institute of Informatics, University of Oslo, April 1986. Invited paper at the meeting of Ada Europe — Working Group on Formal Methods, February 6th 1986.

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Oslo, P.O. Box 1080, Blindern, 0316, Oslo 3, Norway

    Sigurd Meldal

Authors
  1. Sigurd Meldal
    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

Meldal, S. Partial correctness of exits from concurrent structures. BIT 26, 295–302 (1986). https://doi.org/10.1007/BF01933709

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

CR categories

Search

Navigation