Nonstandard Runs And Program Verification

Bulletin of the Section of Logic 10 (2):68-77 (1981)
  Copy   BIBTEX

Abstract

The aim of this note is to present some recent results concerning the nonstandard approach to program correctness. The reader is supposed to be familiar with the basic notation of program and program verication as well as the model theory. The concepts used here are basically from [2] and [4]. The denitions of program, program run, etc. given here are rather sketchy and expected to give only a general idea of these notions; the results, however, remain true under a wide range of other denitions, cf. [1], [3], [5]

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,005

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-02-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references