288 search results - page 6 / 58 » Interactive Termination Proofs Using Termination Cores |
CSL
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
90
Voted
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
100
click to vote
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
SCP
2002
14 years 11 months ago
2002
It is common for a real-time system to contain a nonterminating process monitoring an input and controlling an output. Hence, a real-time program development method needs to suppo...