104 search results - page 3 / 21 » Proving Termination Properties with mu-term |
102
click to vote
ICTAC
2004
Springer
15 years 5 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
183
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
102
Voted
SAS
2010
Springer
14 years 10 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
100
Voted
LPAR
2010
Springer
14 years 11 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...
110
Voted
RTA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...