A Lattice-Theoretic Characterization of Safety and Liveness

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 325-333

  Manolios, Panagiotis ^a   Trefler, Richard ^b  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; TOPOLOGY; TREES (MATHEMATICS);

COHERENCE PROTOCOLS; ON-BOARD CONTROLLERS;

COMPUTER SCIENCE;

EID: 1142305217     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872083     Document Type: Conference Paper

References (23)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, 1991.
2. P. A. Abdulla, K. Cerans, B. Jonsson, and Y.-K. Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160(1-2):109-127, 2000.
3. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21(4):181-185, Oct. 1985.
4. B. Alpern and F. B. Schneider. Recognizing safety and liveness. Distributed Computing, 2(3):117-126, 1987.
5. E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs: Workshop, volume 131 of LNCS, pages 52-71. Springer-Verlag, May 1981.
6. E. A. Emerson. Temporal and modal logic. In van Leeuwen [23], pages 995-1072.
7. E. A. Emerson and J. Y. Halpern. "Sometimes" and "not never" revisited: on branching versus linear time temporal logic. JACM, 33(1):151-178, Jan. 1986.
8. H. P. Gumm. Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions. Information Processing Letters, 47(6):291-294, Oct. 1993.
9. D. Harel and A. Pnueli. On the development of reactive systems. In K. R. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO ASI Series, pages 477-498. Springer-Verlag, 1985.
10. E. Kindler. Safety and liveness properties: A survey. EATCS-Bulletin, 53:268-272, June 1994.
11. D. Kozen. Results on the propositional Mu-Calculus. Theoretical Computer Science, pages 334-354, December 1983.
12. O. Kupferman and M. Y. Vardi. Model checking of safety properties. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification-CAV '99, volume 1633 of LNCS, pages 172-183. Springer-Verlag, 1999.
13. L. Lamport. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering SE-3, 2:125-143, Mar. 1977.
14. P. Manolios and R. Trefler. Safety and liveness in branching time. In Sixteenth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 366-374. IEEE Computer Society, 2001.
15. R. Milner. Communication and Concurrency. Prentice-Hall, 1990.
16. S. S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):455-495, 1982.
17. A. Pnueli. The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science, pages 46-57, Providence, Rhode Island, 1977. IEEE.
18. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. of the 5th International Symposium on Programming, volume 137 of LNCS, 1982.
19. M. Rem. A personal perspective of the Alpern-Schneider characterization of safety and liveness. In W. H. J. Feijen, editor, Beauty is Our Business, pages 365-372. Springer-Verlag, 1990.
20. F. B. Schneider. Enforceable security policies. ACM Transactions on Information and System Security (TISSEC), 3(1):30-50, 2000.
21. A. P. Safety. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing, 6:495-511, 1994.
22. W. Thomas. Automata on infinite objects. In van Leeuwen [23], pages 135-192.
23. J. van Leeuwen, editor. Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics. Elsevier, Amsterdam, 1990.