A methodology for verifying programs

Authors:
F. W von Henke;D. C. Luckham
Affiliations:
Artificial Intelligence Laboratory, Computer Science Dept., Stanford University, Stanford, Calif.;Artificial Intelligence Laboratory, Computer Science Dept., Stanford University, Stanford, Calif.
Venue:
Proceedings of the international conference on Reliable software
Year:
1975

Citing 2
Cited 9

Algorithm 245: Treesort

Communications of the ACM
Automatic program verification I: a logical basis and its implementation.

Automatic program verification I: a logical basis and its implementation.

Verification of Array, Record, and Pointer Operations in Pascal

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Metalanguage for interactive proof in LCF

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On proving inductive properties of abstract data types

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic interpretation and tracing of PASCAL-programs

ICSE '78 Proceedings of the 3rd international conference on Software engineering
Verification of fairness in an implementation of monitors

ICSE '76 Proceedings of the 2nd international conference on Software engineering
An interactive program verification system

Proceedings of the international conference on Reliable software
A brief account: Implementation and applications of a Pascal program verifier (Position Statement)

ACM '78 Proceedings of the 1978 annual conference - Volume 2
Software engineering

Classics in software engineering
Software Engineering

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper investigates methods for applying an online interactive verification system designed to prove properties of PASCAL programs. The methodology provides techniques for developing a debugged and verified version starting from an incomplete program.