Abstraction, Specification and Implementation Techniques, with an Application to Garbage Collection |
From inside the book
Results 1-3 of 5
Page 80
... abstract data types . This confusion of levels of abstraction is not desired , particularly not if storage structures are used in the specification of abstract data types as in [ BERZINS 79 ] . 2.5.4 . Relational objects A " relational ...
... abstract data types . This confusion of levels of abstraction is not desired , particularly not if storage structures are used in the specification of abstract data types as in [ BERZINS 79 ] . 2.5.4 . Relational objects A " relational ...
Page 81
... data structures . The basis of our discussion was the novel concept of a ... abstract data types such as CLU [ LISKOV et al . 77 ] , ALPHARD [ WULF et al ... abstract data type facility as its sole data structuring mechanism . Thirdly ...
... data structures . The basis of our discussion was the novel concept of a ... abstract data types such as CLU [ LISKOV et al . 77 ] , ALPHARD [ WULF et al ... abstract data type facility as its sole data structuring mechanism . Thirdly ...
Page 298
... abstract data types , Acta Informatica 10 ( 1978 ) , 27-52 . [ HADDON & WAITE 67 ] HADDON , B.K. , & WAITE , W.M. , A compaction procedure for variable- length storage elements , Computer Journal 10 ( 1967 ) , 162-165 . [ HANSEN 69 ] ...
... abstract data types , Acta Informatica 10 ( 1978 ) , 27-52 . [ HADDON & WAITE 67 ] HADDON , B.K. , & WAITE , W.M. , A compaction procedure for variable- length storage elements , Computer Journal 10 ( 1967 ) , 162-165 . [ HANSEN 69 ] ...
Contents
1 | 83 |
A STORAGE MANAGEMENT MODEL | 115 |
A SURVEY OF GARBAGE COLLECTION | 147 |
Copyright | |
9 other sections not shown
Common terms and phrases
abstract machine accessor Action ADD,1,w COPY ALGOL 68 Algorithm G Algorithm GNK.DTER assertions atomic object block bookkeeping cell Chapter COLLECT GARBAGE collector compacting garbage compaction algorithms computer science concept cont A(Y cont LOC(X cont(cell cont(cell(b contained COPY,b,w dangling pointers data structures dead areas deallocated defined definition denoted derived described direct components discussed dom(A dynamic system efficient environ(R example Figure free storage GARBAGE and COMPACT garbage collection algorithms graph implementation implies integer ISBN 90 LABEL left A(X locale machine code mapping mathematical MIAM moving phase node marking obj(val pointers precondition problem detail programming language reachable objects reachable reference object representation scalar object scope simple solution space overhead specification status storage management problem storage management system structured object subobject Subsection system invariants target TOP(S traced transformation unreachable updating phase variable visited Xe branches