Sciweavers

502 search results - page 14 / 101
» Verifying Balanced Trees
Sort
View
FDTC
2006
Springer
117views Cryptology» more  FDTC 2006»
14 years 1 months ago
DPA on Faulty Cryptographic Hardware and Countermeasures
Abstract. Balanced gates are an effective countermeasure against power analysis attacks only if they can be guaranteed to maintain their power balance. Traditional testing and reli...
Konrad J. Kulikowski, Mark G. Karpovsky, Alexander...
CORR
2008
Springer
78views Education» more  CORR 2008»
13 years 10 months ago
Verified Null-Move Pruning
In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever th...
Omid David-Tabibi, Nathan S. Netanyahu
KBSE
2005
IEEE
14 years 3 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
ATAL
2009
Springer
14 years 2 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon
GIS
2010
ACM
13 years 8 months ago
Verifying spatial queries using Voronoi neighbors
With the popularity of location-based services and the abundant usage of smart phones and GPS enabled devices, the necessity of outsourcing spatial data has grown rapidly over the...
Ling Hu, Wei-Shinn Ku, Spiridon Bakiras, Cyrus Sha...