59 search results - page 5 / 12 » Generating all polynomial invariants in simple loops |
SAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
FOSSACS
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
CAGD
2008
13 years 7 months ago
2008
A plane algebraic curve can be represented as the zero-set of a polynomial in two - or if one takes homogenous coordinates: three - variables. The coefficients of the polynomial de...
KBSE
2008
IEEE
14 years 1 months ago
2008
IEEE
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...