No label defined (Q4934618)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1390329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1390329 |
Statements
17 January 2000
0 references
rooted edge-labeled graphs
0 references
0.7498735785484314
0 references
0.733146607875824
0 references
0.7141167521476746
0 references
0.7018981575965881
0 references
0.6972419023513794
0 references
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].
0 references
