Hostname: page-component-745bb68f8f-v2bm5 Total loading time: 0 Render date: 2025-01-15T00:23:05.464Z Has data issue: false hasContentIssue false
  • English
  • Français

Automatic verification of functions with accumulating parameters

Published online by Cambridge University Press:  01 March 1999

ANDREW IRELAND  and
ALAN BUNDY
ANDREW IRELAND
Affiliation:
Department of Computing & Electrical Engineering, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS, Scotland (e-mail: A.Ireland@hw.ac.uk)
ALAN BUNDY
Affiliation:
Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, Scotland (e-mail: bundy@ed.ac.uk)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Proof by mathematical induction plays a crucial role in reasoning about functional programs. A generalization step often holds the key to discovering an inductive proof. We present a generalization technique which is particularly applicable when reasoning about functional programs involving accumulating parameters. We provide empirical evidence for the success of our technique and show how it is contributing to the ongoing development of a parallelizing compiler for Standard ML.

Type
Research Article
Information
Journal of Functional Programming , Volume 9 , Issue 2 , March 1999 , pp. 225 - 245
Copyright
© 1999 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.