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

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 17, Issue 4
Hlavní autori:	Ben-Amram, A. M., Hamilton, G. W.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 01.01.2021
Predmet:	computer science - logic in computer science f.2.0
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!