The authors propose a generic mathematical model to help in formalization of assertions about pointer structures that have gained much importance in the field of programming, especially in object-oriented programming. The approach taken here is based on rooted edge-labeled graphs. A graph specifies the classes of objects that each variable and attribute is allowed to point to. This model makes it possible to adopt methods from automata theory: E.g., the problem of inaccessible objects can be treated by calculating the language of traces, and deterministic graphs permit automatic resolution of polymorphism. Overall, the paper presents an interesting idea, which is worth to be worked out in more detail.
For the entire collection see [Zbl 0919.00073].