Finding lexicographic orders for termination proofs in Isabelle/HOL (2007)

by Lukas Bulwahn , Er Krauss , Tobias Nipkow
Venue:Theorem Proving in Higher Order Logics: TPHOLs 2007, volume 4732 of Lecture Notes in Computer Science
Citations:14 - 5 self

Active Bibliography

12 Partial recursive functions in higher-order logic – Alexander Krauss - 2006
14 Certified size-change termination – Alexander Krauss - 2007
1 Termination Analysis by Dependency Pairs and Inductive Theorem Proving ⋆ – S. Swiderski, M. Parting, J. Giesl, C. Fuhs, P. Schneider-kamp
2 Proving Termination by Dependency Pairs and Inductive Theorem Proving – Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski
Automated Termination Proofs for Haskell . . . – Jürgen Giesl, Matthias Raffelsieper , Peter Schneider-Kamp, Stephan Swiderski, René Thiemann - 2010
Shallow Dependency Pairs – Alexander Krauss
Soundness of a Logic-Based Verification Method for Imperative Loops – Tudor Jebelean
10 Knowledge Representation and Classical Logic – Vladimir Lifschitz, Leora Morgenstern
Chapter 1 Knowledge Representation and Classical Logic – Edited F. Van Harmelen, V. Lifschitz, B. Porter, Vladimir Lifschitz, Leora Morgenstern, David Plaisted
Under consideration for publication in Math. Struct. in Comp. Science Partiality and Recursion in Interactive Theorem Provers — An Overview – unknown authors - 2011
All-Termination(T) ⋆ – Panagiotis Manolios, Aaron Turon
All-Termination(SCP) – Panagiotis Manolios, Aaron Turon
7 Integrating reasoning about ordinal arithmetic into ACL2 – Panagiotis Manolios, Daron Vroon - 2004
1 Combining Advanced Formal Hardware Verification Techniques – Erik Henry Reeber, Warren A. Hunt, E. Allen Emerson, Stephen W. Keckler, J Strother Moore, Anna Slobodova, Erik Henry Reeber - 2007
Under consideration for publication in Math. Struct. in Comp. Science Partiality and Recursion in Interactive Theorem Provers — An Overview – unknown authors - 2011
An implementation of a termination checker for Alfa – Davidf Wahlstedt - 2002
5 MONOTONICITY CONSTRAINTS FOR TERMINATION IN THE INTEGER DOMAIN – Amir M. Ben-amram
3 H.: Bound Analysis of Imperative Programs with the Size-change Abstraction – Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith, Tu Wien - 2011
18 A SAT-Based Approach to Size Change Termination with Global Ranking Functions – Amir M. Ben-amram, Michael Codish