Skip to main content
SpringerLink
Log in

Separation and Reduction

  • Conference paper
Mathematics of Program Construction (MPC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1837))

Included in the following conference series:

Abstract

We present some new theorems that equate an iteration to a sequential composition of stronger iterations, and use these theorems to simplify and generalize a number of known techniques for pretending atomicity in concurrent programs.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Back, R.J.R.: Refining atomicity in parallel algorithms. In: Parallel Architectures and Languards Europe, Springer, Heidelberg (1989)

    Google Scholar 

  2. Back, R.J.R., von Wright, J.: Reasoning algebraically about loops. Acta Informatica 36(4) (1999)

    Google Scholar 

  3. Doeppner, T.: Parallel program correctness through refinement. In: ACM Symposium on Principles of Programming Languages (1977)

    Google Scholar 

  4. Gouda, M.G., Yu, Y.T.: Protocol validation by maximal progress state exploration. Technical Report CS-TR-211, The University of Texas at Austin (1982)

    Google Scholar 

  5. Kozen, D.: A completeness theorem for Kleene algebra and the calculus of regular events. Information and Computation 110(2), 366–390 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lamport, L.: A theorem on atomicity in distributed algorithms. Distributed COmputing 4, 59–68 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lamport, L., Schneider, F.B.: Pretending atomicity. Technical Report Research Report 44, Compaq System Research Center (1989)

    Google Scholar 

  8. Lipton, R.J.: Reduction: A method of proving properties of parallel programs. Communications of the ACM 18(12), 717–721 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  9. Papadimitriou, C.: The Theory of Database Concurrency Control. Computer Science Press, Rockville (1986)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Telcordia Technologies,  

    Ernie Cohen

Authors
  1. Ernie Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Nottingham, NG8 1BB, Nottingham, England

    Roland Backhouse

  2. Dep. Informática, Universidade do Minho, Campus de Gualtar, P.O. Box, 4700-320, Braga, Portugal

    José Nuno Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, E. (2000). Separation and Reduction. In: Backhouse, R., Oliveira, J.N. (eds) Mathematics of Program Construction. MPC 2000. Lecture Notes in Computer Science, vol 1837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722010_4

Download citation

  • DOI: https://doi.org/10.1007/10722010_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67727-7

  • Online ISBN: 978-3-540-45025-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation