Abstract. 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 a program will be bounded by a polynomial in the program’s inputs. Strategies to provide meaningful feedback on non-polynomial programs and to “tame” the non-determinism of the original analysis were implemented following recent progresses [3], but required particular care to accommodate the growing complexity of the analysis. The Python source code is intensively documented, and our numerous example files encompass the original examples as well as multiple test cases. A pip package s...
This repository provides the code necessary to reproduce the results in the paper "A theoretical app...
We present a modular approach to automatic complexity analysis of integer programs. Based on a novel...
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any ...
International audienceImplicit Computational Complexity (ICC) drives better understanding of complex...
We improve and refine a method for certifying that the values' sizes computed by an imperative progr...
Abstract. We present a modular approach to automatic complexity analysis. Based on a novel alternati...
Abstract. We present a modular approach to automatic complexity analysis. Based on a novel alternati...
pymwp is a tool for automatically performing static analysis on programs written in C. It analyzes r...
pymwp is a tool for automatically performing static analysis on programs written in C. It analyzes r...
AbstractA definition is proposed for a size measure to be used as a parameter for algorithm analysis...
Many software engineering tools such as program slicers must perform data-flow analysis in order to ...
Abstract. Flow analysis is a ubiquitous and much-studied component of compiler technology—and its va...
We propose to measure the efficiency of any implementation of the lambda-calculus as a function of a...
The standard language for describing the asymptotic behavior of algorithms is theoretical computatio...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
This repository provides the code necessary to reproduce the results in the paper "A theoretical app...
We present a modular approach to automatic complexity analysis of integer programs. Based on a novel...
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any ...
International audienceImplicit Computational Complexity (ICC) drives better understanding of complex...
We improve and refine a method for certifying that the values' sizes computed by an imperative progr...
Abstract. We present a modular approach to automatic complexity analysis. Based on a novel alternati...
Abstract. We present a modular approach to automatic complexity analysis. Based on a novel alternati...
pymwp is a tool for automatically performing static analysis on programs written in C. It analyzes r...
pymwp is a tool for automatically performing static analysis on programs written in C. It analyzes r...
AbstractA definition is proposed for a size measure to be used as a parameter for algorithm analysis...
Many software engineering tools such as program slicers must perform data-flow analysis in order to ...
Abstract. Flow analysis is a ubiquitous and much-studied component of compiler technology—and its va...
We propose to measure the efficiency of any implementation of the lambda-calculus as a function of a...
The standard language for describing the asymptotic behavior of algorithms is theoretical computatio...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
This repository provides the code necessary to reproduce the results in the paper "A theoretical app...
We present a modular approach to automatic complexity analysis of integer programs. Based on a novel...
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any ...