Programmed deallocation without dangling reference (Q794425)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Programmed deallocation without dangling reference |
scientific article; zbMATH DE number 3860374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Programmed deallocation without dangling reference |
scientific article; zbMATH DE number 3860374 |
Statements
Programmed deallocation without dangling reference (English)
0 references
1984
0 references
In this paper the problem of allocation and deallocation of instances is discussed. A data structure is presented together with related operations providing complete security. The way to avoid dangling reference problem is described with the introduction of a member operation which exploits the data structure invariants. Synchronization problems which occur in parallel computations are also considered.
0 references
dynamic programming languages
0 references
programmed deallocation
0 references
run-time systems
0 references
parallelism
0 references
0.6766459941864014
0 references
0.6632809042930603
0 references
0.6595286726951599
0 references
0.6581218838691711
0 references
0.6507481932640076
0 references
