![]() ![]() The report (in French) contains some explainations on the invariants used to prove correctness. This was done as a project for the Proof of programs ( part 1, part 2) course of the MPRI, given by François Bobot and Jean-Marie Madiot. Implementation and verification of topological sorting using Wh圓. The report (in French) contains some additional information, including the typing rules. It also includes a generational garbage collector, but only the minor collection is implemented, and memory in the major heap is never reclaimed. The language being compiled supports curried functions, algebraic datatypes with deep pattern matching, algebraic effects ( archive) with multishot continuations, and a static type system based on MLsub ( DOI) with type and effect inference, including subtyping. Implementation of a compiler for a small functional language for the Functional programming and type systems course of the MPRI, given by François Pottier, Didier Rémy, Yann Régis-Gianas and Pierre-Évariste Dagand. School projects Compiler for a small functional language (2018). Here are the report and slides for the intership defense, as well as slides for an audience unfamiliar with abstract interpretation, and the paper we published at TACAS 2017 to present the results ( DOI, mirror). This work was done during my 2016 internship in the Chair of Programming Methodology at ETH Zürich, under the supervision of Caterina Urban. Design and implementation of improved widening operators for the FuncTion tool, an analyser for C programs based on abstract interpretation for deriving sufficient preconditions for termination, guarantee and recurrence properties. Improved widening operators for proving termination by abstract interpretation (2016). Here are the report, the slides for the internship defense and the paper ( DOI, mirror) we published about it after some additional work by Antoine Séré. ![]() This work was done during my 2017 internship in the CSL team, under the supervision of Natarajan Shankar. Implementation and verification in PVS of an idealized version of the PVS2C code generator. Verified code generation for the PVS2C code generator (2017). Here are the report, the slides for the internship defense (both in French), and the paper to appear at POPL21 about it. This work was done during my 2018 internship in the Gallium research team under the supervision of Xavier Leroy. Implementation and verification in Coq of the code generation step in the polyhedral model. 3 Memory use optimisations for Lua mapgensĪnd also the using of local var, is speeding up lua alsoĪs some of this optimization are also speeding up the code itself.Projects Work projects Verified code generation for the polyhedral model (2018).So as I read, evey code is using memory, every eben nil var is using memory, also functions are unsing memory, and as confirmed as updates counting via gabagecollect, hole technic pack ahs also +15% of all my memory usage, so please - aas you know your code and might understand what is loading there so much So maybe get a hint about store size, or var size for each item. In all the list, 2 Mod missing, will see nest time start and count, ![]() So, after a new research here and if that is right, I got an idea what technic is using on lua-mem: and later if I get it running, and if it will be less be reason for OOM crash.īut I try to compare your both code positions with old version running yet.īut buffer is not what is ment about optimizing the mem usage of a lua part, it seams to mean everys time when reservation space in every lua part of a mod, it should be done on a way showed up here at first post. So yesterday I failed to update the 5.1.0-dev server (Minetest.one Thailand) to this last code here, as technic didn't load then. OK that doesn't mean technic uses all, but seams asked most for new mem but failed then. I am actual not a active programmer since 13 years, and before had too less practice, but however, on my server now since I run 5.0, 5.1-devs, technic was now 3 times the reason of OOM crash, followed by pipeworks with one. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |