Skip to main content
SpringerLink
Log in

The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods

An application of model theory

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 193))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andréka,H. Balogh,K. Lábadi,K. Németi,I. Tóth,P.: Plans to improve our program verifyer program. (In Hungarian). Working paper, NIM IGÜSZI, Dept. of Software Techniques, Budapest, 1974.

    Google Scholar 

  2. Andréka,H. Németi,I. Sain,I.: A complete first order logic. Preprint Math.Inst.Hung.Acad.Sci. 124 p.

    Google Scholar 

  3. Andréka, H. Németi, I. Sain, I.: A complete logic for reasoning about programs via nonstandard model theory, Parts I–II. Theoretical Computer Science 17 (1982), No.2 193–212, No.3 259–278.

    Google Scholar 

  4. Bowen,K.A.: Model theory for modal logic (Kripke models for modal predicate calculi). Synthese Library Vol 127, Reidel Publ. Co., 1979.

    Google Scholar 

  5. Burstall,R.M.: Program Proving as Hand Simulation with a Little Induction. IFIP Congress, Stockholm, August 3–10, 1974.

    Google Scholar 

  6. Csirmaz, L.: On the completeness of proving partial correctness. Acta Cybernetica, Tom 5, Fasc 2, Szeged, 1981, 181–190.

    Google Scholar 

  7. Csirmaz, L.: Programs and program verification in a general setting. Theoretical Computer Science 16 (1981) 199–210.

    Google Scholar 

  8. Csirmaz,L.: On the Strength of "Sometime" and "Always" in Program Verification. Information and Control, vol 57, Nos 2–3, 1983.

    Google Scholar 

  9. Gergely, T. Szőts, M.: On the incompleteness of proving partial correctness. Acta Cybernetica, Tom 4, Fasc 1, Szeged, 1978, 45–57.

    Google Scholar 

  10. Gergely,T. Ury,L.: Time models for programming logics. In: Mathematical Logic in Computer Science (Proc.conf. Salgótarján 1978) Eds.: B.Dömölki, T.Gergely, Colloq.Math.Soc.J.Bolyai vol 26, North-Holland, 1981, 359–427.

    Google Scholar 

  11. Manna,Z. Pnueli,A.: The Modal Logic of Programs. Preprint CS81-12, June 1981.

    Google Scholar 

  12. Mirkowska,G.: Multimodal logics. Preprint, Institute of Math., Warsaw University.

    Google Scholar 

  13. Németi, I.: Nonstandard Dynamic Logic. In: Logics of Programs, Ed.: D. Kozen (Proc.Conf. New York 1981) Lecture Notes in Computer Science 131, Springer-Verlag, Berlin, 1982, 311–348.

    Google Scholar 

  14. Pnueli,A.: The Temporal Logic of Programs. Preprint Weitzmann Institute of Science, Dept. of Applied Math., May 1981.

    Google Scholar 

  15. Richter, M.M. Szabo, M.E.: Nonstandard Computation Theory. Preprint, Concordia University, Montreal, 1983.

    Google Scholar 

  16. Sain,I.: Successor axioms for time increase the program verifying power of full computational induction. Preprint No 23/1983, Math.Inst.Hung.Acad.Sci., Budapest, 1983.

    Google Scholar 

  17. Sain,I.: Model theoretic characterization of Pnueli's temporal program verification method. Manuscript, 1983.

    Google Scholar 

  18. Sain,I.: How to define the meaning of iteration ? and Sharpening the characterization of Pnueli's program verification method (Structured NDL Parts II–III). Preprint No 48/1984, Math.Inst.Hung.Acad.Sci., Budapest, 1984.

    Google Scholar 

  19. Sain,I.: Total correctness in nonstandard dynamic logic. Preprint No 8/1983, Math.Inst.Hung.Acad.Sci., Budapest, 1983.

    Google Scholar 

  20. Szabo,M.E.: Personal communication, 1981.

    Google Scholar 

  21. Pasztor,A.: Nonstandard Dynamic Logic to Prove Standard Properties of Programs. Carnegie-Mellon Univ., Dept. of Math., Research Report 84-3.

    Google Scholar 

  22. Pasztor,A.: Nonstandard Logics of Programs. Carnegie-Mellon Univ. Dept. of Math., Research Report, Dec. 1984.

    Google Scholar 

  23. Sain,I.: A simple proof for the completeness of Floyd's method. Theoretical Computer Science vol 35, 1985, to appear.

    Google Scholar 

  24. Sain,I.: The implicit information content of Burstall's (modal) program verification method. Preprint No 57/1984, Math.Inst.Hung.Acad.Sci., Budapest, 1984.

    Google Scholar 

  25. Biró,B. Sain,I.: Peano Arithmetic for the Time Scale of Nonstandard Logics of Programs. Preprint, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math. Inst. of the Hungar. Acad. of Sci., PF.127, 1364, Budapest, Hungary

    I. Sain

Authors
  1. I. Sain
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rohit Parikh

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sain, I. (1985). The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods. In: Parikh, R. (eds) Logics of Programs. Logic of Programs 1985. Lecture Notes in Computer Science, vol 193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15648-8_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-15648-8_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15648-2

  • Online ISBN: 978-3-540-39527-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation