Skip to main content
SpringerLink
Log in

Completeness problems in verification of programs and program schemes

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1979 (MFCS 1979)

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

Abstract

Thm 1 states a negative result about the classical semantics

of program schemes. Thm 2 investigates the reason for this. We conclude that Thm 2 justifies the Henkin-type semantics ⊨ for which the opposite of the present Thm 1 was proved in Andréka-Németi[1],

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. and Németi, I., Completeness of Floyd Logic. Bulletin of Section of Logic 7(1978), 115–121, Wrocław.

    Google Scholar 

  2. Andréka, H. and Németi, I., A characterization of Floyd provable programs. Submitted to Proc.Coll.Logic in Programming, Salgótarján 1978. Coll.Math.Soc.J.Bolyai, North Holland.

    Google Scholar 

  3. Andréka, H. and Németi, I., Classical many-sorted model theory to turn negative results on program schemes to positive. Preprint 1978.

    Google Scholar 

  4. Andréka, H., Németi, I., and Sain, I., Abstract model theory, semantics, logics. Preprint 1979.

    Google Scholar 

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

    Google Scholar 

  6. Davis, M., Hilbert's tenth problem is unsolvable. Amer.Math.Monthly 80(1973), 233–269.

    Google Scholar 

  7. Devlin, K.J., Aspects of Constructibility. Lecture Notes in Math. 354, Springer Verlag, 1973.

    Google Scholar 

  8. Gergely, T. and Ury, L., Mathematical Programming Theories.

    Google Scholar 

  9. Manna, Z., Mathematical Theory of Computation. McGraw Hill, 1974.

    Google Scholar 

  10. Monk, J.D., Mathematical Logic. Springer Verlag, 1976.

    Google Scholar 

  11. Németi, I. and Sain, I., Connections between Algebraic Logic and Initial Algebra Semantics of CF Languages. Submitted to Proc.Coll. Logic in Programming, cf. [2].

    Google Scholar 

  12. Sacks, G.E., Saturated Model Theory. W.A.Benjamin, Inc. Publ., Reading, Massachusetts, 1972.

    Google Scholar 

  13. Sain, I., On the General Theory of Semantics of Languages. Preprint 1979.

    Google Scholar 

  14. Szöts, M. and Gergely, T., On the incompleteness of proving partial correctness. Acta Cybernetica Tom 4, Fasc 1, Szeged 1978, pp.45–57.

    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

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andréka, H., Németi, I., Sain, I. (1979). Completeness problems in verification of programs and program schemes. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation