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

ver descrição completa

Detalhes bibliográficos
Principais autores: A. M. Ben-Amram, G. W. Hamilton
Formato: Artigo
Idioma:English
Publicado em: Logical Methods in Computer Science e.V. 2021-11-01
coleção:Logical Methods in Computer Science
Assuntos:
Acesso em linha:https://lmcs.episciences.org/6832/pdf