论文信息 - Algorithmic Methods in Automatic Programming - 字舞流文

Algorithmic Methods in Automatic Programming

Alan W. Biermann | A. Biermann

[1] Douglas R. Smith,et al. Top-Down Synthesis of Divide-and-Conquer Algorithms , 1985, Artif. Intell..

[2] Alan W. Biermann,et al. Automatic Programming: A Tutorial on Formal Methodologies , 1985, J. Symb. Comput..

[3] Alan W. Biermann,et al. Automatic Program Construction Techniques , 1984 .

[4] Alan W. Biermann,et al. Computer Program Synthesis Methodologies , 1983 .

[5] Manfred Broy,et al. Program Construction by Transformations: A Family Tree of Sorting Programs , 1983 .

[6] Douglas R. Smith,et al. Top-Down Synthesis of Simple Divide and Conquer Algorithms. , 1982 .

[7] Zohar Manna,et al. A Deductive Approach to Program Synthesis , 1979, TOPL.

[8] Zohar Manna,et al. Synthesis: Dreams - Programs , 1979, IEEE Trans. Software Eng..

[9] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[10] Susan L. Gerhart,et al. Proof Theory of Partial Correctness Verification Systems , 1976, SIAM J. Comput..

[11] Alan W. Biermann,et al. Approaches to Automatic Programming , 1976, Adv. Comput..