Author:
Bradley Aaron R.,Manna Zohar,Sipma Henny B.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: CAV (2005) (to appear)
2. Colón, M., Sankaranarayanan, S., Sipma, H.: Linear invariant generation using non-linear constraint solving. In: CAV, pp. 420–433 (2003)
3. Colón, M., Sipma, H.: Synthesis of linear ranking functions. In: TACAS, pp. 67–81 (2001)
4. Colón, M., Sipma, H.: Practical methods for proving program termination. In: CAV, pp. 442–454 (2002)
5. Cooper, D.C.: Theorem proving in arithmetic without multiplication. Machine Intelligence 7, 91–100 (1972)
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Data-driven loop bound learning for termination analysis;Proceedings of the 44th International Conference on Software Engineering;2022-05-21
2. What’s decidable about linear loops?;Proceedings of the ACM on Programming Languages;2022-01-12
3. Algebraic Model Checking for Discrete Linear Dynamical Systems;Lecture Notes in Computer Science;2022
4. What’s Decidable About Discrete Linear Dynamical Systems?;Lecture Notes in Computer Science;2022
5. Proving termination by
k
-induction;Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering;2020-12-21