Program synthesis based on Boyer-Moore theorem proving techniques

Authors:
Sun Yong-qiang;Lu Ru-zhan;Bi Hua
Affiliations:
Depart. of Computer Science and Engineering, Shanghai Jiao Tong University, People's Republic of China;Depart. of Computer Science and Engineering, Shanghai Jiao Tong University, People's Republic of China;Depart. of Computer Science and Engineering, Shanghai Jiao Tong University, People's Republic of China
Venue:
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Year:
1985

Citing 3
Cited 1

A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
An improved program-synthesizing algorithm and its correctness

Communications of the ACM
Toward automatic program synthesis

Communications of the ACM

Self-Aware software – will it become a reality?

Self-star Properties in Complex Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program synthesis based on theorem proving usually relies on resolution theorem proving techniques. We develop a deductive approach to program synthesis based on non-resolution theorem proving techniques -- Boyer-Moore techniques. It combines knowledge base, theorem proving, and program synthesis in a systematic way of knowledge development, and can be used in program construction, program verification, and program optimization.