Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Rusch, Neea"'
This work explores an unexpected application of Implicit Computational Complexity (ICC) to parallelize loops in imperative programs. Thanks to a lightweight dependency analysis, our algorithm allows splitting a loop into multiple loops that can be ru
Externí odkaz:
http://arxiv.org/abs/2206.08760
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 firs
Externí odkaz:
http://arxiv.org/abs/2203.05221
Implicit Computational Complexity (ICC) drives better understanding of complexity classes, but it also guides the development of resources-aware languages and static source code analyzers. Among the methods developed, the mwp-flow analysis certifies
Externí odkaz:
http://arxiv.org/abs/2203.03943
Complexity analysis offers assurance of program's runtime behavior, but large classes of programs remain unanalyzable by existing automated techniques.The mwp-flow analysis sidesteps many difficulties shared by existing approaches, and offers interes
Externí odkaz:
http://arxiv.org/abs/2107.00097
We improve and refine a method for certifying that the values' sizes computed by an imperative program will be bounded by polynomials in the program's inputs' sizes. Our work ''tames'' the non-determinism of the original analysis, and offers an innov
Externí odkaz:
http://arxiv.org/abs/2107.00086
This work leverages an original dependency analysis to parallelize loops regardless of their form in imperative programs. Our algorithm distributes a loop into multiple parallelizable loops, resulting in gains in execution time comparable to state-of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2659::f1e80cc09e7697d889b23ab4d746be35
https://zenodo.org/record/7938758
https://zenodo.org/record/7938758
We present a tool to automatically perform the data-size analysis of imperative programs written in C. This tool, called pymwp, is inspired by a classical work on complexity analysis [10], and allows to certify that the size of the values computed by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::363dbe5e1603271f0e8113bbc5bd03ea
https://hal.archives-ouvertes.fr/hal-03269121
https://hal.archives-ouvertes.fr/hal-03269121