Discovering non-terminating inputs for multi-path polynomial programs

@article{Liu2014DiscoveringNI,
  title={Discovering non-terminating inputs for multi-path polynomial programs},
  author={Jiang Liu and Ming Xu and Naijun Zhan and Hengjun Zhao},
  journal={J. Systems Science & Complexity},
  year={2014},
  volume={27},
  pages={1286-1304}
}
We investigate the termination problems of multi-path polynomial programs (MPPs) with equational loop guards. To establish sufficient conditions for termination and nontermination simultaneously, we first propose the notion of strong/weak non-termination which under/over-approximates non-termination. Based on polynomial ideal theory, we show that the set of all strong non-terminating inputs (SNTI) and weak non-terminating inputs (WNTI) both correspond to the real varieties of certain polynomial… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Similar Papers

Loading similar papers…