A Complete Invariant Generation Approach for P-solvable Loops

@inproceedings{Kovcs2009ACI,
  title={A Complete Invariant Generation Approach for P-solvable Loops},
  author={Laura Kov{\'a}cs},
  booktitle={Ershov Memorial Conference},
  year={2009}
}
We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The proof relies on showing that the dimensions of the prime ideals from the minimal decomposition of the ideals generated at an iteration of our algorithm either remain the same or decrease at the next iteration of the algorithm. Our experimental results report that our method takes less iterations and/or time than other polynomial… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

Similar Papers

Loading similar papers…