Sciweavers

297 search results - page 55 / 60
» Model Checking Guarded Protocols
Sort
View
FOSSACS
2003
Springer
15 years 11 months ago
When Ambients Cannot Be Opened
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
Iovka Boneva, Jean-Marc Talbot
WOA
2010
15 years 4 months ago
Using Mobile Agents for Secure Biometric Authentication
This paper deals with the definition of a strong authentication model, coupling usual password/PIN based methods with a biometric matching, over a Multi Agent distributed infrastru...
Marco Tranquillin, Carlo Ferrari, Michele Moro
MMM
2010
Springer
141views Multimedia» more  MMM 2010»
15 years 8 months ago
Slow Intelligence Systems
: Networks and distributed computing systems are becoming increasingly important and at the same time, more and more critical to the world of Information Technology. This rash spre...
Shi-Kuo Chang
ASYNC
2007
IEEE
129views Hardware» more  ASYNC 2007»
15 years 10 months ago
Formal Verification of CHP Specifications with CADP Illustration on an Asynchronous Network-on-Chip
Few formal verification techniques are currently available for asynchronous designs. In this paper, we describe a new approach for the formal verification of asynchronous architec...
Gwen Salaün, Wendelin Serwe, Yvain Thonnart, ...
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri