Skip to main content
SpringerLink
Log in

A characterization of Floyd-provable programs

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1981 (MFCS 1981)

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

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. Németi,I., On the completeness problem of systems for program verification. (In Hungarian) Math.Inst.Hung.Acad.Sci. — SZKI Budapest, 1977.

    Google Scholar 

  2. Andréka, H. Németi, I., Completeness of Floyd Logic. Bull.Section of Logic (Wroclaw) Vol.7, No.3, 1978, pp.115–120.

    Google Scholar 

  3. Andréka, H. Németi, I. Sain, I., Henkin-type semantics for program schemes to turn negative results to positive. Fundamentals of Computation Theory FCT'79 Berlin. Ed.: L. Budach. Akademie Verlag 1979, pp. 18–24.

    Google Scholar 

  4. Andréka,H. Németi,I. Sain,I., Completeness problems in verification of programs and program schemes. Mathematical Foundations of Computer Science MFCS'79 Olomouc. Lecture Notes in Computer Science 74, Springer Verlag 1979, pp.208–218.

    Google Scholar 

  5. Bell,J.L. Slomson,A.B., Models and Ultraproducts. North Holland, 1969.

    Google Scholar 

  6. Chang,C.C. Keisler,H.J., Model Theory. North Holland, 1973.

    Google Scholar 

  7. Csirmaz, L., On definability in Peano Arithmetic. Bull.Section of Logic (Wroclaw) Vol.8, No.3, 1979, pp.148–153.

    Google Scholar 

  8. Csirmaz,L., A survey of semantics of Floyd-Hoare derivability. Comput. Linguist. Comput. Lang. CL&CL (Budapest) Vol.14, 1981.

    Google Scholar 

  9. Németi,I., A complete first order dynamic logic. Preprint, Math.Inst.Hung.Acad.Sci. 1980, pp.1–120.

    Google Scholar 

  10. Pratt, V.R., Application of modal logic to programming. Studia Logica Vol.39, No.2/3, 1980, pp.257–274.

    Google Scholar 

  11. Sain, I., There are general rules for specifying semantics: Observations on abstract model theory. Comput. Linguist. Comput. Lang. CL&CL (Budapest) Vol.13, 1979, pp.251–282.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, Reáltanoda u. 13-15, H-1053, Budapest, Hungary

    H. Andréka, I. Németi & I. Sain

Authors
  1. H. Andréka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Németi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. I. Sain
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andréka, H., Németi, I., Sain, I. (1981). A characterization of Floyd-provable programs. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_82

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_82

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation