On convergence toward a database of program transformations

Authors:
David Barstow
Affiliations:
Schlumberger-Doll Research, Ridgefield, CT
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1985

Citing 2
Cited 4

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Knowledgebased Pgm Constr

Knowledgebased Pgm Constr

An early report on encompass

ICSE '88 Proceedings of the 10th international conference on Software engineering
Automated assistance for program restructuring

ACM Transactions on Software Engineering and Methodology (TOSEM)
Automatic model synthesis: using automatic programming and expert systems techniques toward simulation modeling

WSC '87 Proceedings of the 19th conference on Winter simulation
Knowledge creation and retrieval in program design: a comparison of novice and intermediate student programmers

Human-Computer Interaction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several fairly large sets of programming rules have been developed recently. It is natural to ask whether the process of developing such rule bases may converge. Having developed sets of rules for specific programming tasks and domains, will they be helpful when other tasks and domains are considered? While it is too early to give definitive answers, experience with the rules of the PECOS system has been positive. Both during the process of developing the rule set and while developing rules for another domain, the existence of already codified rules proved very helpful.