2020
DOI: 10.48550/arxiv.2010.02823
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Tight Polynomial Bounds for Loop Programs in Polynomial Space

A. M. Ben-Amram,
G. W. Hamilton

Abstract: 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. While their computability has been settled, the complexity of this program-analysis problem remained open. In this pa… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 6 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?