The selection of efficient implementations for a high-level language

✍ Scribed by Kant, Elaine

• Book ID: 121760808
• Publisher: Association for Computing Machinery
• Year: 1977
• Weight: 729 KB
• Volume: 64
• Category: Article
• ISSN: 0163-5719
• DOI: 10.1145/872736.806943

✦ Synopsis

This paper considers the problem of identifying an efficient set of implementations for the abstract constructs in a very high level program description. LIBRA is a system that prunes and expands a tree of partially implemented program descriptions, given a set of refinement rules for generating the tree. Several sets of rules group, order, and select refinements. The analysis of the cost of a program (or program part) at any level of refinement is maintained for cost comparisons between different refinements, for bottleneck identification, and for branch and bound search.