Sciweavers

5451 search results - page 41 / 1091
» On very high degrees
Sort
View
AMAI
2010
Springer
13 years 7 months ago
Efficient approximate verification of B and Z models via symmetry markers
Abstract We present a new approximate verification technique for falsifying the invariants of B models. The technique employs symmetry of B models induced by the use of deferred se...
Michael Leuschel, Thierry Massart
PPOPP
2003
ACM
14 years 3 months ago
Compiler support for speculative multithreading architecture with probabilistic points-to analysis
Speculative multithreading (SpMT) architecture can exploit thread-level parallelism that cannot be identified statically. Speedup can be obtained by speculatively executing threa...
Peng-Sheng Chen, Ming-Yu Hung, Yuan-Shin Hwang, Ro...
EDBT
2000
ACM
14 years 1 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
ATVA
2007
Springer
90views Hardware» more  ATVA 2007»
14 years 1 months ago
Efficient Approximate Verification of Promela Models Via Symmetry Markers
We present a new verification technique for Promela which exploits state-space symmetries induced by scalarset values used in a model. The technique involves efficiently computing ...
Dragan Bosnacki, Alastair F. Donaldson, Michael Le...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 7 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi