Ranking Functions for Size-Change Termination II

@article{BenAmram2007RankingFF,
  title={Ranking Functions for Size-Change Termination II},
  author={Amir M. Ben-Amram and Chin Soon Lee},
  journal={Logical Methods in Computer Science},
  year={2007},
  volume={5}
}
Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of size-change graphs. We present algorithms that, for certain classes of size-change graphs, deduce a global ranking function: an expression that ranks program states, and decreases on every transition. A ranking function serves as a witness for a termination proof, and is therefore interesting for… CONTINUE READING

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Ben - Amram . A complexity tradeoff in ranking - function termination proofs

  • M Amir
  • Acta Informatica
  • 2009

Ben - Amram and Michael Codish . A SATbased approach to size change termination with global ranking functions

  • M. Amir
  • 2008

Ben - Amram . Size - change termination with difference constraints

  • M Amir
  • ACM Transactions on Programming Languages and…
  • 2007

Ben - Amram and Chin Soon Lee . Sizechange analysis in polynomial time

  • M. Amir
  • ACM Transactions on Programming Languages and…
  • 2007

Similar Papers

Loading similar papers…