Year: 1988
Type: article
Abstract: The notion of program verification appears to trade upon an equivocation. Algorithms, as logical structures, are appropriate subjects for deductive verification. Programs, as causal models of those structures, are not. The success of program verification as a generally applicable and completely reliable method for guaranteeing program performance is not even a theoretical possibility.
Source: Communications of the ACM
DOI: 10.1145/48529.48530
Author: James H. Fetzer
Institution: University of Minnesota, Duluth
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1705210632