DeepAI AI Chat
Log In Sign Up

An extended and more practical mwp flow analysis

by   Clément Aubert, et al.

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 innovative way of completing the analysis when a non-polynomial growth is found. We furthermore enrich the analyzed language by adding function definitions and calls, allowing to compose the analysis of different libraries and offering generally more modularity. The implementation of our improved method, discussed in a tool paper (, also required to reason about the efficiency of some of the needed operations on the matrices produced by the analysis. It is our hope that this work will enable and facilitate static analysis of source code to guarantee its correctness with respect to resource usages.


page 1

page 2

page 3

page 4


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

Abstract. We present a tool to automatically perform the data-size analy...

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity

Implicit Computational Complexity (ICC) drives better understanding of c...

JCoffee: Using Compiler Feedback to Make Partial Code Snippets Compilable

Static program analysis tools are often required to work with only a sma...

Augmenting Diffs With Runtime Information

Source code diffs are used on a daily basis as part of code review, insp...

Offline Specialisation in Prolog Using a Hand-Written Compiler Generator

The so called "cogen approach" to program specialisation, writing a comp...

LExecutor: Learning-Guided Execution

Executing code is essential for various program analysis tasks, e.g., to...

The propagation game: on simulatability, correlation matrices, and probing security

This work is intended for researchers in the field of side-channel attac...