Realizing Implicit Computational Complexity - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2022

Realizing Implicit Computational Complexity

Abstract

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.
Fichier principal
Vignette du fichier
main.pdf (108.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03603510 , version 1 (09-03-2022)
hal-03603510 , version 2 (24-05-2022)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More