Author:
Bradley Aaron R.,Manna Zohar,Sipma Henny B.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lecture Notes in Computer Science;A.R. Bradley,2005
2. Lecture Notes in Computer Science;A.R. Bradley,2005
3. Codish, M., Genaim, S., Bruynooghe, M., Gallagher, J., Vanhoof, W.: One lop at a time. In: WST (2003)
4. Lecture Notes in Computer Science;M. Colón,2001
5. Lecture Notes in Computer Science;M.A. Colón,2002
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improving Automatic Complexity Analysis of Integer Programs;The Logic of Software. A Tasting Menu of Formal Methods;2022
2. Synthesis of ranking functions via DNN;Neural Computing and Applications;2021-02-26
3. Program Sketching Using Lifted Analysis for Numerical Program Families;Lecture Notes in Computer Science;2021
4. DynamiTe: dynamic termination and non-termination proofs;Proceedings of the ACM on Programming Languages;2020-11-13
5. SVMRanker: a general termination analysis framework of loop programs via SVM;Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2020-11-07