266 search results - page 1 / 54 » Can Saturation Be Parallelised |
FMICS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Symbolic state-space generators are notoriously hard to parallelise. However, the Saturation algorithm implemented in the SMART verification tool differs from other seque...
ENTCS
2008
13 years 5 months ago
2008
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. Thi...
HPDC
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper presents the concept of pluggable parallelisation that allows scientists to develop “sequential like” codes that can take advantage of multi-core, cluster and grid ...
CSFW
2012
IEEE
11 years 7 months ago
2012
IEEE
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
CASES
2000
ACM
13 years 9 months ago
2000
ACM
This paper presents designs for parallel saturating multioperand adders. These adders have only a single carrypropagate adder on the critical delay path, yet produce the same resu...