DocumentCode :
1868888
Title :
Deducing type information from context in Ada based PDLS
Author :
Gabber, Erun ; Yehudai, Amiram
Author_Institution :
Moise & Frida Eskenasy Inst. of Comput. Sci., Tel-Aviv Univ., Israel
fYear :
1988
fDate :
6-7 Jun 1988
Firstpage :
71
Lastpage :
78
Abstract :
The paper describes a new algorithm for deducing type information of partially declared objects in Ada based PDLs (program design languages). The type information is deduced from the usage context of the objects. The algorithm tries to implement an `insight´ into the design, by checking every detail in the design using all available information deduced from its usage. In this way, the algorithm provides better type checking of incomplete designs, which allows earlier detection of design errors. This algorithm is intended to be a part of an Ada based PDL processor. A prototype of this algorithm was implemented in Prolog. Some examples demonstrating the usefulness of the algorithm are given with their resource consumption. The implementation described indicates that this algorithm should be a worthwhile addition to any Ada based PDL processor
Keywords :
Ada; data structures; software tools; Ada based PDLS; Prolog; context; design errors; incomplete designs; partially declared objects; resource consumption; type information; usage context; Algorithm design and analysis; Computer science; Object detection; Page description languages; Process design; Prototypes; Trademarks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Systems and Software Engineering, 1988. Proceedings., Third Israel Conference on
Conference_Location :
Tel-Aviv
Print_ISBN :
0-8186-0884-6
Type :
conf
DOI :
10.1109/ICCSSE.1988.72244
Filename :
72244
Link To Document :
بازگشت