A case for teaching program verification: Its importance in the CS curriculum

Authors:
Ali Mili
Affiliations:
Université Laval and McGill University, Canada
Venue:
SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
Year:
1983

Citing 9
Cited 0

Introduction to mathematical logic (3rd ed.)

Introduction to mathematical logic (3rd ed.)
Is Sometimes Ever Better Than Always?

ACM Transactions on Programming Languages and Systems (TOPLAS)
Is “sometime” sometimes better than “always”?: intermittent assertions in proving program correctness

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
The Science of Programming

The Science of Programming
Mathematical Theory of Program Correctness

Mathematical Theory of Program Correctness
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Elements of discrete mathematics (McGraw-Hill computer science series)

Elements of discrete mathematics (McGraw-Hill computer science series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Because of its relevance to program analysis and, ultimately, to program synthesis, the area of formal verification of program correctness is an important part of the education of the programmer and the computer scientist. A case is presented in this paper to advocate the teaching of the formal verification of computer programs. This case is based on three major arguments: - The Why, i.e. the need for including a course on program verification in the computer science curriculum, - The What, i.e. the technical contents of such a course as highlighted by the current state of the art, - The How, i.e. the logistic feasibility of such a course within a fifteen-week semester.