2 search results - page 1 / 1 » Deeper Bound in BMC by Combining Constant Propagation and Ab... |
133
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
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...
168
click to vote
DC
2008
15 years 6 months ago
2008
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...