A Structural Approach to Pointer Data Types

概要

論文の詳細を見る
Programs with pointers tend to be difficult to understand and error-prone. At the same time, verification of such programs is often quite complex. Thus it is desirable to restrict the use of pointers while maintaining efficiencies provided by pointer manipulation. To this end, a concept is introduced for tree structures with the mechanism of direct access to subtrees. It is proposed to embed this structuring concept into programming languages as an abstract data type basic to the languages. Examples are given, which suggests that this approach provides a clean view of pointer operations and eases verification of programs while reasonably maintaining efficiency of pointer manipulations.
一般社団法人情報処理学会の論文
1982-06-30