Sciweavers

2 search results - page 1 / 1
» Deeper Bound in BMC by Combining Constant Propagation and Ab...
Sort
View
ASPDAC
2007
ACM
139views Hardware» more  ASPDAC 2007»
13 years 10 months ago
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, ...
DC
2008
13 years 6 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat