Systematic Detection of Exception Occurrences

In proving the correctness of a program, a common strategem is to consider only initial states in which certain properties are satisfied. For example, in the knowledge that a given array contains at least one positive element, one might prove a program for finding, say, the first positive element in that array, even though the program may otherwise (i.e. if the array does not contain any positive elements) lead to unpredictable results.

[1]  J. W. de Bakker,et al.  Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.

[2]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[3]  P. M. Melliar-Smith,et al.  A program structure for error detection and recovery , 1974, Symposium on Operating Systems.

[4]  David C. Luckham,et al.  Ada exception handling: an axiomatic approach , 1980, TOPL.

[5]  David Gries,et al.  Is Sometimes Ever Better Than Always? , 1978, TOPL.

[6]  William A. Wulf Abstract Data Types: A Retrospective and Prospective View , 1980, MFCS.

[7]  Flaviu Cristian,et al.  Exception Handling and Software Fault Tolerance , 1982, IEEE Transactions on Computers.

[8]  Mitchell Wand,et al.  A Characterization of Weakest Preconditions , 1977, J. Comput. Syst. Sci..

[9]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.