DocumentCode
3161235
Title
Analysis and synthesis of abstract data types through generalization from examples
Author
Wild, Christian
Author_Institution
Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA
Volume
2
fYear
1988
fDate
0-0 1988
Firstpage
21
Lastpage
29
Abstract
The discovery of general patterns of behavior from a set of input/output examples can be a useful technique in the automated analysis and synthesis of software systems. These generalized descriptions of the behavior form a set of assertions that can be used for validation, program synthesis, program testing, and run-time monitoring. Describing the behavior is characterized as a learning process in which the set of inputs is mapped into an appropriate transform space such that general patterns can be easily characterized. The learning algorithm must choose a transform function and define a subset of the transform space which is related to equivalence classes of behavior in the original domain. An algorithm for analyzing the behavior of abstract data types is presented and several examples are given. The use of the analysis for purposes of program synthesis is also discussed.<>
Keywords
data structures; software engineering; abstract data types; assertions; automated analysis; behavior; equivalence classes; generalization; input/output examples; learning algorithm; learning process; original domain; program synthesis; program testing; run-time monitoring; software systems; subset; transform function; transform space; validation; Algorithm design and analysis; Automation; Computer science; Costs; Machine learning; Monitoring; Pattern analysis; Runtime; Software systems; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
System Sciences, 1988. Vol.II. Software Track, Proceedings of the Twenty-First Annual Hawaii International Conference on
Conference_Location
Kailua-Kona, HI, USA
Print_ISBN
0-8186-0842-0
Type
conf
DOI
10.1109/HICSS.1988.11784
Filename
11784
Link To Document