Termination of Triangular Integer Loops is Decidable-Reference-Cited by-同舟云学术

Termination of Triangular Integer Loops is Decidable

Published:2019 Issue: Volume: Page:426-444
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Frohn Florian^ORCID,Giesl Jürgen^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-25543-5_24

Reference15 articles.

1. Bagnara, R., Zaccagnini, A., Zolo, T.: The Automatic Solution of Recurrence Relations. I. Linear Recurrences of Finite Order with Constant Coefficients. Technical report. Quaderno 334. Dipartimento di Matematica, Università di Parma, Italy (2003). http://www.cs.unipr.it/Publications/

2. Ben-Amram, A.M., Genaim, S., Masud, A.N.: On the termination of integer loops. ACM Trans. Programm. Lang. Syst. 34(4), 16:1–16:24 (2012). https://doi.org/10.1145/2400676.2400679

3. Bozga, M., Iosif, R., Konecný, F.: Deciding conditional termination. Logical Methods Comput. Sci. 10(3) (2014). https://doi.org/10.2168/LMCS-10(3:8)2014

4. Lecture Notes in Computer Science;M Braverman,2006

5. Lecture Notes in Computer Science;M Brockschmidt,2016

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

1. Satisfiability Modulo Exponential Integer Arithmetic;Lecture Notes in Computer Science;2024

2. Termination of triangular polynomial loops;Formal Methods in System Design;2023-12-04

3. Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs;Frontiers of Combining Systems;2023

4. LTL falsification in infinite-state systems;Information and Computation;2022-11

5. A calculus for modular loop acceleration and non-termination proofs;International Journal on Software Tools for Technology Transfer;2022-10