Sciweavers

444 search results - page 22 / 89
» Termination by Abstraction
Sort
View
CONCUR
2006
Springer
14 years 25 days ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
TMC
2008
161views more  TMC 2008»
13 years 9 months ago
A New MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks
Abstract--In wireless ad hoc networks, in addition to the well-known hidden terminal and exposed terminal problems, the locationdependent contention may cause serious unfairness an...
Ping Wang, Hai Jiang, Weihua Zhuang
ICCCN
2007
IEEE
14 years 3 months ago
SpotMAC: A Pencil-Beam MAC for Wireless Mesh Networks
Abstract— Deafness is a key problem. It erodes the performance gains provided by directional antennas, and introduces a new hidden terminal problem. To address deafness, and henc...
Kwan-Wu Chin
IEICET
2006
86views more  IEICET 2006»
13 years 9 months ago
Multiband Mobile Communication System for Wide Coverage and High Data Rate
Abstract-- This paper studies a multiband mobile communication system to support both high data rate services and wide service coverage, using high and low frequency resources with...
Yoshitaka Hara, Kazuyoshi Oshima
RTA
1997
Springer
14 years 1 months ago
Innocuous Constructor-Sharing Combinations
Abstract. We investigate conditions under which con uence and or termination are preserved for constructor-sharing and hierarchical combinations of rewrite systems, one of which is...
Nachum Dershowitz