1204 search results - page 50 / 241 » Termination of Polynomial Programs |
FOSSACS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
ESOP
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
FAC
2006
13 years 11 months ago
2006
A formal relationship between program slicing and partial evaluation is established. It is proved that for terminating programs, a residual program produced by partial evaluation i...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
IJAC
2006
13 years 11 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...