[cap-talk] Video of Marc Stiegler's talk at Google : "The Lazy Programmer's Guide to Secure Computing"

[Mike Samuel]

2010/3/30 Mike Samuel <mikesamuel at gmail.com>:
> 2010/3/30 Kenton Varda <kenton at google.com>:
>> On Tue, Mar 30, 2010 at 2:51 PM, Raoul Duke <raould at gmail.com> wrote:
>>>
>>> but i wondered if, given something like IDisposing, the gc could
>>> special case those things since they are thus marked. if it could,
>>> then there would be trade-offs wrt performance and complexity of the
>>> gc but one could get the benefit of RAIInit style. ok, maybe not smart
>>> vs. just going with IDisposing as it is done today.
>>
>> Unlikely.  It would have to give special treatment not just to the
>> IDisposing object, but also everything that references the object, in order
>> to track all paths through which it is reachable.  This would be
>> unreasonably difficult.
>
> This might work in some languages like Cyclone (
> http://en.wikipedia.org/wiki/Cyclone_(programming_language)#Dangling_pointers_and_region_analysis
> ) where you can allocate objects on the stack, in a garbage collected
> arena, or in an arena whose lifetime is tied to a stack.
>
> I don't know whether Cyclone is RAIInit.

That link is not really very informative.  More on Cyclone's memory
allocation at http://cyclone.thelanguage.org/wiki/Introduction%20to%20Regions


>
>
>> _______________________________________________
>> cap-talk mailing list
>> cap-talk at mail.eros-os.org
>> http://www.eros-os.org/mailman/listinfo/cap-talk
>>
>>
>