Loop Summarization and Termination Analysis-Reference-Cited by-同舟云学术

Loop Summarization and Termination Analysis

Published:2011 Issue: Volume: Page:81-95
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Tsitovich Aliaksei,Sharygina Natasha,Wintersteiger Christoph M.,Kroening Daniel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-19835-9_9

Reference22 articles.

1. Podelski, A., Rybalchenko, A.: Transition invariants. In: LICS, pp. 32–41. IEEE Computer Society, Los Alamitos (2004)

2. Lecture Notes in Computer Science;B. Cook,2005

3. Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: PLDI, pp. 415–426. ACM, New York (2006)

4. Lecture Notes in Computer Science;A. Podelski,2006

5. Lecture Notes in Computer Science;B. Cook,2010

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

1. Extending the range of bugs that automated program repair can handle;Journal of Systems and Software;2024-03

2. PARAMETERIZED REACHABILITY GRAPH FOR SOFTWARE MODEL CHECKING BASED ON PDNET;COMPUT INFORM;2023

3. Towards Extending the Range of Bugs That Automated Program Repair Can Handle;2022 IEEE 22nd International Conference on Software Quality, Reliability and Security (QRS);2022-12

4. Neural termination analysis;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07

5. Towards More Reliable Automated Program Repair by Integrating Static Analysis Techniques;2021 IEEE 21st International Conference on Software Quality, Reliability and Security (QRS);2021-12