Sciweavers

2488 search results - page 411 / 498
» An improvement in formal verification
Sort
View
HPCC
2007
Springer
15 years 7 months ago
CDACAN: A Scalable Structured P2P Network Based on Continuous Discrete Approach and CAN
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
Lingwei Li, Qunwei Xue, Deke Guo
MEMOCODE
2006
IEEE
15 years 7 months ago
Mixed symbolic representations for model checking software programs
We present an efficient symbolic search algorithm for software model checking. The algorithm combines multiple symbolic representations to efficiently represent the transition r...
Zijiang Yang, Chao Wang, Aarti Gupta, Franjo Ivanc...
SIGIR
2006
ACM
15 years 7 months ago
LDA-based document models for ad-hoc retrieval
Search algorithms incorporating some form of topic model have a long history in information retrieval. For example, cluster-based retrieval has been studied since the 60s and has ...
Xing Wei, W. Bruce Croft
CAV
2005
Springer
127views Hardware» more  CAV 2005»
15 years 7 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
15 years 6 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...