Author:
Ben-Amram Amir M.,Codish Michael
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Lecture Notes in Computer Science;J. Avery,2006
2. Ben-Amram, A.M.: A complexity tradeoff in ranking-function termination proofs (submitted for publication 2007)
3. Ben-Amram, A.M., Lee, C.S.: Ranking functions for size-change termination II. In: 9th International Workshop on Termination (WST 2007) (July 2007)
4. Ben-Amram, A.M., Lee, C.S.: Size-change analysis in polynomial time. ACM Transactions on Programming Languages and Systems 29(1) (2007)
5. Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination analysis of logic programs through combination of type-based norms. ACM TOPLAS 29(2) (2007)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献