Abstract Data Types as Lattices of Finitely Generated Models
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
STP: A Mechanized Logic for Specification and Verification
Proceedings of the 6th Conference on Automated Deduction
Automatic construction of algorithms and data structures using a knowledge base of programming rules.
A Designer/Verifier's Assistant
IEEE Transactions on Software Engineering
A system which synthesizes array-manipulating programs from specifications
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
In this paper we first try to characterize one meaning of automatic programming. We consider it to be one part of the Programming environment related to Artificial Intelligence techniques. We then illustrate an automatic programning process, on a simple example, using an Abstract Data Type theory to which we add the not ion of schemes which are particularly useful in program derivation from Abstract Type decomposition. We conclude that all the concepts treated in this paper must be contained in one way or another in any automatic programming system. However this necessitates further study in such theoretical fields as Abstract Data Type Theory, Specification languages, Theorem provers or proof cheekers and rule rewriting systems.