Policy Iteration-Based Conditional Termination and Ranking Functions-Reference-Cited by-同舟云学术

Policy Iteration-Based Conditional Termination and Ranking Functions

Published:2014 Issue: Volume: Page:453-471
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Massé Damien

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-54013-4_25

Reference30 articles.

1. Lecture Notes in Computer Science;A. Adjé,2010

2. Alias, C., Darte, A., Feautrier, P., Gonnord, L.: Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In: Cousot, Martel (eds.) [15], pp. 117–133

3. Amato, G., Parton, M., Scozzari, F.: Deriving numerical abstract domains via principal component analysis. In: Cousot, Martel (eds.) [15], pp. 134–150

4. Lecture Notes in Computer Science;M. Bozga,2012

5. Lecture Notes in Computer Science;H.Y. Chen,2012

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

1. Bit-Precise Procedure-Modular Termination Analysis;ACM Transactions on Programming Languages and Systems;2018-03-31

2. Inference of ranking functions for proving temporal properties by abstract interpretation;Computer Languages, Systems & Structures;2017-01

3. Proving Termination Through Conditional Termination;Tools and Algorithms for the Construction and Analysis of Systems;2017

4. Computing Invariants with Transformers: Experimental Scalability and Accuracy;Electronic Notes in Theoretical Computer Science;2014-09

5. Abstract interpretation;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14