Thomas Rubiano

According to our database, Thomas Rubiano authored at least 10 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2023

Distributing and Parallelizing Non-canonical Loops.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2023

pymwp: A Static Analyzer Determining Polynomial Growth Bounds.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the Automated Technology for Verification and Analysis, 2023

2022

A Novel Loop Fission Technique Inspired by Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2022

Realizing Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2022

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

An implementation of flow calculus for complexity analysis (tool paper).

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2021

An extended and more practical mwp flow analysis.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2021

2017

Implicit Computational Complexity and Compilers. (Complexité Implicite et compilateurs).

Thomas Rubiano

PhD thesis, 2017

Loop Quasi-Invariant Chunk Motion by peeling with statement composition.

Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller

Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

Loop Quasi-Invariant Chunk Detection.

Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller

Proceedings of the Automated Technology for Verification and Analysis, 2017