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]

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Similar books and articles

Program verification: the very idea.James H. Fetzer - 1988 - Communications of the Acm 31 (9):1048--1063.
Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
Program execution in connectionist networks.Martin Roth - 2005 - Mind and Language 20 (4):448-467.
The poverty of the Popperian program for truthlikeness.Graham Oddie - 1986 - Philosophy of Science 53 (2):163-178.
Newell's program, like Hilbert's, is dead; let's move on.Yingrui Yang & Selmer Bringsjord - 2003 - Behavioral and Brain Sciences 26 (5):627-627.
A property of 2‐sorted peano models and program verification.L. Csirmaz & J. B. Paris - 1984 - Mathematical Logic Quarterly 30 (19‐24):325-334.

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