Sciweavers

328 search results - page 17 / 66
» Proving Termination of Communicating Programs
Sort
View
ANCS
2006
ACM
14 years 1 months ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
IFIP
2003
Springer
14 years 26 days ago
A Service Discovery Model for Wireless and Mobile Terminals in IPv6
As the mobility and the number of affordable, powerful, and highly portable devices becoming networked increases, so will the amount of networked services offered, managed and disc...
Bilhanan Silverajan, Jaakko Kalliosalo, Jarmo Harj...
ISCC
2007
IEEE
126views Communications» more  ISCC 2007»
14 years 1 months ago
VoIP Communications in Wireless Ad-hoc Network with Gateways
In this paper, we investigate some of the issues that arise when mobile nodes engage voice connections with remote peers by using a wireless ad hoc network (MANET–cell) to acces...
Elena Fasolo, Federico Maguolo, Andrea Zanella, Mi...
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
Synchrony vs Asynchrony in Communication Primitives
We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming feat...
Daniele Gorla
PPDP
2007
Springer
14 years 1 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana