Advertisement

Formal Aspects of Computing

, Volume 6, Issue 5, pp 495–511 | Cite as

Safety, liveness and fairness in temporal logic

  • A. Prasad Sistla
Article

Abstract

In this paper we present syntactic characterization of temporal formulas that express various properties of interest in the verification of concurrent programs. Such a characterization helps us in choosing the right techniques for proving correctness with respect to these properties. The properties that we consider include safety properties, liveness properties and fairness properties. We also present algorithms for checking if a given temporal formula expresses any of these properties.

Keywords

Concurrent programs Verification Temporal logic Safety properties Liveness properties Fairness properties Algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ADS86]
    Alpern, B., Deemers, A.J. and Schneider, F.B.: Safety without Stuttering, Information Processing Letters 23(4):177–180.Google Scholar
  2. [AlS85]
    Alpern, B. and Schneider, F.: Defining Liveness, Information Processing Letters, 21:181–185.Google Scholar
  3. [AlS86]
    Alpern, B. and Schneider, F.B.: Recognizing Safety and Liveness, TR 86-727, Computer Science Department, Cornell University, Jan 1986.Google Scholar
  4. [CES86]
    Clarke, E.M., Emerson, E.A. and Sistla, A.P.: Automatic Verification of finite-state Concurrent Systems using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems 8(2):244–263.Google Scholar
  5. [Eme83]
    Emerson, E.A.: Alternative Semantics for Temporal Logic, Theoretical Computer Science, Vol 26, pp 121–130, 1983.Google Scholar
  6. [EmL87]
    Emerson, E.A. and Lei, C.L.: Modalities for Modelchecking: Branching Time Strikes Back, Science of Computer Programming, Vol 8, pp 275–306, 1987.Google Scholar
  7. [Fra86]
    Francez, N.: Fairness, Texts and Monographs in Computer Science, Springer-Verlag 1986.Google Scholar
  8. [Lam77]
    Lamport, L.: 1977 Proving Correctness of Multiprocess Programs, IEEE Transactions on Software Engineering, SE-3, 2:125–143.Google Scholar
  9. [Lam85]
    Lamport, L.: Logical Foundation, Distributed Systems-Methods and Tools for Specification, Vol 190, Lecture Notes in Computer Science, Springer-Verlag, Berlin,Google Scholar
  10. [LPZ85]
    Lichtenstein, O., Pnueli, A. and Zuck, L.: The Glory of the Past, Lecture Notes in Computer Science, 193, Proceedings of the workshop on Logics of Programs, Brookline College, June 1985.Google Scholar
  11. [MaP89]
    Manna, Z. and Pnueli, A.: Completing the Temporal Picture, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, 1989, Also appeared in Theoretical Computer Science, 1991, 83(1):97–130.Google Scholar
  12. [MaP90]
    Manna, Z. and Pnueli, A.: A hierarchy of Temporal Properties, Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, 1990, pp 377–408.Google Scholar
  13. [MaP92]
    Manna, Z. and Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems—Specification, Springer-Verlag, 1992.Google Scholar
  14. [OwL82]
    Owicki, S. Lamport, L.: Proving Liveness Properties of Concurrent Programs, ACM Transactions on Programming Languages and Systems 4,No.3, 1982.Google Scholar
  15. [Pnu77]
    Pnueli, A.: The Temporal Logic of Programs, Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, Providence, RI(1977).Google Scholar
  16. [SCFM]
    Sistla, A.P., Clarke, E.M., Francez, N. and Meyer, A.R.: Can Message Buffers be Axiomatized in Temporal Logic?, Information and Computation, 63(1,2):88–112.Google Scholar
  17. [SiC85]
    Sistla, A.P. and Clarke, E.M.: Complexity of Prepositional Temporal Logics, Journal of the Association for Computing Machinery, Vol.32,No.3, July 1985.Google Scholar
  18. [Sis83]
    Sistla, A.P.: Theoretical Issues in the Design and Verification of Distributed Systems, Ph.D. thesis 1983, Harvard University.Google Scholar
  19. [Sis85]
    Sistla, A.P.: On Characterization of Safety and Liveness Properties in Temporal Logic, Proceedings of the 4th ACM Symposium on Principles of Distributed Computing, August, 1985, Minaki, Canada.Google Scholar
  20. [Sis86]
    Sistla, A.P.: Characterization of Safety and Liveness Properties in Temporal Logic, GTE Laboratories Technical Report, 1986.Google Scholar
  21. [Tho86]
    Thomas, W.: Safety and Liveness Properties in Propositional Temporal Logic: Characterization and Decidability, Schriften Zur Informatik, Bericht Nr. 116. April 1986.Google Scholar

Copyright information

© BCS 1994

Authors and Affiliations

  • A. Prasad Sistla
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of Illinois at ChicagoChicagoUSA

Personalised recommendations