1716 search results - page 34 / 344 » Proving Conditional Termination |
101
click to vote
ADT
2010
15 years 2 months ago
2010
: In the era of mobile and wireless networks, the growing complexity of end devices and the accentuated tendency towards miniaturization of them raise new security challenges. Auth...
106
Voted
DEXA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq....
111
Voted
PLILP
1992
Springer
15 years 6 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
119
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract— Throughput performance of the IEEE 802.11 Distributed Coordination Function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper ...
128
Voted
LOPSTR
2009
Springer
15 years 9 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...