453 search results - page 22 / 91 » Using Symbolic Simulation for Bounded Property Checking |
ICFEM
2007
Springer
14 years 1 months 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 ...
INFOCOM
2009
IEEE
14 years 2 months 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...
CHARME
2005
Springer
14 years 1 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 ...
CADE
2008
Springer
14 years 7 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-...
DSD
2004
IEEE
13 years 11 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...