Fundamentals of deductive program synthesis

An informal tutorial for program synthesis is presented, with an emphasis on deductive methods. According to this approach, to construct a program meeting a given specification, the authors prove the existence of an object meeting the specified conditions. The proof is restricted to be sufficiently...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on software engineering Jg. 18; H. 8; S. 674 - 704
Hauptverfasser: Manna, Z., Waldinger, R.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.08.1992
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Schlagworte:
Algebra
Applied sciences
Artificial intelligence
Automation
Computer languages
Computer programming
Computer science
Computer science; control theory; systems
Contracts
Exact sciences and technology
Logic functions
Logic programming
Mathematical models
Methods
Military computing
Programming
Software
Software development
Software engineering
Sorting
Specifications
Systems development
Theory
Deductibility
Software development
Theorem proving
Program transformation
Program proof
Computer system
Program specification
Software engineering
ISSN:0098-5589, 1939-3520
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An informal tutorial for program synthesis is presented, with an emphasis on deductive methods. According to this approach, to construct a program meeting a given specification, the authors prove the existence of an object meeting the specified conditions. The proof is restricted to be sufficiently constructive, in the sense that, in establishing the existence of the desired output, the proof is forced to indicate a computational method for finding it. That method becomes the basis for a program that can be extracted from the proof. The exposition is based on the deductive-tableau system, a theorem-proving framework particularly suitable for program synthesis. The system includes a nonclausal resolution rule, facilities for reasoning about equality, and a well-founded induction rule.< >
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/32.153379