Summarization for termination: no return!-Reference-Cited by-同舟云学术

Summarization for termination: no return!

Published:2009-10-13 Issue:3 Volume:35 Page:369-387
ISSN:0925-9856
Container-title:Formal Methods in System Design
language:en
Short-container-title:Form Methods Syst Des

Author:

Cook Byron,Podelski Andreas,Rybalchenko Andrey

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s10703-009-0087-8.pdf

Reference33 articles.

1. Alur R, Madhusudan P (2004) Visibly pushdown languages. In: STOC. ACM, New York

2. Alur R, Etessami K, Madhusudan P (2004) A temporal logic of nested calls and returns. In: TACAS. Springer, Berlin

3. Alur R, Benedikt M, Etessami K, Godefroid P, Reps TW, Yannakakis M (2005) Analysis of recursive state machines. ACM Trans Program Lang Syst

4. Alur R, Chaudhuri S, Madhusudan P (2006) A fixpoint calculus for local and global program flows. In: POPL. ACM, New York

5. Ball T, Rajamani SK (2000) Bebop: A symbolic model checker for Boolean programs. In: SPIN. Springer, Berlin

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Termination analysis without the tears;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18

2. Non-polynomial Worst-Case Analysis of Recursive Programs;ACM Transactions on Programming Languages and Systems;2019-12-05

3. Cost analysis of nondeterministic probabilistic programs;Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation;2019-06-08

4. Non-polynomial Worst-Case Analysis of Recursive Programs;Computer Aided Verification;2017

5. Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic;Journal of Automated Reasoning;2016-10-22