2009
DOI: 10.1002/cpe.v21:12
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(1 citation statement)
references
References 123 publications
0
1
0
Order By: Relevance
“…Often garbage collectors avoid to explicitly walk the stack either by allocating all the roots in an explicit pointer stack [Siebert 2001], or by keeping an explicit lists across stack frames [Henderson 2002]. Other approaches, as the lazy pointer stacks by Baker et al [2009], identify all the stack allocated pointers by walking the stack at a GC safe point, and require reliable unwind tables.…”
Section: Related Workmentioning
confidence: 99%
“…Often garbage collectors avoid to explicitly walk the stack either by allocating all the roots in an explicit pointer stack [Siebert 2001], or by keeping an explicit lists across stack frames [Henderson 2002]. Other approaches, as the lazy pointer stacks by Baker et al [2009], identify all the stack allocated pointers by walking the stack at a GC safe point, and require reliable unwind tables.…”
Section: Related Workmentioning
confidence: 99%