48 search results - page 8 / 10 » Formal Verification of Diagnosability via Symbolic Model Che... |
192
click to vote
FMICS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
184
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
177
click to vote
FC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
148
click to vote
ARTS
1997
Springer
15 years 10 months ago
1997
Springer
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
137
click to vote
FMICS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Symbolic state-space generators are notoriously hard to parallelise. However, the Saturation algorithm implemented in the SMART verification tool differs from other seque...