1716 search results - page 38 / 344 » Proving Conditional Termination |
104
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
— A wireless MIMO link is considered in a LOS configuration with multiple SISO wireless repeaters assisting. A theoretical analysis is presented in which repeater positions are c...
128
Voted
PPDP
1999
Springer
15 years 6 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
108
Voted
CORR
2000
Springer
15 years 2 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
114
click to vote
ENTCS
2008
15 years 2 months ago
2008
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...
139
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...