Tight Polynomial Bounds for Loop Programs in Polynomial Space

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...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 17, Issue 4
Main Authors:	Ben-Amram, A. M., Hamilton, G. W.
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2021
Subjects:	computer science - logic in computer science f.2.0
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!