Decidability of the purely existential fragment of the theory of term algebras
Journal of the ACM (JACM)
Automating the Knuth Bendix ordering
Acta Informatica
Simple LPO constraint solving methods
Information Processing Letters
Term rewriting and all that
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination with multiset orderings
Communications of the ACM
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synthesis of Linear Ranking Functions
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
RPO Constraint Solving Is in NP
Proceedings of the 12th International Workshop on Computer Science Logic
Combining Multisets with Integers
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Ensuring termination by typability
Information and Computation
Transition predicate abstraction and fair termination
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Automated Reasoning in Some Local Extensions of Ordered Structures
ISMVL '07 Proceedings of the 37th International Symposium on Multiple-Valued Logic
Orderings for term-rewriting systems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Incremental Instance Generation in Local Reasoning
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Decision procedures for algebraic data types with abstractions
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Decision procedures for multisets with cardinality constraints
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
On local reasoning in verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Ordered sets in the calculus of data structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Automatic termination proofs for programs with shape-shifting heaps
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Proof pearl: a formal proof of Higman's Lemma in ACL2
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
The decidability of the first-order theory of knuth-bendix order
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Hierarchic reasoning in local theory extensions
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Abstraction refinement for termination
SAS'05 Proceedings of the 12th international conference on Static Analysis
Hi-index | 0.00 |
Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current tools has been on developing sophisticated techniques for constructing the abstractions while relying on known decidable logics (such as linear arithmetic) to express them. We believe we can significantly increase the class of programs that are amenable to automated termination proofs by identifying more expressive decidable logics for reasoning about well-founded relations. We therefore present a new decision procedure for reasoning about multiset orderings, which are among the most powerful orderings used to prove termination. We show that, using our decision procedure, one can automatically prove termination of natural abstractions of programs.