Skip to main content
Log in

A structured temporal logic language: ZYZ/SE

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In order to enhance the readability and to simplify the verification of temporal logic programs in the XYZ system, we propose a structured temporal logic language called XYZ/SE, based on XYZ/BE which is the basis language of the XYZ system. A set of proof rules are given and proved to be sound and adequate for proving the partial correctness of XYZ/SE programs in a compositional way. Moreover, we show that every XYZ/BE program can be transformed into an equivalent XYZ/SE program. So we have developed a general compositional verification method in the XYZ system concerning the sequential case.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Y. L. Feng, H. M. Lin, Z. S. Tang, A Proof system for temporal logic programs.Journal of Comput. Research & Development (in chinese), 7 (1985).

  2. J. Gong, A System of Automatic Transformation from a Temporal Logic to Its Structured Version, Techn. Rept. IS-AS-XYZ-88-13, 1988.

  3. D. Harel, First-Order Dynamic Logic.Lecture Notes in Comput. Sci., 68, Springer-Verlay, New York, 1979.

    MATH  Google Scholar 

  4. F. Kroger, Temporal Logic of Programs. Lecture Notes, Techn. Univ. Munich, Inst. for Informatics, Rept. TUM-18521, 1985.

  5. R. W. Li, A Mechanized Temporal Logic as Proof Checker. Techn. Rept. IS-AS-XYZ-88-14, 1988.

  6. R. C. Linger, H. D. Mills, and B. I. Witt, Structured Programming: Theory and Practice. Addison-Wesley, 1979, 112–126.

  7. Z. Manna, Verification of Sequential Programs: Temporal Axiomatization. InTheoretical Foundation of Programming Methodology (M. Broy and G. Schmidt, Eds.), D. Reidel Pub. Co., Holland. 1982.

    Google Scholar 

  8. Z. Manna, A. Pnueli, How to Cook a Temporal Proof System for Your Pet Programming Language.Proc of the 10th ACM Symp. on Principles of Programming Languages, 1983.

  9. F. C. N. Pereira, and D. H. D. Warren, Definite clause grammars for language analysis,Artificial Intelligence,13, (1980).

  10. A. Szalas, Concerning the Semantics Consequence Relation in First-Order Temporal Logic.Theoret. Comput. Sci.,47 (1986).

  11. C. S. Tang, Toward a Unified Logic Basis for Programming Languages. Techn. Rept. Stan-CS-81-865, Stanford Univ. 1981; a revised version:Proc. IFIP '83, Paris, 1983.

  12. C. S. Tang, To Unify Programming With a Temporal Logic Language System — A step Toward a Logic Machine. CMU-CS-87-160, Carnegie-Mellon Univ. 1987.

  13. H. L. Xie, A First-Order Temporal Logic Theory FTL. Techn. Rept. IS-AS-XYZ-88-5, 1988.

  14. H. L. Xie, A Structured Temporal Logic Language: XYZ/SE and Its Verification. Techn. Rept. IS-AS-XYZ-88-6, 1988.

  15. S. Z. Zhou, C. S. Tang, Designing and Verifying Distributed Programs Using Temporal Logic. Techn. Rept. IS-AS-XYZ-87-6, 1987.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xie, H., Gong, J. & Tang, C.S. A structured temporal logic language: ZYZ/SE. J. of Compt. Sci. & Technol. 6, 1–10 (1991). https://doi.org/10.1007/BF02943402

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation