Skip to main content
SpringerLink
Log in

Proving Termination of Parallel Programs

  • Chapter
Beauty Is Our Business

Part of the book series: Texts and Monographs in Computer Science ((MCS))

Abstract

In Owicki and Gries [2] a well known proof method for verifying parallel programs based on the interference freedom test was introduced. We show that their extension of the method to deal with termination is incorrect and suggest two ways of repairing it.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.W. Dijstra. Selected Writings on Computing. Springer-Verlag, New York, 1982

    Google Scholar 

  2. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6: 319–340, 1976.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Mathematics and Computer Science, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands

    Krzysztof R. Apt

  2. Department of Computer Sciences, The University of Texas at Austin, Taylor Hall 2.124, Austin, Texas, 78712-1188, USA

    Krzysztof R. Apt

  3. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Frank S. de Boer

  4. Department of Computer Science, University of Oldenburg, 2900, Oldenburg, Federal Republic of Germany

    Ernst-Rüdiger Olderog

Authors
  1. Krzysztof R. Apt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank S. de Boer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ernst-Rüdiger Olderog
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematics and Computer Science Department, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands

    W. H. J. Feijen

  2. Department of Computer Science, University of Utrecht, 3508 TB, Utrecht, The Netherlands

    A. J. M. van Gasteren

  3. Department of Computer Science, Cornell University, 14853, Ithaca, NY, USA

    D. Gries

  4. Department of Computer Science, The University of Texas, 78712-1188, Austin, TX, USA

    J. Misra

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Apt, K.R., de Boer, F.S., Olderog, ER. (1990). Proving Termination of Parallel Programs. In: Feijen, W.H.J., van Gasteren, A.J.M., Gries, D., Misra, J. (eds) Beauty Is Our Business. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4476-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4476-9_1

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-8792-6

  • Online ISBN: 978-1-4612-4476-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation