Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
On the time required for reference count management in retention block-structured languages. Part 2
In this paper, two implementations of generalized block-structured languages are presented and compared for time requirements. One implementation, the Lifetime Stack Model, implements the deletion strategy wit...
-
Article
Time required for reference count management in retention block-structured languages. Part 1
In this paper, two implementations of generalized block-structured languages are presented and their time requirements compared. One implementation, the lifetime stack model (LSM), implements the deletion stra...