Program verification within and without logic

Bulletin of the Section of Logic 8 (3):124-128 (1979)
  Copy   BIBTEX

Abstract

Theorem 1 states a negative result about the classical semantics j= ! of program schemes. Theorem 2 investigates the reason for this. We conclude that Theorem 2 justies the Henkin-type semantics j= for which the opposite of the present Theorem 1 was proved in [1]{[3] and also in a dierent form in part III of [5]. The strongest positive result on j= is Corollary 6 in [3].

Links

PhilArchive



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

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.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
Nonstandard Runs And Program Verification.Laszlo Csirmaz - 1981 - Bulletin of the Section of Logic 10 (2):68-77.
Metamathematics, machines, and Gödel's proof.N. Shankar - 1994 - New York: Cambridge University Press.
On Preservation Theorems for Two-Variable Logic.Erich Gradel & Eric Rosen - 1999 - Mathematical Logic Quarterly 45 (3):315-325.
On the search for a finitizable algebraization of first order logic.I. Sain - 2000 - Logic Journal of the IGPL 8 (4):497-591.

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