Formal program verification and computability theory

Authors:
Paresh B. Shah;James C. Pleasant
Affiliations:
East Tennessee State University, Johnson City, Tennessee;East Tennessee State University, Johnson City, Tennessee
Venue:
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Year:
1992

Citing 4
Cited 0

Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science

Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
An axiomatic basis for computer programming

Communications of the ACM
Elementary Computability, Formal Languages and Automata

Elementary Computability, Formal Languages and Automata
Theory of Computation

Theory of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Whereas early researchers in computability theory described effective computability in terms of such models as Turing machines, Markov algorithms, and register machines, a recent trend has been to use simple programming languages as computability models. A parallel development to this programming approach to computability theory is the current interest in systematic and scientific development and proof of programs. This paper investigates the feasibility of using formal proofs of programs in computability theory. After describing a framework for formal verification of programs written in a simple theoretical programming language, we discuss the proofs of several typical programs used in computability theory.