4502 search results - page 135 / 901 » Regular Model Checking |
94
Voted
MEMOCODE
2007
IEEE
15 years 7 months ago
2007
IEEE
The always increasing complexity of digital system is overcome in design flows based on Transaction Level Modeling (TLM) by designing and verifying the system at difbstraction le...
99
Voted
KBSE
2003
IEEE
15 years 6 months ago
2003
IEEE
A key problem in model checking open systems is environment modeling (i.e., representing the behavior of the execution context of the system under analysis). Software systems are ...
112
Voted
SBMF
2010
Springer
14 years 7 months ago
2010
Springer
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
90
Voted
ICCAD
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
93
Voted
FORMATS
2007
Springer
15 years 7 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...