Abstract
The existence of pointers in a higher-level programming language has been considered by many as a serious, if not insurmountable, impediment to software reliability. This paper seeks to show that most of the problems created by the use of the pointer are due to an implementation level pointer definition. A new approach is proposed which treats the pointer type in a way consistent with other data types. An example is given of how formal program verification methods can be applied to programs manipulating structures created with pointers if the introduced definition is used. A discussion is given of some implications of the adopted concepts and how they are related to the question of data representation and such notions as data abstraction.
Sign-in/Register to access full text options 
Free) 
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 call
