Skip to main content

Towards a nonstandard analysis of programs

  • Conference paper
  • First Online:
Nonstandard Analysis-Recent Developments

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 983))

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  • H. ANDRÉKA, I. NÉMETI, and I. SAIN (1980), Nonstandard runs of Floyd-provable programs, Proceedings of the Symposium on Algorithmic Logic, A. Salwicki (editor), Lecture Notes in Computer Science, Springer-Verlag, to appear.

    Google Scholar 

  • L. CZIRMAZ (1981), Completeness of Floyd-Hoare program verification, Theoretical Computer Science, 2, pp. 199–211.

    Article  Google Scholar 

  • C. A. R. HOARE (1969), An axiomatic basis for computer programming, Communications of the Association for Computing Machinery, 12, pp. 576–580, 583.

    Article  MATH  Google Scholar 

  • C. A. R. HOARE (1971), Procedures and parameters: An axiomatic approach, Symposium on Semantics of Programming Languages, E. Engeler (editor), Lecture Notes in Mathematics, 188, Springer-Verlag, New York, pp. 102–116.

    Google Scholar 

  • F. KRÖGER (1976), Logical rules of natural reasoning about programs, Automata, Languages, and Programming, S. Michaelson and R. Milner (editors), Edinburgh University Press, Edinburgh, pp. 87–98.

    Google Scholar 

  • F. KRÖGER (1977), LAR: A logic for algorithmic reasoning, Acta Informatica, 8, pp. 242–266.

    Article  MathSciNet  MATH  Google Scholar 

  • E. NELSON (1977), Internal set theory, Bulletin of the American Mathematical Society, 83, pp. 1165–1198.

    Article  MathSciNet  MATH  Google Scholar 

  • M. M. RICHTER (1981), Monaden, ideale Punkte und Nichtstandard-Methoden, Vieweg-Verlag, 1981.

    Google Scholar 

  • D. SCOTT and C. STRACHEY (1971), Towards a mathematical semantics for computer languages, Technical Monographs PRG-6, Oxford University Computing Laboratory, Programming Research Group.

    Google Scholar 

  • D. SCOTT (1974), Data types as lattices, Proceedings of the International Summer Institute and Logic Colloquium, Kiel 1974, G. H. Müller, A. Oberschelp, and K. Pothoff (editors), Lecture Notes in Mathematics, 499, pp. 579–651.

    Article  MathSciNet  Google Scholar 

  • M. E. SZABO (1980), A sequent calculus for Kröger logic, Proceedings of the Symposium on Algorithmic Logic, A. Salwicki (editor), Lecture Notes in Computer Science, Springer-Verlag, to appear.

    Google Scholar 

  • M. E. SZABO (1981), Variable truth, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Albert Emerson Hurd

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Richter, M.M., Szabo, M.E. (1983). Towards a nonstandard analysis of programs. In: Hurd, A.E. (eds) Nonstandard Analysis-Recent Developments. Lecture Notes in Mathematics, vol 983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0065340

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12279-1

  • Online ISBN: 978-3-540-39602-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics