Termination Analysis with Compositional Transition Invariants-Reference-Cited by-同舟云学术

Termination Analysis with Compositional Transition Invariants

Published:2010 Issue: Volume: Page:89-103
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-14295-6_9.pdf

Reference20 articles.

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

2. Cook, B., Kroening, D., Ruemmer, P., Wintersteiger, C.: Ranking function synthesis for bit-vector relations. In: TACAS, pp. 236–250. Springer, Heidelberg (2010)

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

4. Lecture Notes in Computer Science;M. Colón,2001

5. Lecture Notes in Computer Science;A. Podelski,2004

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

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

2. 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

3. Using graph neural networks for program termination;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07

4. Data-driven loop bound learning for termination analysis;Proceedings of the 44th International Conference on Software Engineering;2022-05-21

5. Computing program functions;Proceedings of the IEEE/ACM 10th International Conference on Formal Methods in Software Engineering;2022-05-18