Tight Polynomial Bounds for Loop Programs in Polynomial Space
| Autor: | Geoff W. Hamilton, Amir M. Ben-Amram |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
FOS: Computer and information sciences
Discrete mathematics Computer Science - Logic in Computer Science Multivariate statistics Polynomial General Computer Science Computability Computation Univariate Logic in Computer Science (cs.LO) Theoretical Computer Science Set (abstract data type) Reduction (complexity) ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION F.2.0 PSPACE Mathematics |
| Zdroj: | Logical Methods in Computer Science. 17 |
| ISSN: | 1860-5974 |
| DOI: | 10.46298/lmcs-17(4:7)2021 |
| Popis: | We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in terms of its input values. We focus on the case of polynomially-bounded variables, and on a weak programming language for which we have recently shown that tight bounds for polynomially-bounded variables are computable. These bounds are sets of multivariate polynomials. While their computability has been settled, the complexity of this program-analysis problem remained open. In this paper, we show the problem to be PSPACE-complete. The main contribution is a new, space-efficient analysis algorithm. This algorithm is obtained in a few steps. First, we develop an algorithm for univariate bounds, a sub-problem which is already PSPACE-hard. Then, a decision procedure for multivariate bounds is achieved by reducing this problem to the univariate case; this reduction is orthogonal to the solution of the univariate problem and uses observations on the geometry of a set of vectors that represent multivariate bounds. Finally, we transform the univariate-bound algorithm to produce multivariate bounds. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|