777 search results - page 34 / 156 » Model Checking with Formula-Dependent Abstract Models |
CADE
2002
Springer
15 years 10 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
MEMOCODE
2007
IEEE
15 years 4 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...
KBSE
2003
IEEE
15 years 3 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 ...
ATVA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
89
Voted
ACSD
2004
IEEE
15 years 1 months ago
2004
IEEE
Abstract. This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by a...