Communications of the ACM
Automatic data structure choice in a language of very high level
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ICSE '76 Proceedings of the 2nd international conference on Software engineering
On the Transformational Implementation approach to programming
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Some transformations for developing recursive programs
Proceedings of the international conference on Reliable software
A knowledge-based system for automatic program construction
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Automatic design and implementation of language data types
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Intelligent support for the engineering of software (panel paper)
ICSE '85 Proceedings of the 8th international conference on Software engineering
Program Transformation Systems
ACM Computing Surveys (CSUR)
Generalized procedure calling and content-directed invocation
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
The PSI Program Model Builder - synthesis of very high-level programs
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
An advisory system for developing data representations
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
A summary of the PSI program synthesis system
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
A knowledge-based system for automatic program construction
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
On program synthesis knowledge
Artificial Intelligence
Towards an integrated development environment
IBM Systems Journal
| Hi-index | 0.01 |
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.