437 search results - page 36 / 88 » Proving Termination by Divergence |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
ESSLLI
2009
Springer
13 years 5 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
EJWCN
2010
13 years 2 months ago
2010
We present a general game-theoretical framework for the resource allocation problem in the downlink scenario of distributed wireless small-cell networks, where multiple access poi...
WOWMOM
2005
ACM
14 years 1 months ago
2005
ACM
IEEE 802.11 Medium Access Control (MAC) called Distributed Coordination Function (DCF) provides two different access modes, namely, 2-way (basic access) and 4-way (RTS/CTS) hands...
JAR
2010
13 years 2 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...