Kernel Equivalence of Programs and Proving Kernel Equivalence and Correctness by Test Cases
Abstract
The in a program may be classified as statements if they participate directly in the computation of some output and as 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 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.
Cite
Text
Pratt. "Kernel Equivalence of Programs and Proving Kernel Equivalence and Correctness by Test Cases." International Joint Conference on Artificial Intelligence, 1971.Markdown
[Pratt. "Kernel Equivalence of Programs and Proving Kernel Equivalence and Correctness by Test Cases." International Joint Conference on Artificial Intelligence, 1971.](https://mlanthology.org/ijcai/1971/pratt1971ijcai-kernel/)BibTeX
@inproceedings{pratt1971ijcai-kernel,
title = {{Kernel Equivalence of Programs and Proving Kernel Equivalence and Correctness by Test Cases}},
author = {Pratt, Terrence W.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1971},
pages = {474-480},
url = {https://mlanthology.org/ijcai/1971/pratt1971ijcai-kernel/}
}