Sciweavers

437 search results - page 32 / 88
» Proving Termination by Divergence
Sort
View
AML
2005
69views more  AML 2005»
13 years 7 months ago
Epsilon substitution for transfinite induction
We apply Mints' technique for proving the termination of the epsilon substitution method via cut-elimination to the system of Peano Arithmetic with Transfinite Induction give...
Henry Towsner
MFCS
2010
Springer
13 years 6 months ago
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen
POPL
2009
ACM
14 years 8 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
VTC
2006
IEEE
108views Communications» more  VTC 2006»
14 years 1 months ago
A New Pricing Function for Power Control Game in Wireless Data Networks
— This paper presents a new pricing function for noncooperative power control game in a single cell CDMA data network. Considering a utility function for each terminal, the purpo...
Abdorasoul Ghasemi, Karim Faez, Mehdi Dehghan
AAECC
2008
Springer
110views Algorithms» more  AAECC 2008»
13 years 8 months ago
Adding constants to string rewriting
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
René Thiemann, Hans Zantema, Jürgen Gi...