
Thomas Rubiano
5
Documents
Presentation
I am a PhD student at the LIPN in Université Paris 13. I try to implement some Implicit Computational Complexity theories. I’m currently working on a LLVM module able to find some properties of programs with static analysis. This thesis is supervised by Jean-Yves Moyen and Virgil Mogbile and it’s funded by the ELICA ANR project.
Publications
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
4
3
3
2
2
2
2
1
Publications
|
pymwp: A Static Analyzer Determining Polynomial Growth BoundsAutomated Technology for Verification and Analysis (ATVA 2023), Oct 2023, Singapour, France. ⟨10.1007/978-3-031-45332-8_14⟩
Conference papers
hal-03269121
v4
|
|
Detection of Non-Size Increasing Programs in CompilersDevelopment in Implicit Computational Complexity (DICE 2016), Damiano Mazza, Apr 2016, Eindhoven, Netherlands
Conference papers
hal-01310898
v1
|
Loop Quasi-Invariant Chunk DetectionAutomated Technology for Verification and Analysis. ATVA 2017, pp.91-108, 2017, ⟨10.1007/978-3-319-68167-2_7⟩
Book sections
hal-02345688
v1
|
|
Certifying Complexity Analysis2023
Preprints, Working Papers, ...
hal-04083105
v1
|
|
An extended and more practical mwp flow analysis2021
Preprints, Working Papers, ...
hal-03269096
v2
|
Loading...
Loading...