Advanced automata-based algorithms for program termination checking-Reference-Cited by-同舟云学术

Advanced automata-based algorithms for program termination checking

Published:2018-06-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation
language:
Short-container-title:

Author:

Chen Yu-Fang¹,Heizmann Matthias²,Lengál Ondřej³,Li Yong⁴,Tsai Ming-Hsien⁵,Turrini Andrea⁴,Zhang Lijun⁴

Affiliation:

1. Academia Sinica, Taiwan / National Taipei University, Taiwan

2. University of Freiburg, Germany

3. Brno University of Technology, Czechia

4. Institute of Software at Chinese Academy of Sciences, China

5. Academia Sinica, Taiwan

Publisher

ACM

Link

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

Reference54 articles.

1. Software Verification Competition (SV-Comp) Benchmarks. https://github.com/sosy-lab/sv-benchmarks. Accessed: 2017-11-01. Software Verification Competition (SV-Comp) Benchmarks. https://github.com/sosy-lab/sv-benchmarks. Accessed: 2017-11-01.

2. Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. The MIT Press. Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking . The MIT Press.

3. Amir M. Ben-Amram. 2010. Size-Change Termination Monotonicity Constraints and Ranking Functions. Logical Methods in Computer Science 6 3 (2010). http://arxiv.org/abs/1005.0253 Amir M. Ben-Amram. 2010. Size-Change Termination Monotonicity Constraints and Ranking Functions. Logical Methods in Computer Science 6 3 (2010). http://arxiv.org/abs/1005.0253

4. Amir M. Ben-Amram. 2011. Monotonicity Constraints for Termination in the Integer Domain. Logical Methods in Computer Science 7 3 (2011). Amir M. Ben-Amram. 2011. Monotonicity Constraints for Termination in the Integer Domain. Logical Methods in Computer Science 7 3 (2011).

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

1. On the power of finite ambiguity in Büchi complementation;Information and Computation;2023-06

2. Data-driven Recurrent Set Learning For Non-termination Analysis;2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE);2023-05

3. Proving Termination of C Programs with Lists;Automated Deduction – CADE 29;2023

4. Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper);Automated Deduction – CADE 29;2023

5. Modular Mix-and-Match Complementation of Büchi Automata;Tools and Algorithms for the Construction and Analysis of Systems;2023