Abstract
Abstract data types are a widely accepted means for enhancing software reliability and data security. The objection raised against abstract data type based programming languages is their run time inefficiency when executed on a conventional machine. In the paper, a data type architecture is described which offers efficient and convenient mechanisms for constructing arbitrary data structures and user-defined abstract data types, thus avoiding the inefficiency penalty mentioned above. Through a process of hierarchical decomposition, user-defined abstract data types are mapped on representations given in terms of a basic structured machine data type. This approach combines high performance with generality and completeness. The architecture is structured as a strongly coupled, asymmetric multiprocessor system and includes a pipeline for processing objects of the vector-structured machine data type. Software reliability is enhanced by consistency checks performed at run time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
