Sciweavers

59 search results - page 2 / 12
» Generating all polynomial invariants in simple loops
Sort
View
CSR
2008
Springer
13 years 7 months ago
Invariant Generation for P-Solvable Loops with Assignments
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
Laura Kovács
CAV
2011
Springer
202views Hardware» more  CAV 2011»
12 years 9 months ago
Simplifying Loop Invariant Generation Using Splitter Predicates
Abstract. We present a novel static analysis technique that substantially improves the quality of invariants inferred by standard loop invariant generation techniques. Our techniqu...
Rahul Sharma 0001, Isil Dillig, Thomas Dillig, Ale...
CVPR
1998
IEEE
14 years 6 months ago
A New Complex Basis for Implicit Polynomial Curves and its Simple Exploitation for Pose Estimation and Invariant Recognition
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
David B. Cooper, Jean-Philippe Tarel
VMCAI
2010
Springer
14 years 3 months ago
Invariant and Type Inference for Matrices
We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types),...
Thomas A. Henzinger, Thibaud Hottelier, Laura Kov&...
CMA
2010
183views more  CMA 2010»
13 years 2 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis