Pascal user manual and report; 3rd ed.
Pascal user manual and report; 3rd ed.
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Copying cyclic list structures in linear time using bounded workspace
Communications of the ACM
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Automating proofs of the absence of common runtime errors
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Reasoning about recursively defined data structures
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
An interpretation oriented theorem prover over integers
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Verification of fairness in an implementation of monitors
ICSE '76 Proceedings of the 2nd international conference on Software engineering
A methodology for verifying programs
Proceedings of the international conference on Reliable software
Verifying programs by algebraic and logical reduction
Proceedings of the international conference on Reliable software
Automatic program verification IV: proof of termination within a weak logic of programs.
Automatic program verification IV: proof of termination within a weak logic of programs.
Fast decision algorithms based on congruence closure
Fast decision algorithms based on congruence closure
Simplification by cooperating decision procedures
Simplification by cooperating decision procedures
Automatic verification of programs with complex data structure.
Automatic verification of programs with complex data structure.
| Hi-index | 0.00 |
The Stanford Pascal verifier is an interactive program verification system. It automates much of the work necessary to analyze a program for consistency with its documentation, and to give a rigorous mathematical proof of such consistency or to pin-point areas of inconsistency. It has been shown to have applications as an aid to programming, and to have potential for development as a new and useful tool in the production of reliable software. This verifier is a prototype system. It has inadequacies and shortcomings. It is undergoing continuous improvement, and is expected to be used eventually in conjunction with other kinds of program analyzers. In this talk we shall describe the verifier and some of the results that have been obtained using it. We shall discuss some of the problems that still stand in the way of developing verifiers to a stage where they are part of the programmer's normal working environment.