Proving Program Termination in Higher Order Logic

Proving Program Termination in Higher Order Logic, 2002.

Cited by: 0|Bibtex|Views0|
EI
Keywords:
proving program terminationcontraction conditionwellfounded recursionrecursive programhigher order logicMore(6+)

Abstract:

We suggest two simple additions to packages that use wellfounded recursion to justify termination of recursive programs: * The contraction condition, to be proved in cases when termination conditions are difficult or impossible to extract automatically; * user-supplied inductive invariants in cases of nested recursion. We have implemented...More

Code:

Data:

Your rating :
0

 

Tags
Comments