Filters








21,705 Hits in 11.0 sec

On the time required for retention

D. M. Berry, L. Chirica, J. B. Johnston, D. F. Martin, A. Sorkin
1973 Proceedings of the ACM-IEEE symposium on High-level-language computer architecture -  
The overhead required for reference count maintenance and storage management is as follows: 1.  ...  The main idea is to take the run time overhead required for LSM's lifetime checks (which prevent potential dangling references in the context of deletion) and use this time to do some reference count management  ...  Our handling of reference counts does not count pointers pointing to the cell in which they reside so knots of one cell do not bother the implementation.  ... 
doi:10.1145/800121.803943 fatcat:a6wcf3u6fjchlpmhbwzcwyu4zi

On the time required for retention

D. M. Berry, L. Chirica, J. B. Johnston, D. F. Martin, A. Sorkin
1973 Proceedings of a symposium on High-level-language computer architecture - SIGPLAN '73  
The overhead required for reference count maintenance and storage management is as follows: 1.  ...  The main idea is to take the run time overhead required for LSM's lifetime checks (which prevent potential dangling references in the context of deletion) and use this time to do some reference count management  ...  Our handling of reference counts does not count pointers pointing to the cell in which they reside so knots of one cell do not bother the implementation.  ... 
doi:10.1145/953144.953169 fatcat:6l7dusco4ndstl3llus7r2wooe

On the time required for retention

D. M. Berry, L. Chirica, J. B. Johnston, D. F. Martin, A. Sorkin
1973 Proceedings of a symposium on High-level-language computer architecture - SIGPLAN '73  
The overhead required for reference count maintenance and storage management is as follows: 1.  ...  The main idea is to take the run time overhead required for LSM's lifetime checks (which prevent potential dangling references in the context of deletion) and use this time to do some reference count management  ...  Our handling of reference counts does not count pointers pointing to the cell in which they reside so knots of one cell do not bother the implementation.  ... 
doi:10.1145/953166.953169 fatcat:er7lo5xdpjhfvimchv77z667jm

On the time required for retention

D. M. Berry, L. Chirica, J. B. Johnston, D. F. Martin, A. Sorkin
1973 SIGPLAN notices  
The overhead required for reference count maintenance and storage management is as follows: 1.  ...  The main idea is to take the run time overhead required for LSM's lifetime checks (which prevent potential dangling references in the context of deletion) and use this time to do some reference count management  ...  Our handling of reference counts does not count pointers pointing to the cell in which they reside so knots of one cell do not bother the implementation.  ... 
doi:10.1145/953171.953169 fatcat:givqv3pvovfyfknhq2by7jjk2i

Fast conservative garbage collection

Rifat Shahriyar, Stephen M. Blackburn, Kathryn S. McKinley
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
We explore conservative collectors for managed languages, with ambiguous stacks and registers.  ...  These findings show that for managed languages, conservative collection is compatible with high performance.  ...  1. We examine conservative garbage collection for managed languages. 2.  ... 
doi:10.1145/2660193.2660198 dblp:conf/oopsla/ShahriyarBM14 fatcat:3ibbrfchirexxk37apcuojcjsq

Fast conservative garbage collection

Rifat Shahriyar, Stephen M. Blackburn, Kathryn S. McKinley
2014 SIGPLAN notices  
We explore conservative collectors for managed languages, with ambiguous stacks and registers.  ...  These findings show that for managed languages, conservative collection is compatible with high performance.  ...  1. We examine conservative garbage collection for managed languages. 2.  ... 
doi:10.1145/2714064.2660198 fatcat:qqr7iyokqfhkzpgyyaswar45ja

Page 2089 of Mathematical Reviews Vol. 58, Issue 3 [page]

1979 Mathematical Reviews  
Time required for reference count management in retention block-structured languages. I. Internat. J. Comput. Information Sci. 7 (1978), no. 1, 11-64.  ...  From the summary: “Two implementations of generalized block- structured languages are presented and their time requirements compared.  ... 

Referencing and Retention in Block-Structured Coroutines

Gary Lindstrom, Mary Lou Soffa
1981 ACM Transactions on Programming Languages and Systems  
We say a language has block-structured coroutines (BSCRs) when static nesting considerations govern the usage of this control combination.  ...  Space and time estimates for both methods are given, along with avenues for continuing research.  ...  Similar conventions are now being advocated for exception handling in block-structured languages.  ... 
doi:10.1145/357139.357143 fatcat:5qt6q7urmfehrd2ktvaqjnn5ju

