Logic and computation: interactive proof with Cambridge LCF
Logic and computation: interactive proof with Cambridge LCF
Program derivation: the development of programs from specifications
Program derivation: the development of programs from specifications
The logical basis for computer programming: vol. 2, deductive systems
The logical basis for computer programming: vol. 2, deductive systems
Programming in the 1990s: an introduction to the calculation of programs
Programming in the 1990s: an introduction to the calculation of programs
Zero defect software
Automated reasoning (2nd ed.): introduction and applications
Automated reasoning (2nd ed.): introduction and applications
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Axiomatising the Logic of Computer Programming
Axiomatising the Logic of Computer Programming
A Discipline of Programming
Program synthesis through Gödel's interpretation
Proceedings of the International Conference on Mathematical Studies of Information Processing
Self-Aware software – will it become a reality?
Self-star Properties in Complex Information Systems
| Hi-index | 0.00 |
Program development can be made amenable to formal methods by using a logical framework. A logic specification, whose operational semantics is based on proof theory, provides an abstract and “implementation independent” definition of the problem, the data domains and the associated operators.Unlike many of the current efforts in this area that use resolution, our approach is based on natural deduction, more specifically, sequent calculus. Following the methodology proposed by Manna and Waldinger, we propose the synthesis tableau technique by which we construct a proof for the well formed formula representing the specification. The desired program is obtained as a side effect of the proof process.