skip to content
Automatic Program Verification III: A Methodology for Verifying Programs. Preview this item
ClosePreview this item
Checking...

Automatic Program Verification III: A Methodology for Verifying Programs.

Author: Friedrich W V Henke; David C Luckham; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
Publisher: Ft. Belvoir Defense Technical Information Center DEC 1974.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
The paper investigates methods for applying an on-line interactive verification system designed to prove properties of PASCAL programs. The methodology is intended to provide techniques for developing a debugged and verified version starting from a program, that (a) is possibly unfinished in some respects, (b) may not satisfy the given specifications, e.g., may contain bugs, (c) may have incomplete documentation,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Friedrich W V Henke; David C Luckham; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
OCLC Number: 227380237
Notes: Report on Stanford Artificial Intelligence Project. See also report dated Dec 74, AD/A-005 412.
Description: 46 p.

Abstract:

The paper investigates methods for applying an on-line interactive verification system designed to prove properties of PASCAL programs. The methodology is intended to provide techniques for developing a debugged and verified version starting from a program, that (a) is possibly unfinished in some respects, (b) may not satisfy the given specifications, e.g., may contain bugs, (c) may have incomplete documentation, (d) may be written in non-standard ways, e.g., may depend on user- defined data structures. The methodology involves (1) interactive application of a verification condition generator, an algebraic simplifier and a theorem-prover; (2) techniques for describing data structures, type constraints, and properties of programs and subprograms (i.e. lower level procedures); (3) the use of (abstract) data types in structuring programs and proofs.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227380237>
library:oclcnum"227380237"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227380237>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"DEC 1974"
schema:datePublished"1974"
schema:description"The paper investigates methods for applying an on-line interactive verification system designed to prove properties of PASCAL programs. The methodology is intended to provide techniques for developing a debugged and verified version starting from a program, that (a) is possibly unfinished in some respects, (b) may not satisfy the given specifications, e.g., may contain bugs, (c) may have incomplete documentation, (d) may be written in non-standard ways, e.g., may depend on user- defined data structures. The methodology involves (1) interactive application of a verification condition generator, an algebraic simplifier and a theorem-prover; (2) techniques for describing data structures, type constraints, and properties of programs and subprograms (i.e. lower level procedures); (3) the use of (abstract) data types in structuring programs and proofs."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/13353701>
schema:inLanguage"en"
schema:name"Automatic Program Verification III: A Methodology for Verifying Programs."@en
schema:numberOfPages"46"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.