Loopster: static loop termination analysis-Reference-Cited by-同舟云学术

Loopster: static loop termination analysis

Published:2017-08-21 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering
language:
Short-container-title:

Author:

Xie Xiaofei¹,Chen Bihuan²,Zou Liang²,Lin Shang-Wei²,Liu Yang²,Li Xiaohong¹

Affiliation:

1. Tianjin University, China

2. Nanyang Technological University, Singapore

Funder

National Natural Science Foundation of China

National Research Foundation Singapore

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3106237.3106260

Reference42 articles.

1. 2016. Competition on Software Verification 2016. http://sv-comp.sosy-lab.org/ 2016. (2016). 2017. 2LS for Program Analysis. http://www.cprover.org/wiki/doku.php?id=2ls_ for_program_analysis. (2017). 2017. llvm2kittel. (2017). https://github.com/s-falke/llvm2kittel. 2017. LLVM’s Analysis and Transform Passes. http://llvm.org/docs/Passes.html. (2017). 2017. Loopster. https://sites.google.com/site/looptermination. (2017). 2016. Competition on Software Verification 2016. http://sv-comp.sosy-lab.org/ 2016. (2016). 2017. 2LS for Program Analysis. http://www.cprover.org/wiki/doku.php?id=2ls_ for_program_analysis. (2017). 2017. llvm2kittel. (2017). https://github.com/s-falke/llvm2kittel. 2017. LLVM’s Analysis and Transform Passes. http://llvm.org/docs/Passes.html. (2017). 2017. Loopster. https://sites.google.com/site/looptermination. (2017).

2. Mohamed Faouzi Atig Ahmed Bouajjani Michael Emmi and Akash Lal. 2012. Detecting Fair Non-termination in Multithreaded Programs. In CAV. 210–226. 10.1007/978-3-642-31424-7_19 Mohamed Faouzi Atig Ahmed Bouajjani Michael Emmi and Akash Lal. 2012. Detecting Fair Non-termination in Multithreaded Programs. In CAV. 210–226. 10.1007/978-3-642-31424-7_19

3. Ranking Functions for Linear-Constraint Loops

4. Josh Berdine Byron Cook Dino Distefano and Peter W. O’Hearn. 2006. Automatic Termination Proofs for Programs with Shape-shifting Heaps. In CAV. 386–400. 10.1007/11817963_35 Josh Berdine Byron Cook Dino Distefano and Peter W. O’Hearn. 2006. Automatic Termination Proofs for Programs with Shape-shifting Heaps. In CAV. 386–400. 10.1007/11817963_35

5. Aaron R. Bradley Zohar Manna and Henny B. Sipma. 2005. Linear ranking with reachability. In CAV. 491–504. 10.1007/11513988_48 Aaron R. Bradley Zohar Manna and Henny B. Sipma. 2005. Linear ranking with reachability. In CAV. 491–504. 10.1007/11513988_48

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

1. EndWatch: A Practical Method for Detecting Non-Termination in Real-World Software;2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE);2023-09-11

2. Large-scale analysis of non-termination bugs in real-world OSS projects;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07

3. Discovering Properties about Arrays via Path Dependence Analysis;2021 International Symposium on Theoretical Aspects of Software Engineering (TASE);2021-08

4. Loopster++: Termination Analysis for Multi-path Linear Loop;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2021

5. Recovering fitness gradients for interprocedural Boolean flags in search-based testing;Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis;2020-07-13