Finding Recurrent Sets with Backward Analysis and Trace Partitioning-Reference-Cited by-同舟云学术

Finding Recurrent Sets with Backward Analysis and Trace Partitioning

Published:2016 Issue: Volume: Page:17-35
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Bakhirkin Alexey,Piterman Nir

Publisher

Springer Berlin Heidelberg

Link

Reference35 articles.

1. http://www.zuneboards.com/forums/showthread.php?t=38143 . Last accessed in October 2015

2. http://azure.microsoft.com/blog/2014/11/19/update-on-azure-storage-service-interruption . Last accessed in October 2015

3. http://www.key-project.org/nonTermination/ . Last accessed in October2015

4. http://sv-comp.sosy-lab.org/2015/ . Last accessed in October 2015

5. http://www.termination-portal.org/wiki/Termination_Competition_2015 . Last accessed in October 2015

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

1. Polynomial reachability witnesses via Stellensätze;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18

4. Syntax-Guided Termination Analysis;Computer Aided Verification;2018

5. Geometric Nontermination Arguments;Tools and Algorithms for the Construction and Analysis of Systems;2018