3 ms·
This at first glance actually looks similar to http://liu.diva-portal.org/smash/get/diva2:20899/FULLTEXT01.pdf http://liu.diva-portal.org/smash/get/diva2:20899
by alexisread 8y ago
This at first glance actually looks similar to
http://liu.diva-portal.org/smash/get/diva2:20899/FULLTEXT01.pdf http://liu.diva-portal.org/smash/get/diva2:20899/FULLTEXT01....
And this style of static analysis has been taken even further by Luc Blaeser:
http://concurrency.ch/Content/publications/Blaeser_Component_Operating_System_PLOS_2007.pdf http://concurrency.ch/Content/publications/Blaeser_Component...
The cycle checker I'll have to have a look at - I'd like to crib parts of it for an OS I'm trying to cobble together. Your project looks very interesting, thanks!
- Aardappel 8y agoThanks for those, I hadn't seen them. The Ritzau paper indeed appears to be doing something very similar, where in 5.2 he describes "inner references" whose lifetime is bounded by the outer one, I call that "borrowing", where the outer definition (the owner) gets locked from mutation during the borrow. What I do is a bit more involved though, as for every language construct I indicate if it wants to own or borrow its children (and wether it wants the parent to own or borrow), to remove maximum refcounts, also for cases which are not simply variables. Again, I will describe this in detail. The second paper I don't see how it relates to what I am doing.
- Aardappel 8y agohttp://aardappel.github.io/lobster/memory_management.html http://aardappel.github.io/lobster/memory_management.html