Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Meyer, Eleanore"'
There exist several approaches to infer runtime or resource bounds for integer programs automatically. In this paper, we study the subclass of periodic rational solvable loops (prs-loops), where questions regarding the runtime and the size of variabl
Externí odkaz:
http://arxiv.org/abs/2412.01832
Recently, we showed how to use control-flow refinement (CFR) to improve automatic complexity analysis of integer programs. While up to now CFR was limited to classical programs, in this paper we extend CFR to probabilistic programs and show its sound
Externí odkaz:
http://arxiv.org/abs/2402.03891
There exist several results on deciding termination and computing runtime bounds for triangular weakly non-linear loops (twn-loops). We show how to use results on such subclasses of programs where complexity bounds are computable within incomplete ap
Externí odkaz:
http://arxiv.org/abs/2307.10061
Publikováno v:
Journal of School Health; Nov1982, Vol. 52 Issue 9, p525-528, 4p
Publikováno v:
Pediatric Clinics of North America; February 1977, Vol. 24 Issue: 1 p123-132, 10p