scientific article; zbMATH DE number 1018876
From MaRDI portal
Publication:4339528
Cited in
(21)- A garbage collection policy based on empirical behavior
- An efficient algorithm for cyclic reference counting.
- Backwards type analysis of asynchronous method calls
- Memory representations in rewriting logic semantics definitions
- Inference of field-sensitive reachability and cyclicity
- GC\(^{2}\): a generational conservative garbage collector for the ATERM library
- Functional programming concepts and straight-line programs in computer algebra
- A design and implementation of the extended Andorra model
- Optimal tenuring and major collection times for a generational garbage collector
- Scheduling of hard real-time garbage collection
- Garbage collection-aware utility accrual scheduling
- Cyclic reference counting
- An efficient approach to cyclic reference counting based on a coarse-grained search
- Wait-free concurrent memory management by create and read until deletion (CaRuD)
- Virtual-machine-based heterogeneous checkpointing
- A mostly-copying collector component for class templates
- Optimal real-time garbage collection for acyclic pointer structures
- Lock-free reference counting
- An integrated dynamic memory tracing tool for C++
- An efficient object promotion algorithm for persistent objet systems
- The Reduceron reconfigured and re-evaluated
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339528)
