Realizing Implicit Computational Complexity

Clément Aubert (1) , Thomas Rubiano (2) , Neea Rusch (1) , Thomas Seiller (2, 3)

1 Augusta University
2 LIPN - Laboratoire d'Informatique de Paris-Nord
3 CNRS - Centre National de la Recherche Scientifique

This abstract aims at presenting an ongoing effort to apply a novel typing mechanism stemming from Implicit Computational Complexity (ICC), that tracks dependencies between variables in three different ways, at different stages of maturation. The first and third projects bend the original typing discipline to gain finer-grained view on statements independence, to optimize loops by hoisting invariant and by splitting loops "horizontally" to parallelize them more efficiently. The second project refines and implements the original analysis to obtain a fast, modular static analyzer. All three projects aims at pushing the original type system, inspired from ICC, to its limits, to assess how ICC can in practice leads to original, sometimes orthogonal, approaches.

Mots clés: Implicit Computational Complexity; Static Analyzer; Code Optimization

Domaines: Logique en informatique [cs.LO]; Complexité [cs.CC]

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller. Realizing Implicit Computational Complexity. 2022. ⟨hal-03603510v2⟩