Automating Synthesis by Completion
Automating Synthesis by Completion
复制标题
通过完成自动合成
DOI:
--
复制
发表时间:
1994
期刊:
影响因子:
--
通讯作者:
F. Bellegarde
中科院分区:
文献类型:
--
作者:
F. Bellegarde
When using a completion procedure simple static analyses allow automatizing the ma nipulation of rst order functional programs This paper shows how to apply these tech niques in order to fully automatize program transformation by the two strategies defor estation eliminating useless intermediate data structures and tupling eliminating parallel traversals of identical data structures These techniques enable us to transform a larger class of programs than the current deforestation algorithms Programs are translated into a constructor based rewrite system Then a completion procedure can be used for synthesis of the transformed rewrite system Static analyses of the rewrite system are needed to au tomatize a given transformation strategy They permit the following to automatically discover the speci cations of the functions that need to be synthesized by completion in order to accommodate the strategy to control the production of critical pairs during the completion process according to the strategy to determine how and when to orient the critical pairs into rewrite rules without losing termination of the rewrite system to guarantee termination of the process not only by ensuring termination of the completion but also by ensuring that the transformation does not require in nitely many completions and nally to guarantee the e ectiveness of the transformation The author is supported in part by a contract with Air Force Material Command F C Id sas tex v bellegar Exp bellegar