Reduction in TLA

  • Ernie Cohen
  • Leslie Lamport
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1466)


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.


Temporal Logic Critical Section Safety Property Digital Equipment Corporation Liveness Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Martín Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253–284, May 1991.zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21(4):181–185, October 1985.zbMATHMathSciNetCrossRefGoogle Scholar
  3. 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. 4.
    Ernie Cohen. Compositional Proofs of Asynchronous Programs. PhD thesis, University of Texas at Austin, May 1993.Google Scholar
  5. 5.
    Ernie Cohen. A guide to reduction. Technical Report TM-ARH-023816, Bellcore, 1993. Available from the author at Scholar
  6. 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. 7.
    David Gries and Ivan Stojmenović. A note on Graham's convex hull algorithm. Information Processing Letters, 25(5):323–327, July 1987.MathSciNetCrossRefGoogle Scholar
  8. 8.
    Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994.CrossRefGoogle Scholar
  9. 9.
    Leslie Lamport and Fred B. Schneider. Pretending atomicity. Research Report 44, Digital Equipment Corporation, Systems Research Center, May 1989.Google Scholar
  10. 10.
    Richard J. Lipton. Reduction: A method of proving properties of parallel programs. Communications of the ACM, 18(12):717–721, December 1975.zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(4):319–340, 1976.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Ernie Cohen
    • 1
  • Leslie Lamport
    • 2
  1. 1.BellcoreUSA
  2. 2.Digital Equipment CorporationUSA

Personalised recommendations