Skip to main content
SpringerLink
Log in

Reduction in TLA

  • Conference paper
  • First Online:
CONCUR'98 Concurrency Theory (CONCUR 1998)

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

Included in the following conference series:

Abstract

Reduction theorems allow one to deduce properties of a concurrent system specification from properties of a simpler, coarser-grained version called the reduced specification. We present reduction theorems based upon a more precise relation between the original and reduced specifications than earlier ones, permitting the use of reduction to reason about a larger class of properties. In particular, we present reduction theorems that handle general liveness properties.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Martín Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253–284, May 1991.

    Article  MATH  MathSciNet  Google Scholar 

  2. Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21(4):181–185, October 1985.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. J. R. Back. Refining atomicity in parallel algorithms. Reports on Computer Science and Mathematics Ser. A, No 57, Swedish University of åbo, February 1988.

    Google Scholar 

  4. Ernie Cohen. Compositional Proofs of Asynchronous Programs. PhD thesis, University of Texas at Austin, May 1993.

    Google Scholar 

  5. Ernie Cohen. A guide to reduction. Technical Report TM-ARH-023816, Bellcore, 1993. Available from the author at ernie@bellcore.com.

    Google Scholar 

  6. Thomas W. Doeppner, Jr. Parallel program correctness through refinement. In Fourth Annual ACM Symposium on Principles of Programming Languages, pages 155–169. ACM, January 1977.

    Google Scholar 

  7. David Gries and Ivan Stojmenović. A note on Graham's convex hull algorithm. Information Processing Letters, 25(5):323–327, July 1987.

    Article  MathSciNet  Google Scholar 

  8. Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994.

    Article  Google Scholar 

  9. Leslie Lamport and Fred B. Schneider. Pretending atomicity. Research Report 44, Digital Equipment Corporation, Systems Research Center, May 1989.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(4):319–340, 1976.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bellcore, USA

    Ernie Cohen

  2. Digital Equipment Corporation, USA

    Leslie Lamport

Authors
  1. Ernie Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leslie Lamport
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Davide Sangiorgi Robert de Simone

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, E., Lamport, L. (1998). Reduction in TLA. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055631

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64896-3

  • Online ISBN: 978-3-540-68455-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation