mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity
Cl\'ement Aubert, Thomas Rubiano (LIPN), Neea Rusch, Thomas Seiller, (CNRS)

TL;DR
This paper enhances and implements the mwp-flow analysis for implicit computational complexity, making it practical for automatic data-size analysis of C programs and facilitating certified complexity proofs.
Contribution
It fine-tunes and extends the mwp-flow analysis to handle function calls and improves its efficiency for practical use in complexity analysis.
Findings
The analysis is now more tractable and efficient for real-world programs.
It can automatically compute data size bounds for C programs.
The approach enables certified complexity analysis.
Abstract
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 polynomial bounds on the size of the values manipulated by an imperative program. This result is obtained by bounding the transitions between states instead of focusing on states in isolation, as most static analyzers do, and is not concerned with termination or tight bounds on values. Those differences, along with its built-in compositionality, make the mwp-flow analysis a good target for determining how ICC-inspired techniques diverge compared with more traditional static analysis methods. This paper's contributions are threefold: we fine-tune the internal machinery of the original analysis to make it tractable in practice; we extend the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Engineering Research · Parallel Computing and Optimization Techniques · Computability, Logic, AI Algorithms
