Heuristic Methods for Mechanically Deriving Inductive Assertions
Proceedings of the Third International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 524-535.
Abstract
Current methods for mechanical program verification require a complete predicate specification on each loop. Because this is t7dious and error-prone, producing a program w~th complete, correct predicates is reasonably difficult and would be facilitated by machine assistance. This paper discusses heuristic methods for mechanically deriving loop predicates from their boundary conditions and for mechanically completing partially specified loop predicates.
Ben Wegbreit. 1973. Heuristic Methods for Mechanically Deriving Inductive Assertions. In Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73. IJCAI, 524–535. https://ijcai.org/proceedings/1973/66
Wegbreit, B. (1973). Heuristic Methods for Mechanically Deriving Inductive Assertions. In Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 (pp. 524–535). IJCAI. https://ijcai.org/proceedings/1973/66
@inproceedings{ijcai1973p66,
title = {Heuristic Methods for Mechanically Deriving Inductive Assertions},
author = {Wegbreit, Ben},
booktitle = {Proceedings of the Third International Joint Conference on
Artificial Intelligence, {IJCAI-73}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Nils J. Nilsson},
pages = {524--535},
year = {1973},
month = {8},
note = {Automatic Programming},
url = {https://ijcai.org/proceedings/1973/66},
}
TY - CPAPER TI - Heuristic Methods for Mechanically Deriving Inductive Assertions AU - Wegbreit, Ben T2 - Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 PB - International Joint Conferences on Artificial Intelligence PY - 1973 SP - 524 EP - 535 UR - https://ijcai.org/proceedings/1973/66 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
