Sciweavers

55 search results - page 3 / 11
» Shared Hash Tables in Parallel Model Checking
Sort
View
SPIN
2005
Springer
14 years 2 months ago
An Incremental Heap Canonicalization Algorithm
Abstract. The most expensive operation in explicit state model checking is the hash computation required to store the explored states in a hash table. One way to reduce this comput...
Madanlal Musuvathi, David L. Dill
STTT
2010
115views more  STTT 2010»
13 years 7 months ago
Scalable shared memory LTL model checking
Recent development in computer hardware has brought more wide-spread emergence of shared memory, multi-core systems. These architectures offer opportunities to speed up various ta...
Jiri Barnat, Lubos Brim, Petr Rockai
SC
1991
ACM
14 years 2 days ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada
ICLP
2001
Springer
14 years 1 months ago
On a Tabling Engine That Can Exploit Or-Parallelism
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
COLCOM
2007
IEEE
14 years 2 months ago
Kademlia for data storage and retrieval in enterprise networks
— Centralized organization of current enterprise networks doesn’t represent an ideal solution in terms of information security and reliability. Denial of service, packet filter...
Natalya Fedotova, Stefano Fanti, Luca Veltri