Hostname: page-component-6bf8c574d5-k2jvg Total loading time: 0 Render date: 2025-03-04T04:07:21.753Z Has data issue: false hasContentIssue false
  • English
  • Français

Set constraints for destructive array update optimization

Published online by Cambridge University Press:  31 May 2001

MITCHELL WAND  and
WILLIAM D. CLINGER
MITCHELL WAND
Affiliation:
College of Computer Science, Northeastern University, 161 Cullinane Hall, Boston MA 02115 USA (e-mail: {wand,will}@ccs.neu.edu)
WILLIAM D. CLINGER
Affiliation:
College of Computer Science, Northeastern University, 161 Cullinane Hall, Boston MA 02115 USA (e-mail: {wand,will}@ccs.neu.edu)
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.

Destructive array update optimization is critical for writing scientific codes in functional languages. We present set constraints for an interprocedural update optimization that runs in polynomial time. This is a multi-pass optimization, involving interprocedural flow analyses for aliasing and liveness. We characterize and prove the soundness of these analyses using small-step operational semantics. We also prove that any sound liveness analysis induces a correct program transformation.

Type
Research Article
Information
Journal of Functional Programming , Volume 11 , Issue 3 , May 2001 , pp. 319 - 346
Copyright
© 2001 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.