Loopster: Static loop termination analysis

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

Full description

Saved in:
Bibliographic Details
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:
Loop Termination
Reachability
Path Dependency Automaton
Programming Languages and Compilers
Software Engineering
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

Internet

https://ink.library.smu.edu.sg/sis_research/7104
https://ink.library.smu.edu.sg/context/sis_research/article/8107/viewcontent/3106237.3106260.pdf

Similar Items