Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Does this make it more difficult to reason about the program memory usage over its lifetime, or can all potential cases be statically analyzed?


The paper is about trying to statically analyze this. As I understand it, fip-annotated functions are ones that are checked to neither allocate nor deallocate.


Seems easy and clear: they introduce a keyword "fip" that you use to mark a function as being fully in-place, and they statically check it.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: