svmranker:main
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
svmranker:main [2020/11/17 21:26] – merlin | svmranker:main [Unknown date] (current) – removed - external edit (Unknown date) 127.0.0.1 | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | | ||
- | ====== Introduction ====== | ||
- | SVMRanker is a general framework for proving termination of loop programs.SVMRanker utilizes SVM techniques to synthesize multiphase ranking functions to prove program termination. | ||
- | ---- | ||
- | |||
- | ---- | ||
- | |||
- | ====== Future Work ====== | ||
- | * Support more types of templates, such as fractional and with n-roots, and ranking functions, such as lexicographic ranking functions, piece-wise ranking functions and so on, as described in [1]. | ||
- | | ||
- | * Strengthen the ability of SVMRanker to prove nontermination, | ||
- | |||
- | * Synthesizing coefficients of ranking functions with deep neural networks. |