1204 search results - page 13 / 241 » Termination of Polynomial Programs |
ENTCS
2008
13 years 11 months ago
2008
Abstract
ESOP
2010
Springer
14 years 8 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
SODA
2000
ACM
14 years 7 days ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
PLDI
2006
ACM
14 years 4 months ago
2006
ACM
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
CIE
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...