Philosophical aspects of program verification

Minds and Machines 1 (2):197-216 (1991)
Abstract
A debate over the theoretical capabilities of formal methods in computer science has raged for more than two years now. The function of this paper is to summarize the key elements of this debate and to respond to important criticisms others have advanced by placing these issues within a broader context of philosophical considerations about the nature of hardware and of software and about the kinds of knowledge that we have the capacity to acquire concerning their performance.
Keywords Formal methods  correctness proofs  deductive reasoning  inductive reasoning  computer programming  computers  programs  verification
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,360
External links
  • Through your library Configure
    References found in this work BETA
    James H. Fetzer (1988). Program Verification: The Very Idea. Communications of the ACM 31 (9):1048--1063.
    Allen Newell & Herbert A. Simon (1981). Computer Science as Empirical Inquiry: Symbols and Search. Communications of the Association for Computing Machinery 19:113-26.
    Brian Cantwell Smith (1985). The Limits of Correctness. Acm Sigcas Computers and Society 14 (1):18-26.
    Citations of this work BETA
    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    35 ( #41,686 of 1,089,047 )

    Recent downloads (6 months)

    1 ( #69,722 of 1,089,047 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.