Issue No.05 - September (1978 vol.4)
J. Misra , Department of Computer Science, University of Texas
A method for formal description of programming prinicples is presented in this paper. Programming principles, such as sequential search can be defined and proven even in the absence of an application. We represent a principle as a program scheme which has partially interpreted functions in it. The functions must obey certain input constraints. Use of these ideas in program proving is illustrated with examples.
proving program schemas, Program design, program verification
J. Misra, "An Approach to Formal Definitions and Proofs of Programming Principles", IEEE Transactions on Software Engineering, vol.4, no. 5, pp. 410-413, September 1978, doi:10.1109/TSE.1978.233860