|
156
|
The Size-Change Principle for Program Termination
– Chin Soon Lee, Neil D. Jones, Amir M. Ben-amram
- 2001
|
|
228
|
Computer-Aided Reasoning: An Approach
– M Kaufmann, P Manolios, J S Moore
- 2000
|
|
15
|
Certified size-change termination
– Alexander Krauss
- 2007
|
|
100
|
Termination proofs for systems code
– Byron Cook, Andreas Podelski, Andrey Rybalchenko
- 2006
|
|
195
|
Termination of Term Rewriting Using Dependency Pairs
– Thomas Arts, Jürgen Giesl
- 2000
|
|
506
|
A Computational Logic
– Robert S Boyer, J Strother Moore
- 1979
|
|
54
|
Automating the dependency pair method
– Nao Hirokawa, Aart Middeldorp
- 2003
|
|
58
|
Mechanizing and Improving Dependency Pairs
– Jürgen Giesl, René Thiemann, Stephan Falke
- 2006
|
|
38
|
A General Framework for Automatic Termination Analysis of Logic Programs
– Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik
- 2000
|
|
49
|
Practical methods for proving program termination
– Michael A. Col'on, Henny B. Sipma
- 2002
|
|
585
|
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
– T Nipkow, L C Paulson, M Wenzel
- 2002
|
|
13
|
Size-change termination and bound analysis
– J Avery
|
|
18
|
Finiteness Analysis in Polynomial Time
– Chin Soon Lee
- 2002
|
|
23
|
Testing for termination with monotonicity constraints
– Michael Codish, Vitaly Lagoon, Peter J. Stuckey
- 2005
|
|
10
|
A complexity tradeoff in ranking-function termination proofs. submitted for publication
– Amir M. Ben-amram
- 2007
|
|
16
|
Proving non-termination
– A Gupta, T A Henzinger, R Majumdar, A Rybalchenko, R-G Xu
- 2008
|
|
12
|
Proving Termination by Bounded Increase
– Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp
- 2007
|
|
70
|
Transition Invariants
– Andreas Podelski, Andrey Rybalchenko
|
|
44
|
Transition predicate abstraction and fair termination
– A Podelski, A Rybalchenko
- 2005
|
