SAT Solving for Termination Analysis with Polynomial Interpretations-Reference-Cited by-同舟云学术

SAT Solving for Termination Analysis with Polynomial Interpretations

Published: Issue: Volume: Page:340-354
ISSN:
Container-title:Theory and Applications of Satisfiability Testing – SAT 2007
language:
Short-container-title:

Author:

Fuhs Carsten,Giesl Jürgen,Middeldorp Aart,Schneider-Kamp Peter,Thiemann René,Zankl Harald

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-72788-0_33.pdf

Reference26 articles.

1. Annov, E., et al.: A SAT-based implementation for RPO termination. In: Short Papers of LPAR ’06 (2006)

2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)

3. Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen (2001)

4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge (1998)

5. Lecture Notes in Computer Science;M. Codish,2006

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

1. Improving Bit-Blasting for Nonlinear Integer Constraints;Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis;2023-07-12

2. Automated Expected Value Analysis of Recursive Programs;Proceedings of the ACM on Programming Languages;2023-06-06

3. When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic;Proceedings of the ACM on Programming Languages;2023-01-09

4. Optimization Modulo Non-linear Arithmetic via Incremental Linearization;Frontiers of Combining Systems;2021

5. A modular cost analysis for probabilistic programs;Proceedings of the ACM on Programming Languages;2020-11-13