Proceedings

Kernel Equivalence of Programs and Proving Kernel Equivalence and Correctness by Test Cases

Download BibTeX Cite

Proceedings of the Second International Joint Conference on Artificial Intelligence. Pages 474-479.

© 1971 International Joint Conferences on Artificial Intelligence

Abstract

The statements in a program may be classified as "kernel statements" if they participate directly in the computation of some output and as "control statements" if they participate directly in deciding the control path at branch points. Two programs are kernel equivalent if they always execute identical sequences of kernel statements given the same inputs. Kernel equivalence is defined formally and is shown to be practically decidable in many cases by a procedure of trying test cases. The concept of program kernel may also be used as a basis for proving correctness of programs.

  1. Lu ckham , D. C., Park, M. R. and Paterson, H. S. "On formalized computer programs," Jour. Comp. and System Scien ces, 4,3, June 1970.
  2. Kaplan, D. H. "Regular expressions and the equivalence of programs," Jour. Comp. and System Sciences, 3,4, Nov. 1969.
  3. Orgass, R. J, "Some results concerning proofs of statements about programs," Jour. Comp. and System Sciences 4,1, Feb. 1970.
  4. London, R. L., "Computer programs can be proved correct," in Banerji and Hesaro,•ic (eds) Theoretical Appr oaches to Non-nuneri- cal Prob. Solving, Springer-Verlag, 1970.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards