The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
Automated higher-order complexity analysis
Theoretical Computer Science - Implicit computational complexity
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
SIAM Journal on Computing
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Extending the loop language with higher-order procedural variables
ACM Transactions on Computational Logic (TOCL)
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic (TOCL)
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
Quasi-interpretations a way to control resources
Theoretical Computer Science
The flow of data and the complexity of algorithms
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
In the paper's first part, we present a method for certifying that the values computed by a first order imperative program will be bounded by polynomials in the program's inputs. Our method does not yield concrete polynomials, but shows existence of polynomial bounds and upper bounds to their polynomial degrees. In the second part of the paper, we lift our method to allow analysis of higher order programs.