Loopster: Static loop termination analysis
Loop termination is an important problem for proving the correctness of a system and ensuring that the system always reacts. Existing loop termination analysis techniques mainly depend on the synthesis of ranking functions, which is often expensive. In this paper, we present a novel approach, named...
Saved in:
Main Authors: | XIE, Xiaofei, CHEN, Bihuan, ZOU, Liang, LIN, Shang-Wei, LIU, Yang, LI, Xiaohong |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7104 https://ink.library.smu.edu.sg/context/sis_research/article/8107/viewcontent/3106237.3106260.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Automatic loop summarization via path dependency analysis
by: XIE, Xiaofei, et al.
Published: (2019) -
Automatic loop summarization via path dependency analysis
by: Xie, Xiaofei, et al.
Published: (2020) -
Static loop analysis and Its applications
by: XIE, Xiaofei
Published: (2016) -
Large-scale analysis of non-termination bugs in real-world OSS projects
by: SHI, Xiuhan, et al.
Published: (2022) -
Stochastic invariants for probabilistic termination
by: CHATTERJEE, Krishnendu, et al.
Published: (2017)