453 search results - page 22 / 91 » Using Symbolic Simulation for Bounded Property Checking |
134
click to vote
ICFEM
2007
Springer
16 years 18 hour ago
2007
Springer
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
171
click to vote
INFOCOM
2009
IEEE
16 years 15 days ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
157
click to vote
CHARME
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
184
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
165
click to vote
DSD
2004
IEEE
15 years 9 months ago
2004
IEEE
Validation of programmable architectures, consisting of processor cores, coprocessors, and memory subsystems, is one of the major bottlenecks in current Systemon-Chip design metho...