Affiliation:
1. University of Innsbruck, Austria
2. University of Bologna, Italy / Inria, France
Abstract
This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three ingredients: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic transformation and constraint solving. Noticeably, the presented methodology can be fully automated, and is able to analyse a series of examples which cannot be handled by most competitor methodologies. This is possible due to various key ingredients, and in particular an abstract index language and index polymorphism at higher ranks. A prototype implementation is available.
Funder
Agence Nationale de la Recherche
Austrian Science Fund
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Type-Based Verification of Delegated Control in Hybrid Systems;Lecture Notes in Computer Science;2024
2. Execution Time Program Verification with Tight Bounds;Practical Aspects of Declarative Languages;2023
3. Formally Verified Resource Bounds through Implicit Computational Complexity;Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity;2022-11-29
4. Types for Complexity of Parallel Computation in Pi-calculus;ACM Transactions on Programming Languages and Systems;2022-07-15
5. Differential cost analysis with simultaneous potentials and anti-potentials;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09