Database implementation

1984 Data Processing  
Appendix B can be consulted for references about the systems named in this chapter. The exact syntax of examples based on these systems has been modified at times in order to provide continuity.  ...  discussed. 449 Objectives We have implied earlier a number of objectives for a database system design: 1 The ability to refer to data items without having knowledge of record or file structure and as a  ...  In a network references are an inherent part of the structure. We will refer to these structural references as links.  ... 
doi:10.1016/0011-684x(84)90341-1 fatcat:e3ttvlctqrd6bfxmz4xcuzhfmm

Garbage collection in an uncooperative environment

Hans-Juergen Boehm, Mark Weiser
1988 Software, Practice & Experience  
required for garbage collection.  ...  We describe a technique for storage allocation and garbage collection in the absence of significant cooperation from the code using the allocator.T his limits garbage collection overhead to the time actually  ...  Acknowledgements This research was supported in part by NSF grant DCR-8607200.  ... 
doi:10.1002/spe.4380180902 fatcat:czmovrj7abcfvhauyxhrxhexlq

A principled approach to nondeferred reference-counting garbage collection

Pramod G. Joisha
2008 Proceedings of the fourth ACM SIGPLAN/SIGOPS international conference on Virtual execution environments - VEE '08  
In the classic version, a count is kept against each managed resource, indicating the number of references to it [15, 11] .  ...  Nondeferred reference-counting (RC) garbage collection is among the oldest memory-management methods.  ...  Smart pointers are a language aid for easing the management of dynamically allocated resources.  ... 
doi:10.1145/1346256.1346275 dblp:conf/vee/Joisha08 fatcat:jvvdmak6urf5jgu357zzsdr47u

TILT: A GDPR-Aligned Transparency Information Language and Toolkit for Practical Privacy Engineering [article]

Elias Grünewald, Frank Pallas
2020 arXiv   pre-print
We provide a detailed analysis of transparency obligations from the GDPR to identify the expressiveness required for a formal transparency language intended to meet respective legal requirements.  ...  In this paper, we present TILT, a transparency information language and toolkit explicitly designed to represent and process transparency information in line with the requirements of the GDPR and allowing  ...  In a similar vein, we analyzed all transparency obligations and specified required blocks for our transparency information language.  ... 
arXiv:2012.10431v1 fatcat:4wdf4ec7srefzh3zkxamvefil4

Safe manual memory management

David Gay, Rob Ennals, Eric Brewer
2007 Proceedings of the 6th international symposium on Memory management - ISMM '07  
Porting programs for use with HeapSafe typically requires little effort (on average 0.6% of lines change), adds an average 11% time overhead (84% in the worst case), and increases space usage by an average  ...  We present HeapSafe, a tool that uses reference counting to dynamically verify the soundness of manual memory management of C programs.  ...  in other parts of the same data structure that will soon be freed.  ... 
doi:10.1145/1296907.1296911 dblp:conf/iwmm/GayEB07 fatcat:ojdzbvl76fakxaym4rtd2dwwpe

Compacting garbage collection with ambiguous roots

Joel F. Bartlett
1988 ACM SIGPLAN Lisp Pointers  
Like other languages for the Titan, it uses the Mahler intermediate language as its target.  ...  The common intermediate language also simplifies call-outs from Scheme programs to functions written in other languages and call-backs from functions in other languages.  ...  Acknowledgements Wendy Bartlett read and criticized several drafts of this paper, each time substantially improving the presentation.  ... 
doi:10.1145/1317224.1317225 fatcat:kbtdes5jqfgy5ejxscbosn3udi

Komplexität mit objektorientiertem Design bewältigen

Andreas Stutz, Mathias Maurmaier
2018 atp edition - Automatisierungstechnische Praxis  
Die Ergebnisse werden in Form von Best Practice Implementierungen gemäß [1] dargestellt.  ...  Im Zuge der VDI/VDE/NAMUR 2658 [1] erreicht die SPS-Programmierung einen neuen Grad der Komplexität – Einzelsteuerelemente mit komplexen Schnittstellen, Services als Kapselung verfahrenstechnischer Operationen  ...  The data block itself is specified in absolute terms in the first part and in symbolic terms in the second part. 13- 1 . 1 Mathematical, logical and comparative expressions as well as exponential expressions  ... 
doi:10.17560/atp.v60i08.2364 fatcat:z6uj4l2e3zec7hwjot5t525dki
« Previous Showing results 1 — 15 out of 21,705 results