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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
