Reduction in TLA
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.
KeywordsTemporal Logic Critical Section Safety Property Digital Equipment Corporation Liveness Property
Unable to display preview. Download preview PDF.
- 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 firstname.lastname@example.org.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
- 9.Leslie Lamport and Fred B. Schneider. Pretending atomicity. Research Report 44, Digital Equipment Corporation, Systems Research Center, May 1989.Google Scholar