Sciweavers

2517 search results - page 56 / 504
» Specifying Weak Sets
Sort
View
ICDT
2009
ACM
119views Database» more  ICDT 2009»
16 years 16 days ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose
CAV
2006
Springer
141views Hardware» more  CAV 2006»
15 years 3 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
AINA
2004
IEEE
15 years 3 months ago
Formal Verification of PAP and EAP-MD5 Protocols in Wireless Networks: FDR Model Checking
IEEE 802.1x and authentication server based security protocols are mainly used for enhancing security of wireless networks. In this paper, we specify PAP and EAP-MD5 based securit...
Il-Gon Kim, Jin-Young Choi
IEEEARES
2007
IEEE
15 years 6 months ago
CSP-Based Firewall Rule Set Diagnosis using Security Policies
The most important part of a firewall configuration process is the implementation of a security policy by a security administrator. However, this security policy is not designed b...
Sergio Pozo, Rafael Ceballos, Rafael M. Gasca
WG
2004
Springer
15 years 5 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern