1977 · 19 citations · 8 references
ComputingComputer ScienceAlgorithmsProgramming LanguagesSoftware EngineeringAbstract Syntax TreesCompiler ConstructionControl-flow AnalysisData-flow AnalysisProgramming Language ImplementationSyntax AnalysisAbstract Syntax Tree AnalysisAbstract Syntax Tree GenerationAbstract Syntax Tree OptimizationAbstract Syntax Tree RewritingProgram RefinementProgram SynthesisRefinementRefinement Rules
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.
8
Ben Wegbreit · Communications of the ACM · 1975 · 290 citations · Full text
Some transformations for developing recursive programs
R. M. Burstall, John Darlington · ACM SIGPLAN Notices · 1975 · 78 citations