Conference paper Open Access
Realizing Implicit Computational Complexity
Aubert, Clément;
Rubiano, Thomas;
Rusch, Neea;
Seiller, Thomas
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.
Files
(190.2 kB)
| Name | Size | |
|---|---|---|
|
realizing-implicit-computational-complexity.pdf
md5:5d2f1b7c7588f39ba90d5ee01e770089 |
190.2 kB | Download |
9
4
views
downloads
| All versions | This version | |
|---|---|---|
| Views | 9 | 9 |
| Downloads | 4 | 4 |
| Data volume | 760.8 kB | 760.8 kB |
| Unique views | 9 | 9 |
| Unique downloads | 4 | 4 |
Indexed in
- Publication date:
- June 20, 2022
- DOI:
-
- License (for files):
- Creative Commons Attribution No Derivatives 4.0 International